Reduced complexity symbol-by-symbol demodulation

Reduced complexity symbol-by-symbol demodulation is examined. We examine the performance with standard complexity reduction techniques (e.g., M-algorithm and T-algorithm) and then derive a reduced state symbol-by-symbol demodulation algorithm which makes symbol-by-symbol demodulation performance and complexity competitive with sequence estimation. An overview is also included of optimum recursive estimation.