Graph-based detection and reduced-complexity LDPC decoding over 2D intersymbol interference channels

Author(s):  
Zhiliang Qin ◽  
Yingying Li ◽  
Yu Qin ◽  
Qidong Lu ◽  
Xiaowei Liu
2021 ◽  
pp. 91-98
Author(s):  
Yingying Li ◽  
◽  
Zhiliang Qin ◽  
Lianghui Zou ◽  
Yu Qin ◽  
...  

In this paper, we propose a fully graph-based iterative detection and decoding scheme for Low-Density Parity-Check (LDPC) coded generalized two-dimensional (2D) intersymbol interference (ISI) channels. The 2D detector consists of a downtrack detector based on the symbol-level sum-product algorithm (SPA) and a bit-level SPA-based crosstrack detector. A LDPC decoder based on simplified check node operations is also proposed to provide soft information for the 2D channel detector. Numerical results show that the proposed receiver achieves better performance as compared with the trellis-based BCJR detector over 2×2 2D channels while at a significantly lower computational complexity.


2014 ◽  
Vol 50 (11) ◽  
pp. 1-4 ◽  
Author(s):  
Lingjun Kong ◽  
Yunxiang Jiang ◽  
Guojun Han ◽  
Francis C. M. Lau ◽  
Yong Liang Guan

The objective in this paper is to analyze the structural complexity of the non-binary coded modulation schemes for transmission over the digital communication channels which are band-limited and subjected to Intersymbol Interference (ISI). The design of reduced complexity M-QAM Coded Modulation schemes are analyzed algebraically. The performance is demonstrated through simulation.


Sign in / Sign up

Export Citation Format

Share Document