A construction of big convolutional codes from short called block Markov superposition transmission (BMST) is proposed. The BMST very similar to encoding (SBME), which has been widely used prove multiuser coding theorems. can also be viewed as a class spatially coupled codes, where the generator matrices involved (referred basic codes) are coupled. process fast that code, while decoding implemented an iterative sliding-window algorithm with tunable delay. More importantly, performance simply...

This paper provides an overview on the rationales in incorporating massive multiple-input multiple-output (MIMO), non-orthogonal multiple access (NOMA), and interleave division (IDMA) a unified framework. Our emphasis is multi-user gain that refers to advantage of allowing transmission MIMO. Such can potentially offer tens or even hundreds times rate increase. The main difficulty achieving reliance accurate channel state information (CSI) existing schemes. With CSI, both OMA NOMA deliver...

This paper is concerned with pilot transmission schemes in a large antenna system non-orthogonal multiple-access (NOMA). We investigate two structures-orthogonal (OP) and superimposed (SP). In OP, pilots occupy dedicated time (or frequency) slots, while SP, are data. study an iterative data-aided channel estimation (IDACE) receiver, where partially decoded data used to refine estimation. analyze the achievable rates for systems IDACE receivers both OP SP. show that optimal portion of power...

This paper studies a large random matrix system (LRMS) model involving an arbitrary signal distribution and forward error control (FEC) coding. We establish area property based on the approximate message passing (AMP) algorithm. Under assumption that state evolution for AMP is correct coded system, achievable rate of analyzed. prove achieves constrained capacity LRMS with provided matching condition satisfied. As byproduct, we provide alternative derivation constraint using proved AMP....

In this paper, we present a new approach, called block Markov superposition transmission (BMST), to construct from short codes class of convolutional with large constraint length. The BMST is very similar encoding (SBME), which has been widely used prove multiuser coding theorems. We also an iterative sliding-window decoding algorithm for the proposed scheme. extra gain obtained by can be bounded in terms order and help input-output weight enumerating function (IOWEF) system, computed that...

For any given short code (referred to as the basic code), block Markov superposition transmission (BMST) provides a simple way obtain predictable extra coding gain by spatially coupling generator matrix of code. This paper presents systematic design methodology for BMST systems approach channel capacity at target bit error rate (BER) interest. To simplify design, we choose Cartesian product The encoding memory is then inferred from genie-aided lower bound according performance gap...

As an important part of beyond the fifth-generation (B5G) and sixth-generation (6G) mobile communication systems, ultra-reliable low latency communications (uRLLC) puts forward strict requirements for delay reliability (e.g., 99.9999% <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$500 \mu \text{s}$ </tex-math></inline-formula> latency). At present, evaluation measures are usually based on infinite block...

This letter presents a method to construct family of codes with rate K/N(K = 1,2,...,N - 1) for any given integer N > 1. codes, referred as RSPC short, consist the repetition (R) code, single-parity-check (SPC) code and obtained by time-sharing between R SPC code. The have extremely simple encoding soft-input soft-output (SISO) decoding algorithms, hence can be integrated into recently proposed block Markov superposition transmission (BMST) system. BMST introduces memory across short...

Spatial modulation (SM) is a multiple-input multiple-output (MIMO) transmission technique that maps the information into both antenna indices and signals from conventional signal constellation. Block Markov superposition (BMST) recently proposed coding scheme which has good performance predictable lower bound. In this letter, we propose to combine BMST with SM, resulting in system, acronymized as BMST-SM for convenience. Also presented sliding-window decoding executed iteratively between...

Hadamard transform~(HT) as over the binary field provides a natural way to implement multiple-rate codes~(referred {\em HT-coset codes}), where code length $N=2^p$ is fixed but dimension $K$ can be varied from $1$ $N-1$ by adjusting set of frozen bits. The codes, including Reed-Muller~(RM) codes and polar typical examples, share pair encoder decoder with implementation complexity order $O(N \log N)$. However, guarantee that all designated rates perform well, coding usually requires...

In this letter, we construct bit-interleaved coded modulation (BICM) using a simple basic code but transmitting multiple times in way similar to the block Markov superposition transmission (BMST). The system admits sliding-window decoding/demapping algorithm that can be employed trade off performance against delay. Motivated different from BMST with binary phase-shift keying (BPSK) signalling, lower bound on is derived an equivalent genie-aided system. Numerical results show performances of...

Forward error control (FEC) codes based on turbo, low-density parity-check (LDPC) and polar principles provide practical approaches towards channel capacity. There are, however, remaining challenges. Some of these are listed below. · How to achieve performance with Gaussian signaling'? design that universally good over different conditions'? reduce code length while maintain performance? In this paper, we introduce a scheme the recent progresses spatial coupling compressed sensing. The new...

We consider a low-cost code shift division multiple-access (CSDMA) scheme, in which user-specific shifting is used to replace interleaving interleave multiple access (IDMA). also outline Gaussian approximation-based linear minimum mean square error message passing detection technique for CSDMA. show that CSDMA can offer almost the same performance as original IDMA low-density parity-check or turbo coded systems, but with considerably lower implementation cost.

