Abstract
The joint Viterbi detector/decoder (JVDD) is a recently proposed receiver scheme that does both detection and decoding on a single trellis rather than doing detection on a trellis and decoding on factor graph as in the conventional iterative detector today. The JVDD attempts to return minimum metric legal codeword (MMLC) that is the optimum decision over an AWGN/ISI channel. However in so doing, the computational complexity quickly becomes untenable. In order to manage the computational complexity, GDLD and GDPD codes have been proposed that specifically target the complexity issue of the JVDD. In this work we perform a more in-depth study on several of the codes' parameters on both the performance and the complexity of the JVDD.
Original language | English |
---|---|
Title of host publication | Proceedings - 2014 6th International Conference on Computational Intelligence and Communication Networks, CICN 2014 |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 339-343 |
Number of pages | 5 |
ISBN (Electronic) | 9781479969296 |
DOIs | |
Publication status | Published - Mar 23 2014 |
Externally published | Yes |
Event | 2014 6th International Conference on Computational Intelligence and Communication Networks, CICN 2014 - Bhopal, India Duration: Nov 14 2014 → Nov 16 2014 |
Publication series
Name | Proceedings - 2014 6th International Conference on Computational Intelligence and Communication Networks, CICN 2014 |
---|
Conference
Conference | 2014 6th International Conference on Computational Intelligence and Communication Networks, CICN 2014 |
---|---|
Country/Territory | India |
City | Bhopal |
Period | 11/14/14 → 11/16/14 |
Bibliographical note
Publisher Copyright:© 2014 IEEE.
ASJC Scopus Subject Areas
- Computer Networks and Communications
- Artificial Intelligence
Keywords
- joint detection and decoding
- joint viterbi detector decoder
- JVDD