用於平行渦輪碼之無衝突演算法

Contention Free Algorithm for Parallel Turbo Decoder

曾凱信(Kai-Hsin Tseng)

指導教授 ： 張振壹 ； 方偉騏

國立交通大學/電機學院/電信工程系所/碩士(2009年)

https://doi.org/10.6842/NCTU.2009.00280

摘要

在此論文中我們利用退火模擬演算法(Simulated Annealing Algorithm)提出無衝突演算法去解決平行渦輪碼中記憶體碰撞問題。再者，對於平行渦輪碼中的非本質記憶體，我們提出有效使記憶體面積減少的兩種架構； 其中一種架構是由平行單埠記憶體與一個緩衝暫存器所組成去取代原來須兩埠或雙埠記憶體所組成的架構。另外一個架構，我們基於前一個架構上再加上一個非本質函數的非線性映對器。在前兩種架構相較於傳統使用雙埠記憶體在 0.13 CMOS 聯電製程環境底下分別可以節省約 37 和 46 百分比記憶體使用量。

關鍵字

渦輪碼 ； 平行渦輪解碼器 ； 無衝突演算法

並列摘要

In this thesis, a contention free algorithm for solving memory collision problem of parallel Turbo decoder architecture using the simulated annealing algorithm is presented. Furthermore, we proposed two area-efficient extrinsic memory schemes based on the
parallel contention free Turbo decoder. One of the proposed schemes employs only multiple single port memories with one temporary buffer instead of the original dual port or two port memories. And the other scheme further employs an additional non-linear extrinsic mapping architecture. The proposed schemes lead to approximately 37% and 46% memory area reduction, respectively, for 16-parallel Turbo decoder in comparison to the conventional dual port memory scheme under the UMC 0.13-μm CMOS process.

並列關鍵字

Turbo Code ； Parallel Turbo Decoder ； Contention Free Algorithm

參考文獻

[1]. C. Berrou, A. Glavieux, and P. Thitimajshima, “Near Shannon limit error-correcting coding and decoding: Turbo-codes,” in Proc. ICC, Geneva,

Switzerland, May 1993, pp. 1064–1070.

[2]. Boutillon, E. Douillard, C. Montorsi, G. “Iterative Decoding of Concatenated Convolutional Codes: Implementation Issues,” Proceedings of the IEEE, June 2007, Issue: 6, pp. 1201-1227.

[5]. Consultative Committee for Space Data Systems, CCSDS 131.0-B-1 Blue Book September 2003.

[9]. J. Hokfelt, O. Edfors, and T. Maseng, “A survey on trellis termination alternatives for turbo codes,” in Proc. IEEE Vehicular Technology Conf. (VTC’99), pp2225–2229, May 1999.