The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Soft-input soft-output (SISO) sphere decoding is applied to multiple-input multi-output (MIMO) systems to offer good bit error rate (BER) performance but at high complexity. To reduce this computational complexity, we propose a novel hybrid enumeration strategy for such decoding that dynamically determines the candidate list; moreover, this strategy uses a new node enumeration based on concentric...
The lack of knowledge of the transmitted codeword limits the synchronization capability of the concatenated code,consisting of a low-density parity-check (LDPC) code and a watermark code, which is used to correct nonbinary insertion/deletion errors. In order to improve the synchronization error-locating capability of the watermark decoder and further decrease the error probability of the system, an...
In this paper, a code-aided maximum-likelihood and moment-based joint SNR estimator is proposed for M- ary amplitude phase shift keying (APSK) signals over AWGN channels. The proposed estimator significantly improves the performance at low SNRs by utilizing the syndrome in the LDPC codes to act as a reference measurement of estimation performance. Moreover, a methodology to measure the performance...
This paper proposes a new graph-based practical encoding and joint belief propagation (BP) decoding techniques for two-vehicle communicating simultaneously with another vehicle or a roadside unit. The proposed scheme achieves any rate pair close to the capacity region without using time sharing. While at the encoders, the corresponding parity check matrices are randomly built from a half-rate matrix,...
New Raptor codes, based on low rate low-density parity-check (LDPC) codes, are proposed for short message length over various channels. The proposed Raptor codes are obtained by pre-coding the information bits by low rate LDPC codes and utilizing a low constant average degree distribution with high intermediate symbol recovery rate (ISRR). Simulation results demonstrate that the proposed Raptor codes...
Low-density parity-check convolutional codes (LDPC-CCs) are generally decoded using sliding- window based message passing decoding. Based on the sliding-window decoding, an informed dynamic scheduling (IDS) for LDPC-CC is proposed in this work, where the decoding convergence can be significantly accelerated. Since the number of processors required for a satisfactory performance can be reduced, the...
Linear index coding is generally more robust against channel variations as compared to the fixed-to-variable length coding. This paper proposes a novel multi-pass decoding approach to decode linear index coded images. In contrast to the typical one-pass decoding, the proposed scheme harnesses the information recovered in the first decoding pass with the source statistics and utilize it in the subsequent...
This paper investigates the performance of convolutional codes with quadrature amplitude modulation transmitted over the Bernoulli-Gaussian impulsive noise channel. First, the performance superiority of blanking over clipping of the symbols affected by noise pulses is proved through the computation of a lower bound on the bit error rate. Next, lower and upper bounds on the bit error rate performance...
A concatenated soft-decision channel coding scheme consisting of an inner LDGM code and an outer staircase code is proposed. The soft-decision LDGM code is used for error reduction while the majority of bit errors are corrected by the low complexity hard-decision staircase code. Decoding complexity of the concatenated code is quantified by a score based on the number of edges in the LDGM code Tanner...
Absorbing sets (ASs) are combinatorially defined objects existing in the Tanner graph of a low-density parity-check (LDPC) code that have been shown to cause failures in the iterative message-passing decoder when transmission occurs over the additive white Gaussian noise channel. In this paper, we propose an edge spreading approach to construct high rate array-based spatially-coupled LDPC codes by...
Spatially coupled codes have been shown to achieve the capacity for a large class of channels universally. Many variants of such codes have been introduced to date. We discuss a further such variant that is particularly simple and is determined by a very small number of parameters. More precisely, we consider and ensemble of time-invariant low-density parity-check convolutional codes with very large...
We propose and design the lattice codes with finite lattice constellations based on multi-dimensional (more than two dimensions) lattice partitions. The codes are constructed from non-binary irregular repeat-accumulate (IRA) codes. Most notably, we propose a novel encoding structure to ensure that the decoder's messages exhibit permutation-invariance and symmetry properties. With these two properties,...
Sparse regression codes (SPARCs) are a recent class of codes for reliable communication over the AWGN channel at rates approaching the channel capacity. Approximate message passing (AMP) decoding, a computationally efficient technique for decoding SPARCs, has been proven to be asymptotically capacity-achieving for the AWGN channel. In this paper, we refine the asymptotic results by deriving a large...
We introduce successive cancellation (SC) decoding of product codes (PCs) with single parity-check (SPC) component codes. Recursive formulas are derived, which resemble the SC decoding algorithm of polar codes. We analyze the error probability of SPC-PCs over the binary erasure channel under SC decoding. A bridge with the analysis of PCs introduced by Elias in 1954 is also established. Furthermore,...
We consider spatially coupled low-density parity-check codes with finite smoothing parameters. A finite smoothing parameter is important for designing practical codes that are decoded using low-complexity windowed decoders. By optimizing the amount of coupling between spatial positions, we show that we can construct codes with excellent thresholds and small rate loss, even with the lowest possible...
LT codes are a class of rateless codes designed for data dissemination on erasure channels. In this paper, we present a decoder for LT codes on partial erasure channels, which were recently introduced for multi-level read storage channel applications. We compare the efficiency of LT codes on these channels to those on the q-ary Erasure Channel (QEC).
This work presents the first integration of a message-passing detector (MPD) and a polar decoder. A soft-output MPD, which is essential to approach the channel capacity, is first proposed. Compared to the state-of-the-art design, the proposed MPD achieves a 6.9x higher throughput with 49% lower energy, despite the soft outputs. The proposed polar decoder achieves a 1.35x higher throughput with comparable...
This paper presents a Non-Binary LDPC decoder with information throughput of 2.267Gbps and power consumption of 212.4mW, yielding an energy efficiency of 93.7pJ/b, implemented in a 40nm CMOS technology. The employed code is long and high-rate without degree-2 variable nodes, resulting in a low error floor. A dual decoding algorithm scheme alleviates the computational complexity of decoding, realized...
This paper is concerned with the design of capacity approaching ensembles of Low-Density Parity-Check (LDPC) codes for correlated sources. We consider correlated binary sources where the data is encoded independently at each source through a systematic LDPC encoder and sent over two independent Gaussian channels. At the receiver, a joint iterative decoder consisting of two component LDPC decoders...
A decoding algorithm is presented for rank-metric array codes that are based on diagonal interleaving of MDS codes. W.r.t. this metric, such array codes are known to be optimal when the underlying field is algebraically closed. It is also shown that for any list decoding radius that is smaller than the minimum rank distance, the list size can be bounded from above by an expression that is independent...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.