This paper considers a compressed-coding scheme that combines compressed sensing with forward error control coding. Approximate message passing (AMP) is used to decode the message. Based on state evolution analysis of AMP, we derive performance limit compressed-coding. We show can approach Gaussian capacity at very low compression ratio. Further, results are extended systems involving non-linear effects such as clipping. approaching property still be maintained when generalized AMP To...

Interleave-division multiple access (IDMA) is a scheme that has been considered in several recent proposals for the 5th generation cellular system. In this letter, basing on evolution analysis, we show performance of IDMA can be enhanced using transfer function matching principle. Such realized by superposition coded modulation, power control, repetition coding, and zero padding. Zero padding together with cyclic shifting also leads to reduced implementation complexity. Our analysis based...

In this study, the authors consider designing low‐density parity‐check (LDPC) coded modulation systems to achieve unequal error protection (UEP). They propose a new UEP approach by partial superposition transmission (PST) called UEP‐by‐PST. UEP‐by‐PST system, information sequence is distinguished as two parts, more important data (MID) and less (LID), both of which are with LDPC codes. The codeword that corresponds MID superimposed on LID. system performance can be analysed using discretised...

We establish a multiuser extrinsic information transfer (EXIT) chart area theorem for the interleave-division multiple access (IDMA) scheme, special form of superposition coding, in channels (MACs). A low-cost multi-user detection (MUD) based on Gaussian approximation (GA) is assumed. The evolution mean-square errors (MSE) GA-based MUD during iterative processing studied. show that K-dimensional tuples formed by MSEs K users constitute conservative vector field. achievable rate potential...

An error floor problem is observed for a spatially coupled sparse-regression (SCSR) code with limited sparsity in low-to-medium rates. This letter presents scheme that also involves spatial-coupling and compressed-sensing (SCCS) similar to SCSR. We replace position modulation SCSR by general concatenated forward control code. introduce chaining principle improves the behavior of underlying show SCCS based on chained Hadamard codes can offer significantly improved performance.

In this paper, we propose a simple procedure to construct (decodable) good codes with any given alphabet (of moderate size) for (rational) code rate achieve target error performance interest) over additive white Gaussian noise channels. We start constructing groups rates. This can be done in an extremely way if ignore the requirement time being. Actually, satisfied by repetition (R) and uncoded (UN) transmission along time-sharing technique. The resulting are simply referred as RUN...

Using a finite field approach, novel algebraic construction of low-density parity-check (LDPC) convolutional codes with fast encoding property is proposed. According to the matrices quasi-cyclic (QC) constructed based on multiplicative groups fields and that binary circulant matrix isomorphic ring, we first generate polynomial-form an LDPC code under given rate over field. Then some related modifications are made upon original obtain new one property. Simulation results show proposed have...

This paper is concerned with the spatial modulation (SM), a multiple-input multiple-output (MIMO) transmission technique, that maps information bits not only into conventional two-dimensional signal points but also indices of active transmit antennas. We present two-layer coded SM scheme, in which carried by antenna and signals are protected separately two error correction codes. For ease decoding process, code rates allocated according to chain rule mutual information. choose block Markov...

Interleave division multiple access (IDMA) has been discussed as an option in the 5th generation communications. In this paper, we will provide some design techniques for IDMA to support high overloading applications. We first outline strategies, including superposition coding, repetition coding and zero-padding, improve matching property receiver. also discuss a low-cost shifted interleaving scheme reduce implementation cost of IDMA. Simulation results demonstrate effectiveness these techniques.

In this paper, we combine regular amplitude phase-shift keying (RAPSK) constellation with Gray mapping for link-level performance improvement. Under the criteria of bit-interleaved coded modulation (BICM) mutual information (MI), search optimal Gray-mapped RAPSK (Gray-RAPSK) a given size. We design labeling Gray-RAPSK based on bit-level MI. Simulation results show that shaping gains more than 0.5 dB are obtained 256-ary at block error rate (BLER) 10 <sup...

In this paper, we propose a convolution transform design for polarization-adjusted convolutional (PAC) codes with rate matching. The proposed is adapted to matching patterns. More specifically, bits output from profiling but indices punctured (or shortened) in do not participate convolution. Also, the forward extended general transform. It shown that recursive feedback can perform better than original Simulation results show PAC about $0.1\sim 0.2\mathrm{dB}$ 5G polar at block error of $10^{-4}$.

A novel concatenation of Hamming check and polarization-adjusted convolutional (PAC) codes is proposed to improve the reliability PAC with medium block length. The construction Hamming-PAC provided, a Hamming-check-aided (HA) list decoding described accordingly. simple method based on analyze minimum weight distribution (MHWD) codes. MHWD can be greatly improved by concatenating check. Simulation results show that outperform CRC-Polar CRC-PAC codes, which verifies obtained these