We focus on an unsourced random access (URA) system for communication over fading channels where the payload of each packet is encoded for error-correction, repeated, permuted, and scrambled. Each packet is also equipped with a preamble that is used for channel estimation and detection of permutation and scrambling sequences utilized for payload encoding. We propose an algorithm to resolve multiple-access preamble transmission, based on the approximate message-passing (AMP), that is capable to support high numbers of active users and achieve low probabilities of miss-detection. We also develop a parallel interference cancellation technique for payload reception that iteratively refines the channel estimates and attempts to minimize the mean squared error (MSE) of the users’ data via selective error-correction decoding. Finally, we derive a detailed system performance analysis that closely matches the obtained numerical results. We demonstrate that the presented system can more than double the number of active users, supported by the state-of-the-art systems. Large gains in terms of the minimal required signal-to-noise ratios (SNR)s are also demonstrated for a wide range of active user numbers.
We propose a low-complexity unsourced random access (URA) transmission scheme where the data payload, encoded by an error-reduction code, undergoes repetition, permutation, and spreading. An approach to perform spatial graph coupling of the URA messages via randomized message delays is also presented. The proposed system, in either block or coupled form, outperforms the existing URA counterparts in the high multi-user interference regime and provides a substantial increase in the supported multi-user loads. A choice of stronger, albeit more complex, error-correction code allows for performance improvements at lower system loads. Finally, system performance predictions via a state-evolution analysis are also demonstrated.
17 May 2019 in IEEE Transactions on Information Theory
A novel code construction based on spatially coupled low-density parity-check (SC-LDPC) codes is presented. The proposed code ensembles are comprised of several protographbased chains characterizing individual SC-LDPC codes. We demonstrate that code ensembles obtained by connecting appropriately chosen individual SC-LDPC code chains at specific points have improved iterative decoding thresholds. In addition, the connected chain ensembles have a smaller decoding complexity required to achieve a specific bit error probability compared to individual code chains. Moreover, we demonstrate that, like the individual component chains, the proposed constructions have a typical minimum distance that grows linearly with block length. Finally, we show that the improved asymptotic properties of the connected chain ensembles also translate into improved finite length performance.
25 October 2017 in IEEE Transactions on Information Theory
We analyze a class of high performance, low decoding-data-flow error-correcting codes suitable for high bitrate optical-fibre communication systems. A spatially-coupled split-component ensemble is defined, generalizing from the most important codes of this class, staircase codes and braided block codes, and preserving a deterministic partitioning of component-code bits over code blocks. Our analysis focuses on low-complexity iterative algebraic decoding, which, for the binary erasure channel, is equivalent to a generalization of the peeling decoder. Using the differential equation method, we derive a vector recursion that tracks the expected residual graph evolution throughout the decoding process. The threshold of the recursion, for asymptotically-long component codes, is found using potential function analysis. We generalize the analysis to mixture ensembles consisting of more than one type of component code. We give an example of a mixture ensemble consisting of two component codes, which has better performance than spatially-coupled split-component ensembles consisting of only one component code. The analysis extends to the binary symmetric channel by assuming miscorrection-free componentcode decoding. Simple upper bounds on the number of errors correctable by the ensemble are derived. Finally, we analyze the threshold of spatially-coupled split-component ensembles under beyond bounded-distance component decoding.
16 October 2020 in IEEE Transactions on Circuits and Systems I: Regular Papers
We focus on a hardware implementation of the concatenated forward error-correction (FEC) decoder defined in 400ZR implementation agreement to provide a throughput of 400 Gbps over fiber-optical communication links. We propose a soft-input hard-output low-complexity decoding algorithm for the inner Hamming code. We demonstrate that the algorithm leads to an efficient hardware design with low silicon area and power dissipation. We then propose a hardware implementation architecture of the outer staircase decoder. It features a highly optimized low-power implementation of Bose-Chaudhuri-Hocquenghem (BCH) component decoders and the staircase decoder memory that can be efficiently accessed by either vertical or horizontal component decoders. Finally, we analyze the hardware implementation of the entire 400ZR decoder and investigate the trade-off in terms of power, area, and speed, that results from the inner/outer decoder concatenation and is dictated by the bit-error rate at the output of the inner decoder.
26 May 2025 in IEEE Transactions on Communications
We introduce a novel soft-decision decoding algorithm for binary block codes named ordered reliability direct error pattern testing (ORDEPT). The proposed technique tests a list of partial error patterns (PEP)s that are arranged according to their logistic weight and completed on-the-fly based on the instantaneous received sequence and the code’s parity-check matrix. Our results, obtained for a variety of popular short high-rate codes, demonstrate that ORDEPT outperforms state-of-the-art decoding algorithms such as ordered reliability bits guessing random additive noise decoding (ORBGRAND) in terms of decoding complexity, and is hardware-favorable in terms of latency and energy consumption. The improvements carry on to the iterative decoding of product codes and convolutional product-like codes, where ORDEPT demonstrates the ability to efficiently find multiple candidate codewords and outperform state-of-the art competitors.