Determining the Number of Permutation Polynomial-Based Interleavers in Terms of Their Length

Trifina, Lucian; Tarniceriu, Daniela

doi:10.1007/978-981-13-2625-7_4

Lucian Trifina³ &
Daniela Tarniceriu³

Part of the book series: Signals and Communication Technology ((SCT))

294 Accesses

Abstract

In this chapter we give and prove formulas for determining the number of true different PP interleavers of a certain degree according to their length. To determine when two PPs with different coefficients lead to the same permutation, the equivalence conditions between PPs are required and they are presented in Sect. 4.2. The method used to determine the number of true different PPs is based on the Chinese Remainder Theorem and it is presented in Sect. 4.3. Formulas for determining the number of all true different QPPs and CPPs are obtained in Sects. 4.4 and 4.5, respectively. Formulas for determining the number of true different CPPs, 4-PPs and 5-PPs, under Zhao and Fan sufficient conditions (Zhao and Fan 2007), are obtained in Sects. 4.6.1–4.6.3, respectively. In Sect. 4.7, the algorithm from Weng and Dong (2008) is used to obtain the number of all true different PPs of degrees up to five. Determining the lengths of PP-based interleavers for which the number of all true different PPs of degree up to five is equal to 0 are obtained in Sect. 4.8. Finally, determining the lengths of PP-based interleavers for which the number of true different PPs of any degree under Zhao and Fan sufficient conditions is equal to 0 are obtained in Sect. 4.9.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Chapter: USD 29.95; Price excludes VAT (USA)

eBook: USD 129.00; Price excludes VAT (USA)

Softcover Book: USD 169.99; Price excludes VAT (USA)

Hardcover Book: USD 169.99; Price excludes VAT (USA)

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

2015, http://telecom.etti.tuiasi.ro/tti/papers/Text_files/Number_of_true_diff_LPPs_QPPs_CPPs_N_000002_100000.txt
2016, http://telecom.etti.tuiasi.ro/tti/papers/Text_files/Number_of_true_diff_LPPs_QPPs_CPPs_4PPs_5PPs_N_000002_100000.txt
3GPP TS 36.212 V8.3.0, 3rd generation partnership project, Multiplexing and channel coding (Release 8) (2008), http://www.etsi.org
L.E. Dickson, The analytic representation of substitutions on a power of a prime number of letters with a discussion of the liner group. Ann. Math. 11(1–6), 65–120 (1896)
Article MathSciNet Google Scholar
G.H. Hardy, E.M. Wright, An Introduction to the Theory of Numbers, 4th edn. (Oxford University Press, Oxford, 1975)
Google Scholar
S. Li, Null polynomials modulo m (2005), arXiv:math/0510217v2
J. Ryu, Permutation polynomial based interleavers for turbo codes over integer rings. Ph.D. thesis. Ohio State University (2007), https://etd.ohiolink.edu/rws_etd/document/get/osu1181139404/inline
J. Ryu, O.Y. Takeshita, On inverses for quadratic permutation polynomials over integers rings (2011), arXiv:1102.2223
D. Tarniceriu, L. Trifina, V. Munteanu, About minimum distance for QPP interleavers. Ann. Telecommun. 64(11–12), 745–751 (2009)
Article Google Scholar
L. Trifina, D. Tarniceriu, Analysis of cubic permutation polynomials for turbo codes. Wirel. Pers. Commun. 69(1), 1–22 (2013)
Article Google Scholar
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)
Article Google Scholar
L. Trifina, D. Tarniceriu, When the number of true different permutation polynomials is equal to 0? Submitted for possible publication (under review) (2018a)
Google Scholar
L. Trifina, D. Tarniceriu, Determining the number of true different permutation polynomials of degrees up to five by Weng and Dong algorithm. Telecommun. Syst. 67(2), 211–215 (2018b)
Article Google Scholar
L. Trifina, D. Tarniceriu, V. Munteanu, Improved QPP interleavers for LTE standard, in IEEE International Symposium on Signals, Circuits and Systems (ISSCS), Iasi, Romania, June 30–July 1 2011, pp. 403–406
Google Scholar
G. Weng, C. Dong, A note on permutation polynomial over Zn. IEEE Trans. Inf. Theory 54(9), 4388–4390 (2008)
Article Google Scholar
H. Zhao, P. Fan, Simple method for generating \(m\)th-order permutation polynomials over integer rings. Electron. Lett. 43(8), 449–451 (2007)
Article Google Scholar
H. Zhao, P. Fan, V. Tarokh, On the equivalence of interleavers for turbo codes using quadratic permutation polynomials over integer rings. IEEE Commun. Lett. 14(3), 236–238 (2010)
Article Google Scholar

Download references

Author information

Authors and Affiliations

Faculty of Electronics, Telecommunications and Information Technology, Gheorghe Asachi Technical University, Iași, Romania
Lucian Trifina & Daniela Tarniceriu

Authors

Lucian Trifina
View author publications
You can also search for this author in PubMed Google Scholar
Daniela Tarniceriu
View author publications
You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lucian Trifina .

Rights and permissions

Reprints and permissions

Copyright information

About this chapter

Cite this chapter

Trifina, L., Tarniceriu, D. (2019). Determining the Number of Permutation Polynomial-Based Interleavers in Terms of Their Length. In: Permutation Polynomial Interleavers for Turbo Codes. Signals and Communication Technology. Springer, Singapore. https://doi.org/10.1007/978-981-13-2625-7_4

Download citation

DOI: https://doi.org/10.1007/978-981-13-2625-7_4
Published: 02 October 2018
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-2624-0
Online ISBN: 978-981-13-2625-7
eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics