Name
Title | ||
|---|---|---|
A New Non-Iterative Decoding Algorithm for the Erasure Channel : Comparisons with Enhanced Iterative Methods |
Abstract | ||
|---|---|---|
This paper investigates decoding of binary linear block codes over the binary erasure channel (BEC). Of the current iterative decoding algorithms on this channel, we review the Recovery Algorithm and the Guess Algorithm. We then present a Multi-Guess Algorithm extended from the Guess Algorithm and a new algorithm - the In-place Algorithm. The Multi-Guess Algorithm can push the limit to break the stopping sets. However, the performance of the Guess and the Multi- Guess Algorithm depend on the parity-check matrix of the code. Simulations show that we can decrease the frame error rate by several orders of magnitude using the Guess and the Multi-Guess Algorithms when the parity-check matrix of the code is sparse. The In-place Algorithm can obtain better performance even if the parity check matrix is dense. We consider the application of these algorithms in the implementation of multicast and broadcast techniques on the Internet. Using these algorithms, a user does not have to wait until the entire transmission has been received. |
Year | Venue | Keywords |
|---|---|---|
2005 | Clinical Orthopaedics and Related Research | erasure channel,block codes,information theory,binary erasure channel,iteration method |
Field | DocType | Volume |
Sequential decoding,Berlekamp–Welch algorithm,Parity-check matrix,Iterative method,Computer science,Binary erasure channel,Algorithm,Multicast,Decoding methods,Erasure code | Journal | abs/cs/050 |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| J. Cai | 1 | 0 | 0.34 |
| C. Tjhai | 2 | 24 | 6.02 |
| Martin Tomlinson | 3 | 106 | 19.89 |
| A. Ambroze | 4 | 70 | 13.00 |
| Mohammed Ahmed | 5 | 8 | 2.50 |