Abstract
In this paper, a new top-down style recursive maximum likelihood decoding (MLD) using ordered statistic information is proposed. An effective termination condition is introduced.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 2002 IEEE Information Theory Workshop, ITW 2002 |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Number of pages | 1 |
| ISBN (Electronic) | 0780376293, 9780780376298 |
| DOIs | |
| Publication status | Published - Jan 1 2002 |
| Externally published | Yes |
| Event | 2002 IEEE Information Theory Workshop, ITW 2002 - Bangalore, India Duration: Oct 20 2002 → Oct 25 2002 |
Publication series
| Name | Proceedings of the 2002 IEEE Information Theory Workshop, ITW 2002 |
|---|
Other
| Other | 2002 IEEE Information Theory Workshop, ITW 2002 |
|---|---|
| Country | India |
| City | Bangalore |
| Period | 10/20/02 → 10/25/02 |
ASJC Scopus subject areas
- Information Systems
- Electrical and Electronic Engineering
- Computer Networks and Communications
- Computational Theory and Mathematics
Fingerprint Dive into the research topics of 'Top-down recursive maximum likelihood decoding using ordered statistic information'. Together they form a unique fingerprint.
Cite this
Koumoto, T., & Kasami, T. (2002). Top-down recursive maximum likelihood decoding using ordered statistic information. In Proceedings of the 2002 IEEE Information Theory Workshop, ITW 2002 [1115458] (Proceedings of the 2002 IEEE Information Theory Workshop, ITW 2002). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ITW.2002.1115458