Name
Abstract | ||
|---|---|---|
The Pe-criterion is a recent analysis of sequential decoding of tree codes based on the design condition that the decoder must achieve a set error probability Pe. This work extends the criterion to channels with intersymbol interference (ISI), assuming binary random coding, and both hard and soft decision decoding. The result is a definite boundary for the tree search region and a well defined estimate of path numbers searched. Comparisons among the channels show the influence of ISI in the decoding process. We show how ISI increases the search region and number of paths searched as compared to memoryless channels. Furthermore, we show that the use of soft decisions may not only result in large savings as compared to hard decisions, but indeed be the key to assure feasibility of the limited search decoder. |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1007/3-540-57936-2_40 | Proceedings of the third Canadian workshop on Information theory and applications |
Keywords | Field | DocType |
sequential decoding,intersymbol interference channel | Intersymbol interference,Mathematical optimization,Sequential decoding,Computer science,Algorithm,Communication channel,Intersymbol interference channels,Nyquist ISI criterion,Decoding methods,Probability of error,Binary number | Conference |
ISBN | Citations | PageRank |
3-540-57936-2 | 0 | 0.34 |
References | Authors | |
4 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ivonete Markman | 1 | 0 | 0.34 |
| John B. Anderson | 2 | 0 | 0.34 |