Fast Decoding Algorithm for Low-Density Parity-Check Codes(Fundamental Theories for Communications)

スポンサーリンク

概要

• 論文の詳細を見る

• A fast decoding algorithm for low-density parity-check codes is presented based on graph decomposition and two-way message passing schedule. Simulations show that the convergence speed of the proposed algorithm is about twice that of the conventional belief propagation algorithm.

• 社団法人電子情報通信学会の論文
• 2005-11-01

著者

• Wang Dan

  State Key Lab Of Isn Xidian University

• Hu Xiao

  Ibm Zurich Research Laboratory

• PING Li

  Department of Electronic Engineering, City University of Hong Kong

• WANG Xin

  State Key Lab of ISN, Xidian University

• Wang Xin

  State Key Lab Of Isn Xidian University

• Ping Li

  Department Of Electronic Engineering City University Of Hong Kong

関連論文

• Fast Decoding Algorithm for Low-Density Parity-Check Codes(Fundamental Theories for Communications)
• Optimal Power Control of IDMA Systems
• Optimal Power Control of IDMA Systems
• Synthesis of hematite particles with various shapes by a simple hydrothermal reaction(Aqueous Solution Science for Ceramic Processing II)
• Interleaving-Based Multiple Access and Iterative Chip-by-Chip Multiuser Detection(Wireless Communication Technology)
• A Novel Turbo-TCM Scheme Based on Concatenated Tree Codes
• The current situation of the oral health service and dental prophylaxis in Guangdong Province, China
• A Method to Compute All Fixed Points of Iterative MUD of IDMA Systems
• Synthesis of hematite particles with various shapes by a simple hydrothermal reaction
• Factor V Leiden and inflammatory bowel disease : a systematic review and meta-analysis

スポンサーリンク