A memory collision free algorithm to achieve high parallel SISO decoders for turbo-decoding has been presented. The high parallel collision free Turbo decoder has been implementation for VLSI architecture using the UMC-90nm standard CMOS cell library. As a result, the throughput of 32-memory-collision free turbo-decoding could achieve up to 169.25Mbps with clock frequency 200MHz, which is faster than that of serial SISO decoder 12Mbps
This paper introduces a memory collision free algorithm using simulated annealing heuristic method for parallel Turbo decoder, in which a highly parallel structure is available. By applying memory collision free algorithm, we proposed two area-efficient extrinsic memory schemes achieving lower hardware cost for high parallel Turbo decoder structure. The experimental results in UMC 0.13-μm CMOS process show that the organization of our proposed extrinsic memory without extrinsic non-linear quantization can achieve around 40% memory area reduction for the 32-SISO parallel Turbo decoder relative to conventional extrinsic storage using dual port RAM for the Turbo code of CCSDS standard. On the other hand, the organization of our proposed extrinsic memory with extrinsic non-linear quantization can further achieve around 46%
memory area reduction for the 16-SISO parallel Turbo decoder.
Bibliography
[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.
[3]. A. Nimbalker, T. K. Blankenship, B. Classon, T. E. Fuja, D. J. Costello, Jr,
“Contention-free interleavers,” Int. Symp. on Inf. Theory, June 2004.
[4]. A. Tarable, G. Montorsi and S. Benedetto, “Mapping of interleaving laws to parallel turbo decoder architectures,”, in Proc. 3rd Int. Symp. Turbo Codes Related Topics, Brest, France, Sep. 2003, pp. 153-156.
[5]. Consultative Committee for Space Data Systems, CCSDS 131.0-B-1 Blue Book September 2003.
[6]. S. Dolinar and D. Divsalar, “Weight Distributions for Turbo Codes Using Random and Nonrandom Permutations” TDA Progress Report 42-122, Jet Propulsion Laboratory, Pasadena, California, pp. 56–65, August 15, 1995.
Primitive feedback polynomials.
[7]. D. Divsalar and F. Pollara, “On the design of turbo codes”, TDA Progress Report 42-123, Jet Propulsion Laboratory, Pasadena, California, pp. 99–121, November 15, 1995.
[8]. P. Guinand and J. Lodge, “Trellis termination for turbo encoders,” in Proc. 17th Biennial Symp. Commun., pp. 389–392, May 30-June 1 1994.
[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.
[10]. S. Crozier, P. Guinand, and A. Hunt, “On designing turbo-codes with data puncturing,” in 9th Canadian Workshop on Inform. Theory (CWIT’05), pp. 32–35, June 2005.
[11]. L. C. Perez, J. Seghers, and D. J. Costello, Jr., “A distance spectrum interpretation of turbo codes,” IEEE Trans. Inform. Theory, vol. 42, pp.1698–1709, Nov. 1996.
[12]. C. Berrou, "Turbo codes: some simple ideas for efficient communications", ESA-DSP 2001, Lisbon, Oct. 2001, and ESA-TTC 2001, Noordwijk, The Netherlands, Oct. 2001.
[13]. D. Divsalar and F.Pollara, “Multiple Turbo Codes” MIL-COM’95, pp. 279-285, November 6-8, 1995.
[14]. S. Benedetto and G. Montorsi, “Unveiling Turbo Codes: Some Results on Parallel Concatenated Coding Schemes”, IEEE Trans. on Inform. Theory, Vol. 42, No. 2, pp.409-428, March 1996.
[15]. S. Crozier, J. Lodge, P. Guinand and A. Hunt, "Performance of turbo codes with relatively prime and golden interleaving strategies", Proc. of 6th Int. Mobile Satellite Conf., pp. 268-275, Ottawa, Canada, June 1999.
[16]. C. Berrou, Y. Saouter, C. Douillard, S. Kerouédan and M. Jézéquel, “Designing good permutations for turbo codes: towards a single model,” in Proc. IEEE Int.
Conf. Communications, Paris, France, June 2004.
[17]. E. K. Hall, S. G. Wilson, “Stream-oriented turbo codes,” IEEE Trans. Inform.
Theory, vol.47, pp.1813-1831, July 2001.
[18]. P. Robertson, E. Villebrun, and P. Hoeher, “A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain,” in ZEEE Inc.
on Communications (Seattle, WA, June 1995). pp. 1009-1013.
[19]. A.Worm, P. Hoeher, and N. Wehn, “Turbo-Decoding without SNR Estimation,”
IEEE Communications Letters, vol. 4, no. 6, June 2000.
[20]. M. J. Thul, F. Gilbert, and N. Wehn, “Concurrent Interleaving Architec-tures for High-Throughput Channel Coding,” in Proc. 2003 Conferenceon Acoustics, Speech, and Signal Processing (ICASSP ’03), Hong Kong,P.R.China, Apr. 2003, pp. 613–616.
[21]. T. A. Summers and S. G. Wilson, “SNR mismatch and online estimation in turbo decoding,” IEEE Trans. Commun., vol. 46, no. 4, pp. 421-423, Apr. 1998.
[22]. Zhongfeng Wang, Zhipei Chi and K. K. Parhi, “Area-efficient high speed decoding schemes for Turbo Decoders” IEEE Transactions on very large scale integration (VLSI) 2002.
[23]. TH Tsai, CH Lin, AY Wu, “A memory-reduced log-MAP kernel for turbo decoder,” Circuits and Systems, 2005. ISCAS 2005. IEEE International Symposium on Publication Date: 23-26 May 2005 On page(s): 1032- 1035 Vol. 2 [24]. J.Ertel, J.Vogt and A.Finger, “A high throughput Turbo Decoder for an
OFDM-based WLAN demonstrator,” in proceedings of 5th International ITG Conference, Jan. 2004.
[25]. D. Garrett, B. Xu and C. Nicol, “Energy Efficient Turbo Decoding for 3G Mobile,” Proceedings of 2001 International Symposium on Low Power Electronic Design,pp 328-333.
[26]. R. Dobkin, M. Peleg, and R. Ginosar, “Parallel interleaver design and VLSI architecture for low-latency MAP turbo decoders,” IEEE Trans. on VLSI Systems, vol. 13, no. 4, pp. 427–438, Apr. 2005.
[27]. J. Sun and O. Y. Takeshita, “Interleavers for turbo codes using permutation polynomials over integer rings,” IEEE Trans. on Inform. Theory, vol. 51, no. 1, pp. 101–119, Jan. 2005
[28]. J.Y´a˜nez and J. Ram´ırez, “The robust coloring problem,” European J.Oper.
Res., vol. 148, no. 3, pp. 546–558, 2003.
[29]. A.Lim and F.Wang, “Meta-heuristics for robust graph coloring problem,” in International Conference on Tools with Artificial Intelligence. IEEE Computer Society, 2004, pp. 514–518.
[30]. C.-H. Lin, and A.-Y. Wu, “Low-power traceback MAP decoding for double-binary convolutional turbo decoder,” accepted for publication in Proc.
IEEE ISCAS 2008, Seattle, USA, May 18-21, 2008.
[31]. J.Ertel, J.Vogt, A.Finger, “A high throughput Turbo Decoder for an OFDM-based WLAN demonstrator,” in proceedings of 5th International ITG Conference, Jan. 2004.
[32]. Bougard, A. Giulietti, C. Desset, L. Van der Perre, and F. Catthoor, “A low power high speed parallel concatenated turbo-decoding architecture,” in Proc. Int. Symp.
Turbo Codes and Related Topics, Brest, France,Sep. 2003, pp. 511–514.