一種Turbo碼譯碼的矩陣算法

留言板

尊敬的讀者、作者、審稿人, 關(guān)于本刊的投稿、審稿、編輯和出版的任何問題, 您可以本頁添加留言。我們將盡快給您答復(fù)。謝謝您的支持!

姓名

郵箱

手機號碼

標題

留言內(nèi)容

驗證碼

一種Turbo碼譯碼的矩陣算法

文章導(dǎo)航 > 電子與信息學報 > 2002 > 24(2): 266-271

張忠培, 周亮. 一種Turbo碼譯碼的矩陣算法[J]. 電子與信息學報, 2002, 24(2): 266-271.

引用本文:

張忠培, 周亮. 一種Turbo碼譯碼的矩陣算法[J]. 電子與信息學報, 2002, 24(2): 266-271.

Zhang Zhongpei, Zhou Liang. A Matrix decoding algorithm for Turbo-codes[J]. Journal of Electronics & Information Technology, 2002, 24(2): 266-271.

Citation:

Zhang Zhongpei, Zhou Liang. A Matrix decoding algorithm for Turbo-codes[J]. Journal of Electronics & Information Technology, 2002, 24(2): 266-271.

張忠培, 周亮. 一種Turbo碼譯碼的矩陣算法[J]. 電子與信息學報, 2002, 24(2): 266-271.

引用本文:

張忠培, 周亮. 一種Turbo碼譯碼的矩陣算法[J]. 電子與信息學報, 2002, 24(2): 266-271.

Zhang Zhongpei, Zhou Liang. A Matrix decoding algorithm for Turbo-codes[J]. Journal of Electronics & Information Technology, 2002, 24(2): 266-271.

Citation:

Zhang Zhongpei, Zhou Liang. A Matrix decoding algorithm for Turbo-codes[J]. Journal of Electronics & Information Technology, 2002, 24(2): 266-271.

A Matrix decoding algorithm for Turbo-codes

摘要: 在Bahl矩陣算法的基礎(chǔ)上,提出了Turbo碼譯碼的矩陣算法,使Turbo碼的復(fù)雜迭代運算簡化為適用于大規(guī)模集成電路的矩陣運算,運算速度得以提高,數(shù)據(jù)存量變小,譯碼過程簡單明了,特別適用于約束長度較小的Turbo碼譯碼。討論了第三代移動通Turbo編碼的狀態(tài)轉(zhuǎn)移圖及矩陣譯碼過程。
- MAP算法; Turbo碼; 迭代譯碼; 矩陣算法
Abstract: A new matrix decoding algorithm for Turbo-codes is derived from Bahl s matrix algorithm. The complex iterating operations are paralleled and well formulclted as a set of simple matrix operations which are fit to design efficient VLSI circuits. Thus, the matrix algorithm increases the decoding speed and simplifies the excessive memory accesses, and is specially fit to Turbo-codes with small memories. States transfer and decoding process of Turbo-codes in 3GPP are also discussed in this paper.