摘要 |
<p>The present invention achieves the benefits of the improved joint detector previously disclosed with significantly less computation by, first, moving the backward substitution computation outside the detector's decoding iteration loop and, second, by moving the input buffer inside the iteration loop. The backward substitution computation is performed initially as part of a joint detection equalization stage prior to entering the decode iteration loop. Then with each decode iteration, the present invention generates a correction signal that is subtracted from the present input signal to produce the next input signal. Each correction signal is generated from a series of differences between the decoded symbols of the current iteration and those in the previous iteration. Thus, the present invention achieves the same performance improvement over conventional joint detectors as the improved joint detector previously disclosed but with dramatically less computational requirements.</p> |