Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOn the Performance of Low Density Parity Check Codes for Gaussian Interference Channels
122
0
0.0
(
0
)
Added by
Shahrouz Sharifi
Publication date
2013
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
In this paper, two-user Gaussian interference channel(GIC) is revisited with the objective of developing implementable (explicit) channel codes. Specifically, low density parity check (LDPC) codes are adopted for use over these channels, and their benefits are studied. Different scenarios on the level of interference are considered. In particular, for strong interference channel examples with binary phase shift keying (BPSK), it is demonstrated that rates better than those offered by single user codes with time sharing are achievable. Promising results are also observed with quadrature-shift-keying (QPSK). Under general interference a Han-Kobayashi coding based scheme is employed splitting the information into public and private parts, and utilizing appropriate iterative decoders at the receivers. Using QPSK modulation at the two transmitters, it is shown that rate points higher than those achievable by time sharing are obtained.
rate research
Read More
In this paper, we focus on the two-user Gaussian interference channel (GIC), and study the Han-Kobayashi (HK) coding/decoding strategy with the objective of designing low-density parity-check (LDPC) codes. A code optimization algorithm is proposed which adopts a random perturbation technique via tracking the average mutual information. The degree distribution optimization and convergence threshold computation are carried out for strong and weak interference channels, employing binary phase-shift keying (BPSK). Under strong interference, it is observed that optimized codes operate close to the capacity boundary. For the case of weak interference, it is shown that via the newly designed codes, a nontrivial rate pair is achievable, which is not attainable by single user codes with time-sharing. Performance of the designed LDPC codes are also studied for finite block lengths through simulations of specific codes picked from the optimized degree distributions.
Consider transmission over a binary additive white gaussian noise channel using a fixed low-density parity check code. We consider the posterior measure over the code bits and the corresponding correlation between two codebits, averaged over the noise realizations. We show that for low enough noise variance this average correlation decays exponentially fast with the graph distance between the code bits. One consequence of this result is that for low enough noise variance the GEXIT functions (further averaged over a standard code ensemble) of the belief propagation and optimal decoders are the same.
We consider the effect of log-likelihood ratio saturation on belief propagation decoder low-density parity-check codes. Saturation is commonly done in practice and is known to have a significant effect on error floor performance. Our focus is on threshold analysis and stability of density evolution. We analyze the decoder for standard low-density parity-check code ensembles and show that belief propagation decoding generally degrades gracefully with saturation. Stability of density evolution is, on the other hand, rather strongly effected by saturation and the asymptotic qualitative effect of saturation is similar to reduction by one of variable node degree. We also show under what conditions the block threshold for the saturated belief propagation corresponds with the bit threshold.
We study the performance of low-density parity-check (LDPC) codes over finite integer rings, over two channels that arise from the Lee metric. The first channel is a discrete memory-less channel (DMC) matched to the Lee metric. The second channel adds to each codeword an error vector of constant Lee weight, where the error vector is picked uniformly at random from the set of vectors of constant Lee weight. It is shown that the marginal conditional distribution of the two channels coincides, in the limit of large blocklengths. The performance of selected LDPC code ensembles is analyzed by means of density evolution and finite-length simulations, with belief propagation decoding and with a low-complexity symbol message passing algorithm.
The concept and existence of sphere-bound-achieving and capacity-achieving lattices has been explained on AWGN channels by Forney. LDPC lattices, introduced by Sadeghi, perform very well under iterative decoding algorithm. In this work, we focus on an ensemble of regular LDPC lattices. We produce and investigate an ensemble of LDPC lattices with known properties. It is shown that these lattices are sphere-bound-achieving and capacity-achieving. As byproducts we find the minimum distance, coding gain, kissing number and an upper bound for probability of error for this special ensemble of regular LDPC lattices.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
