147 Hits in 4.7 sec

Channel Coding: The Road to Channel Capacity [article]

Daniel J. Costello Jr., G. David Forney Jr
2006 arXiv   pre-print
We trace the antecedents of today's capacity-approaching codes: convolutional codes, concatenated codes, and other probabilistic coding schemes.  ...  Finally, we sketch some of the practical applications of these codes.  ...  ACKNOWLEDGMENTS The authors would like to thank Mr. Ali Pusane for his help in the preparation of this manuscript. Comments on earlier drafts by C. Berrou, J. L. Massey, and R.  ... 
arXiv:cs/0611112v1 fatcat:iwrrtx7mpfhgzfenehztfi5vyy

Channel coding: The road to channel capacity

Daniel J. Costello, G. David Forney
2007 Proceedings of the IEEE  
We trace the antecedents of today's capacity-approaching codes: convolutional codes, concatenated codes, and other probabilistic coding schemes.  ...  Finally, we sketch some of the practical applications of these codes.  ...  Acknowledgment The authors would like to thank A. Pusane for his help in the preparation of this manuscript. Comments on earlier drafts by C. Berrou, J. L. Massey, and R. Urbanke were very helpful.  ... 
doi:10.1109/jproc.2007.895188 fatcat:pftdplkbergcbpkra6ddfwjtpa

Good error-correcting codes based on very sparse matrices

D.J.C. MacKay
1999 IEEE Transactions on Information Theory  
can be achieved; indeed, the performance of Gallager codes is almost as close to the Shannon limit as that of turbo codes.  ...  The decoding of both codes can be tackled with a practical sum-product algorithm.  ...  Frey, personal communication); the error probability of these turbo codes no longer decreases rapidly with increasing below this floor.  ... 
doi:10.1109/18.748992 fatcat:gtrv4rzsq5flvdl5ng2godxf5a

The Effect of Error Propagation on the Performance of Polar Codes Utilizing Successive Cancellation Decoding Algorithm

O. Gazi, A. A. Andi
2019 Advanced Electromagnetics  
In this paper, we discuss and analyze the effect of error propagation on the performance polar codes decoded using the successive cancellation algorithm.  ...  Furthermore, we observe that the performance of polar codes is significantly improved if even single bit errors are detected and corrected before the decoding of successor bits.  ...  Acknowledgements The authors are thankful to URSI-TÜRKİYE'2018 IX. Scientific Committee.  ... 
doi:10.7716/aem.v8i2.998 fatcat:fpf6awycozghjexofcyfz4y53m

Polar Codes and Their Quantum-Domain Counterparts

Zunaira Babar, Zeynep B. Kaykac Egilmez, Luping Xiang, Daryus Chandra, Robert G. Maunder, Soon Xin Ng, Lajos Hanzo
2019 IEEE Communications Surveys and Tutorials  
By virtue of these attractive features, polar codes have provided fierce competition to both the turbo as well as the Low Density Parity Check (LDPC) codes, making its way into the 5G New Radio (NR).  ...  Arikan's polar codes are capable of achieving the Shannon's capacity at a low encoding and decoding complexity, while inherently supporting rate adaptation.  ...  2 of error correction (known as the outer code) to reduce the BER floor resulting from the inner layer of error correction (called the inner code).  ... 
doi:10.1109/comst.2019.2937923 fatcat:tno37ac5izbljlsf7apqcpapsq

Turbo Autoencoder: Deep learning based channel codes for point-to-point communication channels [article]

Yihan Jiang, Hyeji Kim, Himanshu Asnani, Sreeram Kannan, Sewoong Oh, Pramod Viswanath
2019 arXiv   pre-print
On the other hand, in many non-canonical channel settings, optimal codes do not exist and the codes designed for canonical models are adapted via heuristics to these channels and are thus not guaranteed  ...  In this work, we make significant progress on this problem by designing a fully end-to-end jointly trained neural encoder and decoder, namely, Turbo Autoencoder (TurboAE), with the following contributions  ...  Acknowledgments This work was supported in part by NSF awards 1908003, 651236 and 1703403.  ... 
arXiv:1911.03038v1 fatcat:zqzosaydmvhl3hnfnbshtwuiim

A Case Study in Reliability-Aware Design: A Resilient LDPC Code Decoder

Matthias May, Matthias Alles, Norbert Wehn
2008 2008 Design, Automation and Test in Europe  
We show that an efficient exploitation of the algorithmic fault-tolerance yields a fairly small area overhead with nearly no degradation in communications performance even under high error injection rates  ...  Hence increasing the robustness of chip implementations in terms of error tolerance becomes an important issue.  ...  sponsorship scheme within the scope of the Ekompass-sponsorship complex.  ... 
doi:10.1109/date.2008.4484723 dblp:conf/date/MayAW08 fatcat:up77lmvwzjcejgrl3et23oqkmq

Does Gaussian Approximation Work Well for The Long-Length Polar Code Construction? [article]

