Soft-decision decoding of linear block codes using multiple information bases
Date
2003Source
IEEE International Symposium on Information Theory - ProceedingsIEEE International Symposium on Information Theory - Proceedings
Google Scholar check
Keyword(s):
Metadata
Show full item recordAbstract
A previous study addressed algorithms that perform soft-decision decoding by utilizing encodings of test error patterns (TEPs) on the so-called "most reliable basis" which can be obtained by a greedy search algorithm. In the present work, this approach is extended to setting of two-basis. It is shown that this algorithm is worth noting because it virtually needs no memory and is suited for parallel computation.