零填充ISI信道上基于低复杂度SVD的预编码
Low-Complexity SVD-Based Precoding over Zero-Padded ISI Channels
AI总结:
针对零填充记忆长度为1的ISI信道,提出低复杂度SVD预编码收发机,复杂度O(n log n),在FER 10^-5时比传统RS译码系统性能提升约5 dB,高SNR下性能接近SOVA接收机。
摘要:
我们针对零填充记忆长度为1的ISI信道,提出了一种基于低复杂度SVD的收发机。在n个符号的块后附加单个零填充符号,可得到一个n×(n-1)的信道矩阵,其具有精确对称三对角托普利茨格拉姆矩阵。该结构提供闭式奇异值与奇异向量,无需显式构造稠密SVD矩阵,即可通过FFT实现精确SVD预编码与均衡。所得实现的复杂度为O(n log n),仅产生1/n的速率损失。该并行标量子信道支持联合自适应PAM与功率分配以最小化SER,随后为LDPC译码计算精确软信息。在约0.945的可比码率下,仿真显示,在FER为10^-5时,所提方案比采用硬判决里德-所罗门(RS)译码的传统TX-FFE/RX-DFE系统性能提升约5 dB;在高SNR下,其FER性能与采用LDPC译码的SOVA接收机几乎相当,同时用快速SVD预编码与精确标量软输出计算替代了基于网格的检测。
英文摘要:
We propose a low-complexity SVD-based transceiver for zero-padded memory-$1$ ISI channels. Appending a single zero-padding symbol to an $n$-symbol block yields an $n\times(n-1)$ channel matrix with an \emph{exact symmetric tridiagonal Toeplitz Gram matrix}. This structure provides closed-form singular values and vectors, enabling exact SVD precoding and equalization via FFTs without explicitly forming dense SVD matrices. The resulting implementation has $O(n\log n)$ complexity and incurs only a $1/n$ rate penalty. The resulting parallel scalar subchannels enable joint adaptive PAM and power allocation for SER minimization, followed by exact soft-information computation for LDPC decoding. At comparable code rates near $0.945$, simulations show that our proposed scheme outperforms a conventional TX-FFE/RX-DFE system with hard-decision Reed-Solomon (RS) decoding by approximately $5$ dB at FER $10^{-5}$. At high SNR, it achieves nearly the same FER performance as a SOVA-based receiver with LDPC decoding, while replacing trellis-based detection with fast SVD precoding and exact scalar soft-output computation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。