Jincheng Dai, Kai Niu, Zhongwei Si, Chao Dong, Jiaru Lin
2017 arXiv   pre-print
In fact, these two sets will lead to the rank error of subsequent subchannels, which means the orders of subchannels are misaligned, which is a severe problem for polar code construction.  ...  the excellent performance of polar codes especially for the long code lengths.  ...  For the high SNR region, although turbo code sometimes performs better than polar code, it suffers from the error floor.  ... 
arXiv:1511.07236v3 fatcat:rew3em6s3bgrpnxyy3zjt53qcm

Quantum Error Correcting Codes and the Security Proof of the BB84 Protocol [article]

Ramesh Bhandari
2014 arXiv   pre-print
These quantum codes are constructed in the quantum domain from two suitable classical linear codes, one used to correct for bit-flip errors and the other for phase-flip errors.  ...  The proof requires the use of quantum error correcting codes called the Calderbank-Shor-Steanne (CSS) quantum codes.  ...  Recent breakthroughs such as the introduction of the turbo codes [12] and low density parity check codes [13, 14] have further increased the efficiency of error-correction algorithms.  ... 
arXiv:1409.1452v1 fatcat:clkxrvfrwvhy3gczvpqcny22vy

TTCM-Aided Rate-Adaptive Distributed Source Coding for Rayleigh Fading Channels

Abdulah Jeza Aljohani, Soon Xin Ng, Lajos Hanzo
2014 IEEE Transactions on Vehicular Technology  
The proposed scheme 12 is capable of reliable communications within 0.80 dB of the 13 Slepian-Wolf/Shannon (SW/S) theoretical limit at a bit error rate 14 (BER) of 10 −5 .  ...  and, hence, to be flawlessly shown at the des-10 tination for exploitation as side information for improving the 11 decoding performance of the first source.  ...  A modified LDPC code was 86 proposed in [14] for mitigating the error floor, but nonetheless, 87 a high error floor persists when the correlation between the 88 sources is low.  ... 
doi:10.1109/tvt.2013.2285020 fatcat:wkwf6wag5nbaxdei2dqnndj3o4


2006 International Journal of Bifurcation and Chaos in Applied Sciences and Engineering  
The use of low-density-parity-check (LDPC) codes in coding digital messages has aroused much research interest because of their excellent bit-error performance.  ...  Results are useful for optimizing the choice of parameters that may enhance the effectiveness of the decoding algorithm and improve the convergence rates.  ...  lower error floor and shorter minimum distance between codewords.  ... 
doi:10.1142/s0218127406016926 fatcat:ei2i6b355vebfl2sq3ftvdljoi

On the use of ordered statistics decoders for low-density parity-check codes in space telecommand links

Marco Baldi, Nicola Maturo, Enrico Paolini, Franco Chiaraluce
2016 EURASIP Journal on Wireless Communications and Networking  
The performance of short low-density parity-check (LDPC) codes that will be included in the standard for next-generation space telecommanding is analyzed.  ...  The paper is focused on the use of a famous ordered statistics decoder known as most reliable basis (MRB) algorithm.  ...  The final goal of the NEXCODE Project is the hardware and software implementation of LDPC decoding schemes for TC.  ... 
doi:10.1186/s13638-016-0769-z fatcat:hguv37pxhfbv3ovic4zixdtuc4

Coding Schemes for User Cooperation in Low-Power Regimes

Guosen Yue, Xiaodong Wang, Zigui Yang, Anders Host-Madsen
2008 IEEE Transactions on Signal Processing  
Although the fully multiplexed (FMP) coding outperforms the superposition coding in theory, it is difficult to implement with practical error-correction codes.  ...  In particular, we consider two block Markov coding schemes, namely, the multiplexed coding and the superposition coding.  ...  In the the code optimization algorithm, we set an additional constraint, the portion of degree-2 nodes , to lower the error floor [26] .  ... 
doi:10.1109/tsp.2007.909266 fatcat:fbf2dcwghbg5jgy3b5nvg6m7mq

Nonlinear dynamics of iterative decoding systems: analysis and applications

L. Kocarev, F. Lehmann, G.M. Maggio, B. Scanavino, Z. Tasev, A. Vardy
2006 IEEE Transactions on Information Theory  
Finally, we propose a novel stopping criterion for turbo codes. L. Kocarev and Z. Tasev are with the  ...  As an application, we develop an adaptive technique to control transient chaos in the turbo decoding algorithm, leading to an improvement of the BER (bit error rate) performance.  ...  ., University of California (DiMi), and CIFRE convention No. 98300.  ... 
doi:10.1109/tit.2006.871054 fatcat:yvizlfhgyve2tis77ktrlrdtsq

Distributed Source Coding and Its Applications in Relaying-Based Transmission

Abdulah Jeza Aljohani, Soon Xin Ng, Lajos Hanzo
2016 IEEE Access  
In addition, a series of turbo trellis-coded modulation (TTCM)-aided DJSC-based cooperative transmission schemes are proposed.  ...  within 0.55 dB from the SW/S limit for a correlation coefficient value of ρ = 0.8, and within 0.07 bits of the minimum SW compression rate.  ...  Later, a modified LDPC code was proposed in [17] for mitigating the above-mentioned error floor, but nonetheless, a substantial error floor persisted, when the correlation between the sources was low  ... 
doi:10.1109/access.2016.2537739 fatcat:h7z4oiya65cahn3n6ncfaa4st4
« Previous Showing results 1 — 15 out of 147 results