New deterministic interleaver designs for turbo codes
From MaRDI portal
Publication:4545802
DOI10.1109/18.868474zbMATH Open1004.94038OpenAlexW2143503202MaRDI QIDQ4545802FDOQ4545802
Authors: Oscar Yassuo Takeshita, Daniel J. jun. Costello 
Publication date: 2 February 2003
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/d1d6fb36c2ec0f2cb55843224918b5ff28ee11c1
Recommendations
Cited In (18)
- On quadratic inverses for quadratic permutation polynomials over integer rings
- On maximum contention-free interleavers and permutation polynomials over integer rings
- Title not available (Why is that?)
- Some results concerning the design and decoding of turbo-codes
- Blind detection of interleaver parameters
- Bolt interleavers for turbo codes
- Permutation Polynomial Interleavers: An Algebraic-Geometric Perspective
- Stream-oriented turbo codes
- Interleavers for turbo codes using permutation polynomials over integer rings
- On quasi-cyclic interleavers for parallel turbo codes
- Interleaver Pruning for Construction of Variable-Length Turbo Codes
- Interleaver properties and their applications to the trellis complexity analysis of turbo codes
- Variance of the turbo code performance bound over the interleavers
- Design of interleavers for turbo codes: iterative interleaver growth algorithms of polynomial complexity
- Turbo-encoder design for symbol-interleaved parallel concatenated trellis-coded modulation
- Design of two step deterministic interleaver for turbo codes
- Title not available (Why is that?)
- The super-trellis structure of turbo codes
This page was built for publication: New deterministic interleaver designs for turbo codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4545802)
