Sciweavers

Share
TCOM
2010

Early-Elimination Modification for Priority-First Search Decoding

9 years 4 months ago
Early-Elimination Modification for Priority-First Search Decoding
Abstract--In order to release the growing demand for computational complexity with respect to increasing information sequence length in the priority-first search decoding algorithm, a path elimination modification is proposed and also analyzed in this work. Specifically, we propose to directly eliminate all paths whose end nodes are -level prior to the farthest node among those that have been visited thus far by the priority-first search. Following the argument on random coding, we then analyze the path elimination window that results in a larger exponent for additional decoding error caused by path elimination than the exponent of the maximum-likelihood error performance, and hence guarantees exponentially negligible performance degradation. Our analytical results indicate that under additive white Gaussian noise (AWGN) channels, the path elimination window required for exponentially negligible performance degradation is just three times the code constraint length for rate one-half c...
Shin-Lin Shieh, Po-Ning Chen, Yunghsiang S. Han, T
Added 21 May 2011
Updated 21 May 2011
Type Journal
Year 2010
Where TCOM
Authors Shin-Lin Shieh, Po-Ning Chen, Yunghsiang S. Han, Ting-Yi Wu
Comments (0)
books