A Performance Study of the Joint Viterbi Detector Decoder (JVDD) with GDLD and GDPD Codes

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.