Reliability-based code-search algorithms for maximum-likelihood decoding of block codes

Gazelle, D.; Snyders, J.

doi:10.1109/18.567691

Cited by 73 publications

(34 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An algorithm suggested by Dorsch [11] in 1974 is referred to as the first MRB reprocessing type algorithm. Since Dorsch's algorithm, several variations and improvements have been proposed [8,[12][13][14]. One of the most powerful MRB reprocessing type algorithm is Fossorier et al [8] Order-l reprocessing algorithm.…”

Section: Performance Analysismentioning

confidence: 99%

Soft-decision Decoding of Block Codes using the k Shortest Paths Algorithm

Shakeel

Grant

2006

2006 IEEE Information Theory Workshop - ITW '06 Chengdu

View full text Add to dashboard Cite

In this paper, we develop a softdecision decoding algorithm for block codes using the k shortest paths algorithm. The performance of this algorithm is investigated and compared with other decoding schemes. The results show the proposed algorithm gives large gains over the Generalised Minimum Distance (GMD) decoding algorithm and algebraic hard-decision decoding. Further, the proposed algorithm achieves near-MLD performance for the codes simulated. An investigation of the complexity of this algorithm shows the proposed algorithm to be computationally more efficient than the standard Order-l reprocessing algorithm.

show abstract

Section: Performance Analysismentioning

confidence: 99%

Soft-decision Decoding of Block Codes using the k Shortest Paths Algorithm

Shakeel

Grant

2006

2006 IEEE Information Theory Workshop - ITW '06 Chengdu

View full text Add to dashboard Cite

show abstract

“…The structured reprocessing also allowed to derive tight upper bounds on the error performance for any w. In particular, the method was shown to be asymptotically optimal when w ≈ min{ dmin 4 , K}, where K denotes the information dimension and d min denotes the minimum Hamming distance of the code. In [11], Gazelle and Snyders presented an ML decoding algorithm using order-reprocessing on the MRB, and introduced an efficient skipping rule to avoid redundant recodings. In [15], Valembois and Fossorier applied the socalled "box and match" technique to order-w reprocessing to correct 2w bit errors in an extended MRB composed of the MRB information bits and a control band from the most reliable redundancy part.…”

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

“…Because of the use of algebraic decoder, this set should be as small as possible in order to minimize the decoding complexity. That is the subject of many studies reported [2][3][4][5][6], which focus on finding out optimal or near optimal MLD algorithms.…”

Section: Introductionmentioning

confidence: 99%