Errors-and-Erasures Decoding for Block Codes With Feedback

Download

index.pdf

Date

2012-01-01

Author

Nakiboğlu, Barış

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

138
views

54
downloads

Inner and outer bounds are derived on the optimal performance of fixed-length block codes on discrete memoryless channels with feedback and errors-and-erasures decoding. First, an inner bound is derived using a two-phase encoding scheme with communication and control phases together with the optimal decoding rule for the given encoding scheme, among decoding rules that can be represented in terms of pairwise comparisons between the messages. Then, an outer bound is derived using a generalization of the straight-line bound to errors-and-erasures decoders and the optimal error-exponent tradeoff of a feedback encoder with two messages. In addition, upper and lower bounds are derived, for the optimal erasure exponent of error-free block codes in terms of the rate. Finally, a proof is provided for the fact that the optimal tradeoff between error exponents of a two-message code does not improve with feedback on discrete memoryless channels (DMCs).

Subject Keywords

Decision feedback, Discrete memoryless channels (dmcs), Error exponent, Errors-and-erasures decoding, Feedback, Feedback encoding schemes, Soft decoding, Two-phase encoding schemes, Variable-length coding

URI

https://hdl.handle.net/11511/45616

Journal

IEEE TRANSACTIONS ON INFORMATION THEORY

DOI

https://doi.org/10.1109/tit.2011.2169529

Collections

Department of Electrical and Electronics Engineering, Article

Suggestions

OpenMETU
Core

Errors-and-erasures decoding for block codes with feedback Nakiboğlu, Barış (2008-08-08) Fixed length block codes on discrete memoryless channels with feedback are considered for errors and erasures decoding. Upper and lower bounds are derived for the error exponent in terms of the rate and the erasure exponents. In addition the converse result of Burnashev for variable length block codes is extended to include list decoding.
Upper bounds to error probability with feedback Nakiboğlu, Barış (2010-01-22) A new analysis technique is suggested for bounding the error probability of fixed length block codes with feedback on discrete memoryless channels from above. Error analysis is inspired by Gal lager's error analysis for block codes without feedback. Using Burnashev-Zigangirov-D'yachkov encoding scheme analysis recovers previously known best results on binary symmetric channels and improves up on the previously known best results on k-ary symmetric channels and binary input channels.
Fine resolution frequency estimation from three DFT samples: Case of windowed data Candan, Çağatay (2015-09-01) An efficient and low complexity frequency estimation method based on the discrete Fourier transform (DFT) samples is described. The suggested method can operate with an arbitrary window function in the absence or presence of zero-padding. The frequency estimation performance of the suggested method is shown to follow the Cramer-Rao bound closely without any error floor due to estimator bias, even at exceptionally high signal-to-noise-ratio (SNR) values.
Efficient Computation of Green's Functions for Multilayer Media in the Context of 5G Applications Mittra, Raj; Özgün, Özlem; Li, Chao; Kuzuoğlu, Mustafa (2021-03-22) This paper presents a novel method for effective computation of Sommerfeld integrals which arise in problems involving antennas or scatterers embedded in planar multilayered media. Sommerfeld integrals that need to be computed in the evaluation of spatial-domain Green's functions are often highly oscillatory and slowly decaying. For this reason, standard numerical integration methods are not efficient for such integrals, especially at millimeter waves. The main motivation of the proposed method is to comput...
Belief propagation decoding of polar codes under factor graph permutations Peker, Ahmet Gökhan; Yücel, Melek Diker; Department of Electrical and Electronics Engineering (2018) Polar codes, introduced by Arıkan, are linear block codes that can achieve the capacity of symmetric binary-input discrete memoryless channels with low encoding and decoding complexity. Polar codes of block length N are constructed by channel polarization method, which consists of channel combining and splitting operations to obtain N polarized subchannels from N copies of binary-input discrete memoryless channels. As N grows, symmetric channel capacities of the polarized subchannels converge to either 0 or...

Citation Formats

B. Nakiboğlu, “Errors-and-Erasures Decoding for Block Codes With Feedback,” IEEE TRANSACTIONS ON INFORMATION THEORY, pp. 24–49, 2012, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/45616.