Results 21 - 30
of
140
Low-Complexity Chase-Like Bounded-Distance Decoding Algorithms
"... A soft-decision decoder for an error-correcting block code of Hamming distance d is said to achieve bounded-distance (BD) decoding if its error-correction radius is equal to that of a complete Euclidean distance decoder. The Chase decoding algorithms are reliability-based algorithms achieving BD de ..."
Abstract
-
Cited by 4 (2 self)
- Add to MetaCart
A soft-decision decoder for an error-correcting block code of Hamming distance d is said to achieve bounded-distance (BD) decoding if its error-correction radius is equal to that of a complete Euclidean distance decoder. The Chase decoding algorithms are reliability-based algorithms achieving BD decoding. The least complex version of the original Chase algorithms (“Chase-3”) uses about d/2 trials of a conventional binary decoder. In this paper, we propose two Chase-like decoding algorithms which also achieve BD decoding: a static method requiring about d/6 trials, and a dynamic method requiring only about d/12 trials. Hence, the complexity is reduced by factors of three and six, respectively, compared to the Chase-3 algorithm.
Toward New Link Layer Protocols
, 1994
"... This paper describes an experimental new link layer protocol for amateur packet radio use. It extends my earlier MACA scheme for dealing with hidden terminals by incorporating a powerful forward error correction (FEC) scheme: convolutional coding with sequential decoding. The resulting hybrid protoc ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
(Show Context)
This paper describes an experimental new link layer protocol for amateur packet radio use. It extends my earlier MACA scheme for dealing with hidden terminals by incorporating a powerful forward error correction (FEC) scheme: convolutional coding with sequential decoding. The resulting hybrid protocol combines the best of the FEC and retransmission (ARQ) techniques. It should perform very well in the presence of hidden terminals, noise and interference, particularly pulsed radar QRM like that often found on the 70cm amateur band. 1. Introduction AX.25 [1] is now 12 years old. Although it has become the universal standard link level protocol for amateur packet radio, it is widely recognized as being far from optimal. The experience of the past decade plus significant advances in the computer technology now available to the radio amateur suggest that we look at much more sophisticated alternatives. These techniques have existed for many years 1 ,but only now have powerful modern PCs b...
Approaching the ml performance with iterative decoding
- International Zurich Seminar on Communications
, 2004
"... Abstract — The paper presents a method to significantly improve the convergence of iteratively decoded concatenated schemes and reduce the gap between iterative and maximum likelihood (ML) decoding. It is shown that many of the error blocks produced by the iterative decoder can be corrected by modif ..."
Abstract
-
Cited by 3 (3 self)
- Add to MetaCart
(Show Context)
Abstract — The paper presents a method to significantly improve the convergence of iteratively decoded concatenated schemes and reduce the gap between iterative and maximum likelihood (ML) decoding. It is shown that many of the error blocks produced by the iterative decoder can be corrected by modifying a single critical coordinate (channel value) of the received vector and repeating the decoding. This is the basis of the RVCM (Recieved Vector Coordinate Modification) algorithm. Its description, performance and drawbacks are discussed later on. The paper also presents a practically obtained lower bound on ML performance based on the Euclidean distances of the trans-mitted and the iteratively decoded codewords from the received vector. At low SNR this bound is assuming an unrealistic perfect code, while at high SNR the aproximations are getting closer to the real characteristics of the code and the RVCM iterative decoder is shown to achieve the ultimate ML performance. I.
Turbo decoding of product codes based on the modified adaptive belief propagation algorithm
- in Proc. of ISIT
, 2007
"... Abstract—This paper introduces the Modified Adaptive Belief Propagation (m-ABP) algorithm, an innovative method for the turbo decoding of product codes based on BCH component codes. The Adaptive Belief Propagation algorithm of Jiang and Narayanan is simplified by moving the matrix adaptation step ou ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
(Show Context)
Abstract—This paper introduces the Modified Adaptive Belief Propagation (m-ABP) algorithm, an innovative method for the turbo decoding of product codes based on BCH component codes. The Adaptive Belief Propagation algorithm of Jiang and Narayanan is simplified by moving the matrix adaptation step outside of the iteration loop, significantly reducing the complexity. Performance in terms of the biterror-rate (BER) of the novel turbo decoding algorithm is given. Simulation results for the turbo decoding of product codes show that compared to the Chase-Pyndiah algorithm no significant BER deviation is observed while the highlyparallelizable graph-based structure of the algorithm enables high-throughput decoding. Index Terms — iterative decoding of product codes, Adaptive Belief Propagation, BCH codes, parity check matrix. I.
An Improved Soft BCH Decoder with One Extra Error Compensation
"... Abstract—In existing soft decision algorithms, a soft BCH decoders provides better error correcting performance but has much higher hardware complexity than a traditional hard BCH decoder. In this paper, a soft BCH decoder with both better error correcting performance and lower complexity is present ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
(Show Context)
Abstract—In existing soft decision algorithms, a soft BCH decoders provides better error correcting performance but has much higher hardware complexity than a traditional hard BCH decoder. In this paper, a soft BCH decoder with both better error correcting performance and lower complexity is presented. The low complexity feature of the proposed architecture is achieved by dealing with least reliable bits. By compensating extra one error outside the least reliable set, the error correcting ability is improved. In addition, the proposed error locator evaluator evaluates error locations without Chien search, leading to high throughput. As compared with the traditional hard BCH decoder, the experimental result reveals that our proposed improved soft BCH decoder can achieve 0.75db coding gain for BCH (255,239) code. Implemented in standard CMOS 90nm technology, it can reach 316.3Mb/s throughput at 360MHz operation frequency with gate-count of 4.06K according to the post-layout simulations.
VLSI circuit complexity and decoding performance analysis for low-power RSC turbo-code and iterative block decoders design
- IEEE Military Communications Conference
, 1998
"... A VLSI circuit complexity analysis for low-power de-coder designs is presented. Two low-complexity adaptive decoder architectures incorporating the ~ecursive system-atic codes (turbo-codes) and the block-codes are consid-ered in this paper. The system performance degradation due to the algorithm app ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
A VLSI circuit complexity analysis for low-power de-coder designs is presented. Two low-complexity adaptive decoder architectures incorporating the ~ecursive system-atic codes (turbo-codes) and the block-codes are consid-ered in this paper. The system performance degradation due to the algorithm approximations for realizing the low complexity decoders is also investigated. The decoders are implemented with 0.6-pm CMOS standard cell tech-nology where their power dissipation and size informa-tion are obtained. Furthermore, the issues concerning the throughput and latency of the decoder architectures are discussed. This study provides insights into system design trade-ofls involving low-power VLSI decoders for portable wireless mobile communication systems. I.
Georghiades, “Product accumulate codes: a class of capacity-approaching, low complexity codes,” submitted to
- IEEE Trans. Inform. Theory
, 2001
"... ..."
High speed VLSI architecture design for block turbo decoder
- in Proceedings of the IEEE International Symposium on Circuits and Systems (ISCAS ’02
, 2002
"... ..."
(Show Context)
Soft-decision Reed-Solomon decoding on partial response channels
- in Proc. IEEE Global Telecom. Conf
, 2002
"... Abstract — Since the discovery of Turbo Codes, iterative decoding has gained enormous momentum. The idea of repeatedly passing information between components of a receiver or decoder to increase the overall system performance has attracted much research effort. In this work, we present an iterative ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
(Show Context)
Abstract — Since the discovery of Turbo Codes, iterative decoding has gained enormous momentum. The idea of repeatedly passing information between components of a receiver or decoder to increase the overall system performance has attracted much research effort. In this work, we present an iterative soft-decision decoding architecture for Reed-Solomon (RS) codes on a partial-response (PR) channel. The architecture incorporates a symbol-based a-posteriori probability (APP) detector for the channel, and an enhanced softdecision RS decoder based upon the recently introduced Koetter-Vardy (KV) algorithm. From the list of candidate RS codewords generated by the KV decoder, we calculate output symbol reliabilities that can be fed back to the APP detector as extrinsic information to be used in a subsequent decoding iteration. Through simulations, we show the efficacy of this approach, especially when the initial KV list size is large. We will also propose ways to modify the decoding scheme in order to beneficially increase the size of the candidate codeword list and thereby improve the overall system performance. I.
