Abstract
In this chapter the capability of PP-based interleavers to be used for parallel turbo decoding is investigated. Maximum contention-free property of any degree PP interleavers, proved by Takeshita (2006), is presented in Sect. 6.2. The new approach of parallel access to the memories by butterfly networks for any degree PPs introduced by Nieminen (2014, 2017) is proved in Sect. 6.3.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
3GPP TS 36.212 V8.3.0, 3rd generation partnership project, Multiplexing and channel coding (Release 8) (2008), http://www.etsi.org
L.R. Bahl et al., Optimal decoding of linear codes for minimizing symbol error rate. IEEE Trans. Inf. Theory 20(2), 284–287 (1974)
S. Benedetto et al., Design issues on the parallel implementation of versatile, high-speed iterative decoders, in 4rd International Symposium on Turbo Codes and Related Topics, Munich, Germany 3–7 April 2006
C. Berrou et al., Designing good permutations for turbo codes: towards a single model, in IEEE International Conference on Communications (ICC), Paris, France, vol. 1 (2004), pp. 341–345
ETSI EN 301 790 V1.3.1, Digital video broadcasting (DVB); Interaction channel for satellite distribution systems (2003), http://www.broadcasting.ru/pdf-standard-specifications/interactivity/dvb-rcs/en301790.v1.3.1.pdf
A. Giulietti, L. Van der Perre, M. Strum, Parallel turbo coding interleavers: avoiding collisions in accesses to storage elements. Electron. Lett. 38(5), 232–234 (2002)
J. Kwak, K. Lee, Design of dividable interleaver for parallel decoding in turbo codes. Electron. Lett. 38(22), 1362–1364 (2002)
D.H. Lawrie, Access and alignment of data in an array processor. IEEE Trans. Comput. 24(12), 1145–1155 (1975)
E. Nieminen, A contention-free parallel access by butterfly networks for turbo interleavers. IEEE Trans. Inf. Theory 60(1), 237–251 (2014)
E. Nieminen, On quadratic permutation polynomials, turbo codes, and butterfly networks. IEEE Trans. Inf. Theory 63(9), 5793–5801 (2017)
A. Nimbalker et al., Inter-window shuffle interleavers for high throughput turbo decoding, in 3rd International Symposium on Turbo Codes and Related Topics, Brest, France, 1–5 September 2003, pp. 355–358
A. Nimbalker et al., Contention-free interleavers, in IEEE International Symposium on Information Theory (ISIT), Chicago, Illinois, USA, June 27–July 2 2004, p. 54
A. Nimbalker et al., Contention-free interleavers for high-throughput turbo decoding. IEEE Trans. Commun. 56(8), 1258–1267 (2008)
O.Y. Takeshita, Maximum contention-free interleavers and permutation polynomials over integers rings. IEEE Trans. Inf. Theory 52(3), 1249–1253 (2006)
A. Tarable, S. Benedetto, Mapping interleaving laws to parallel turbo decoder architectures. IEEE Commun. Lett. 8(3), 162–164 (2004)
A. Tarable, S. Benedetto, Further results on mapping functions, in IEEE ITSOC Information Theory Workshop Coding Complex (ITW), Rotorua, New Zealand, August 28–September 1 2005, pp. 221–225
A. Tarable, S. Benedetto, G. Montorsi, Mapping interleaving laws to parallel turbo and LDPC decoder architectures. IEEE Trans. Inf. Theory 50(9), 2002–2009 (2004)
L. Trifina, V. Munteanu, Coduri Turbo (Politehnium, Iasi, 2008)
L. Trifina, D. Tarniceriu, Improved method for searching interleavers from a certain set using Garello’s method with applications for the LTE standard. Ann. Telecommun. 69(5–6), 251–272 (2014)
L. Trifina, D. Tarniceriu, Parallel access by butterfly networks for any degree permutation polynomial and ARP interleavers. Submitted for possible publication (under review) (2017)
L. Trifina, J. Ryu, D. Tarniceriu, Up to five degree permutation polynomial interleavers for short length LTE turbo codes with optimum minimum distance, in IEEE International Symposium on Signals, Circuits and Systems (ISSCS), Iasi, Romania, 13–14 July 2017
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
Trifina, L., Tarniceriu, D. (2019). Parallel Turbo Decoding for Permutation Polynomial Interleavers. In: Permutation Polynomial Interleavers for Turbo Codes. Signals and Communication Technology. Springer, Singapore. https://doi.org/10.1007/978-981-13-2625-7_6
Download citation
DOI: https://doi.org/10.1007/978-981-13-2625-7_6
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-2624-0
Online ISBN: 978-981-13-2625-7
eBook Packages: EngineeringEngineering (R0)