Convolution Turbo code interleaver and convolution de-interleaver

A deinterleaver and interleaver technology, applied in the field of interleaver design of convolutional turbo codes, can solve problems such as difficulty in finding symmetrical interleaving and deinterleaving structures, and achieve the effect of reducing memory requirements and facilitating parallel processing

Active Publication Date: 2009-11-18
芯鑫融资租赁(厦门)有限责任公司
View PDF0 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Takeshita's quadratic group interleaver is mainly used for classical Turbo codes, which can only be used for the i

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Convolution Turbo code interleaver and convolution de-interleaver
  • Convolution Turbo code interleaver and convolution de-interleaver
  • Convolution Turbo code interleaver and convolution de-interleaver

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0024] A kind of interleaver used for convolutional Turbo code that the present invention proposes is the quadratic group algebraic interleaver of improved Takeshita in convolutional Turbo code, and it can realize the parallel decoding process of convolutional Turbo code, Therefore, the application limitation of the quadratic group algebraic interleaver is broken through, and a symmetrical interleaver and deinterleaver structure is unexpectedly obtained.

[0025] From Takeshita's work, we know the following lemma theorems about quadratic polynomials.

[0026] We call a quadratic polynomial an interleaved quadratic polynomial if and only if the polynomial satisfies: Given an integer N, the quadratic polynomial f(x)=f 1 x+f 2 x 2 (mod N), when the elements of x are {0, 1, 2...N-1}, the result of f(x) is still the set {0, 1, 2...N-1}, and every elements appear only once.

[0027] Suppose the set of prime numbers P={2, 3, 5, 7,...}, then any integer N can be decomposed into ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention provides a convolution Turbo code interleaver and a convolution de-interleaver, wherein the interleaver comprises an exchanger, a first sub interleaver and a second sub interleaver. The exchanger is used for exchanging a first data stream input length of N and a second data stream with input length of N every one data. The first sub interleaver interleaves the exchanged first data stream, wherein the first sub interleaver meets the interleaving quadratic polynomial f(x) being equal to f1x+f2x(mod N). The second sub interleaver interleaves the exchanged data streamer, wherein the second sub interleaver meets the interleaving g(x) being equal to g1x+g2x(mod N), and the f(x) and the g(x) are reversible. In addition, the convolution de-interleaver can fully multiplex the interleaver. The interleaver can realize parallel processing under better bit error code performance, and the convolution de-interleaver is symmetrical to the interleaver.

Description

technical field [0001] The invention relates to the field of mobile communication, in particular to the design of an interleaver of a convolutional turbo code (Convolutional turbo code, CTC). Background technique [0002] The Shannon coding theorem points out that if a sufficiently long random code is used, the Shannon channel capacity can be approximated. However, traditional codes have a regular algebraic structure, which is far from being "random". At the same time, due to the complexity of decoding, the code length cannot be too long. Therefore, there is a large gap between traditional channel coding performance and channel capacity. In fact, for a long time, the channel capacity has only existed as a theoretical limit, and the actual coding scheme design and evaluation are not based on the Shannon limit. Since the birth of information theory more than 50 years ago, people have been trying to find a coding method that is closer to the Shannon limit and has a smaller er...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): H04L1/00H04B1/707H03M13/29H03M13/27
Inventor 魏华吕玲
Owner 芯鑫融资租赁(厦门)有限责任公司
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap