On Integer Programming Problems Related to Soft-Decision Iterative Decoding Algorithms
AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
PRISM: An Error-Resilient Video Coding Paradigm for Wireless Networks
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Robust wireless video multicast based on a distributed source coding approach
Signal Processing - Special section: Distributed source coding
Performance Bound for LDPC Coded Unitary Space---Time Modulation
Wireless Personal Communications: An International Journal
IEEE Communications Letters
Comments regarding "on the performance/complexity tradeoff in block turbo decoder design"
IEEE Transactions on Communications
List decoding techniques for intersymbol interference channels using ordered statistics
IEEE Journal on Selected Areas in Communications
IEEE Transactions on Communications
Code automorphisms and permutation decoding of certain Reed-Solomon binary images
IEEE Transactions on Information Theory
Multiple-bases belief-propagation decoding of high-density cyclic codes
IEEE Transactions on Communications
Backward interpolation architecture for algebraic soft-decision reed-solomon decoding
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Efficient Dual Domain Decoding Of Linear Block Codes Using Genetic Algorithms
Journal of Electrical and Computer Engineering
A minimal search soft decision list decoding algorithm for Reed-Solomon codes
International Journal of Information and Communication Technology
Hi-index | 754.90 |
Presents a novel approach to soft decision decoding for binary linear block codes. The basic idea is to achieve a desired error performance progressively in a number of stages. For each decoding stage, the error performance is tightly bounded and the decoding is terminated at the stage where either near-optimum error performance or a desired level of error performance is achieved. As a result, more flexibility in the tradeoff between performance and decoding complexity is provided. The decoding is based on the reordering of the received symbols according to their reliability measure. The statistics of the noise after ordering are evaluated. Based on these statistics, two monotonic properties which dictate the reprocessing strategy are derived. Each codeword is decoded in two steps: (1) hard-decision decoding based on reliability information and (2) reprocessing of the hard-decision-decoded codeword in successive stages until the desired performance is achieved. The reprocessing is based on the monotonic properties of the ordering and is carried out using a cost function. A new resource test tightly related to the reprocessing strategy is introduced to reduce the number of computations at each reprocessing stage. For short codes of lengths N⩽32 or medium codes with 32