2015/06/24 by Sha Hu, Hu, Sha, Fredrik Rusek +1
Computer Science · Engineering · Mathematics · #Advanced Power Amplifier Design #Advanced Wireless Communication Techniques #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Networks Research #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1506.07331
Submitted; 47 pages; 12 figures
openalex publication_date 2015/06/24 · arxiv created 2017/12/21 · arxiv updated 2017/12/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We consider the problem of designing demodulators for linear vector channels with memory that use reduced-size trellis descriptions for the received signal. We assume an overall iterative receiver, and for the parts of the signal not covered by the trellis description, we use interference cancelation based on the soft information provided by the outer decoder. In order to reach a trellis description, a linear filter is applied as front-end to compress the signal structure into a small trellis. This process requires three parameters to be designed: (i) the front-end filter, (ii) the feedback filter through which the interference cancelation is done, and (iii) a target response which specifies the trellis. Demodulators of this form have been studied before under then name channel shortening (CS), but the interplay between CS and interference cancelation has not been adequately addressed in the literature. In this paper, we analyze two types of CS demodulators that are based on the Forney and Ungerboeck detection models, respectively. The parameters are jointly optimized based on a generalized mutual information (GMI) function. We also introduce a third type of CS demodulator that is in general suboptimal but has closed form solutions for all parameters. Moreover, signal to noise ratio (SNR) asymptotic properties are analyzed and we show that the third CS demodulator asymptotically converges to the optimal CS demodulator in the sense of maximizing the GMI.