Soft-Decision Decoding of Linear Block Codes Using Preprocessing and Diversification

Wu, Yingquan; Hadjicostis, Christoforos N.

doi:10.1109/tit.2006.887478

Cited by 33 publications

(17 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We will see from simulation results that this method can significantly improve the asymptotic performance, but also increases the worst case complexity. Similar techniques have been used in conjunction with OSD by Fossorier [25] and Wu [11]. The way of grouping reliable bits used here is similar to the grouping scheme by Wu [11].…”

Section: B Various Groupings Of Unreliable Bitsmentioning

confidence: 99%

“…Similar techniques have been used in conjunction with OSD by Fossorier [25] and Wu [11]. The way of grouping reliable bits used here is similar to the grouping scheme by Wu [11]. We refer interested readers to [11] for a detailed description and asymptotic performance analysis.…”

Section: B Various Groupings Of Unreliable Bitsmentioning

confidence: 99%

“…Recent work [9] reduces the complexity and modifies the algorithm in [8] to generate soft output efficiently. By using the binary image expansion of RS codes, we can also use decoding algorithms for general linear block codes such as reliability based ordered statistics decoding (OSD) [10] and its variations [11] for soft decision decoding of RS codes. Previous such works include the hybrid algorithm by Hu and Shu Lin [12] and the box and match algorithm (BMA) [13] by Fossorier and Valembois.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Iterative Soft-Input Soft-Output Decoding of Reed–Solomon Codes by Adapting the Parity-Check Matrix

Jiang

Narayanan

2006

IEEE Trans. Inform. Theory

164

152

View full text Add to dashboard Cite

Abstract-An iterative algorithm is presented for soft-inputsoft-output (SISO) decoding of Reed-Solomon (RS) codes. The proposed iterative algorithm uses the sum product algorithm (SPA) in conjunction with a binary parity check matrix of the RS code. The novelty is in reducing a submatrix of the binary parity check matrix that corresponds to less reliable bits to a sparse nature before the SPA is applied at each iteration. The proposed algorithm can be geometrically interpreted as a twostage gradient descent with an adaptive potential function. This adaptive procedure is crucial to the convergence behavior of the gradient descent algorithm and, therefore, significantly improves the performance. Simulation results show that the proposed decoding algorithm and its variations provide significant gain over hard decision decoding (HDD) and compare favorably with other popular soft decision decoding methods.Index Terms-adapting the parity check matrix, gradient descent, iterative decoding, soft decision decoding, Reed-Solomon (RS) codes.

show abstract

Section: B Various Groupings Of Unreliable Bitsmentioning

confidence: 99%

Section: B Various Groupings Of Unreliable Bitsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Iterative Soft-Input Soft-Output Decoding of Reed–Solomon Codes by Adapting the Parity-Check Matrix

Jiang

Narayanan

2006

IEEE Trans. Inform. Theory

164

152

View full text Add to dashboard Cite

show abstract

“…In [12], Jin and Fossorier investigated multi-basis order reprocessing (as well as its natural extension box-match method) by applying random biases to the channel reliabilities each time. In [17], Wu and Hadjicostis investigated preprocessing and multi-basis and analytically showed that the proposed preprocessing enables to asymptotically achieve order−(w+2) reprocessing while maintaining the complexity of order-w reprocessing and a properly chosen multi-basis scheme significantly increases the list error correction radius.…”

Section: Introductionmentioning

confidence: 99%

“…To date, the notion of basis diversification has been extensively explored [7], [9], [17], [12]. In this paper we extend the notion of diversification into box-and-match technique.…”

Section: Introductionmentioning

confidence: 99%

Soft-decision decoding using time and memory diversification

Fossorier

2008

2008 IEEE International Symposium on Information Theory

View full text Add to dashboard Cite

In this paper, the idea of diversification is applied to box-and-match technique and a multi-basis-multi-box decoding algorithm is developed for soft-decision decoding of binary linear block codes. New preprocessing techniques are also employed to improve computational efficiency. These new techniques allow to achieve near maximum likelihood decoding of the (256,131) extended BCH code, which has not been reported so far.

show abstract