• Àüü
  • ÀüÀÚ/Àü±â
  • Åë½Å
  • ÄÄÇ»ÅÍ
´Ý±â

»çÀÌÆ®¸Ê

Loading..

Please wait....

¿µ¹® ³í¹®Áö

Ȩ Ȩ > ¿¬±¸¹®Çå > ¿µ¹® ³í¹®Áö > TIIS (Çѱ¹ÀÎÅͳÝÁ¤º¸ÇÐȸ)

TIIS (Çѱ¹ÀÎÅͳÝÁ¤º¸ÇÐȸ)

Current Result Document :

ÇѱÛÁ¦¸ñ(Korean Title) Performance Improvement of Iterative Demodulation and Decoding for Spatially Coupling Data Transmission by Joint Sparse Graph
¿µ¹®Á¦¸ñ(English Title) Performance Improvement of Iterative Demodulation and Decoding for Spatially Coupling Data Transmission by Joint Sparse Graph
ÀúÀÚ(Author) Zhengxuan Liu   Guixia Kang   Zhongwei Si   Ningbo Zhang  
¿ø¹®¼ö·Ïó(Citation) VOL 10 NO. 12 PP. 5401 ~ 5421 (2016. 12)
Çѱ۳»¿ë
(Korean Abstract)
¿µ¹®³»¿ë
(English Abstract)
Both low-density parity-check (LDPC) codes and the multiple access technique of spatially coupling data transmission (SCDT) can be expressed in bipartite graphs. To improve the performance of iterative demodulation and decoding for SCDT, a novel joint sparse graph (JSG) with SCDT and LDPC codes is constructed. Based on the JSG, an approach for iterative joint demodulation and decoding by belief propagation (BP) is presented as an exploration of the flooding schedule, and based on BP, density evolution equations are derived to analyze the performance of the iterative receiver. To accelerate the convergence speed and reduce the complexity of joint demodulation and decoding, a novel serial schedule is proposed. Numerical results show that the joint demodulation and decoding for SCDT based on JSG can significantly improve the system¡¯s performance, while roughly half of the iterations can be saved by using the proposed serial schedule.
Å°¿öµå(Keyword) Spatial coupling   joint sparse graph   belief propagation   density evolution   serial schedule  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå