Computing method and device of turbo code interleaver

A computing method and technology of a computing device are applied in the directions of coding, code conversion, coding components, etc., which can solve the problems of turbo code encoder time extension, multiple memory resources, and computational complexity, and achieve reduced complexity, reduced memory area, and reduced computational complexity. Modulo arithmetic simple effects

Active Publication Date: 2013-04-03
SANECHIPS TECH CO LTD
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0010] When the existing technology directly uses the formula (1) to calculate the output index ∏(i), it involves too many modulo operations, which makes the calculation complicated, thus consuming too much memory resources, and causing the encoding process of the turbo coder or turbo code The delay in the actual implementation of the decoding process of the decoder is very long

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
  • Computing method and device of turbo code interleaver
  • Computing method and device of turbo code interleaver
  • Computing method and device of turbo code interleaver

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0036] Before describing the calculation method of the turbo code inner interleaver of the present invention in detail, the principle of the calculation method is first introduced.

[0037] First, the length of the input turbo code inner interleaver is K j The bit sequence or soft bit sequence is divided into several identical segments, each segment is called a window. Suppose the window length of each window is Δ j , for an element a in window n, its input index is i, and the output index after interleaving by formula (1) is ∏(i); in window n+1, the distance from element a is Δ j The input index of element b is i+Δ j , the output index after interleaving by formula (1) is ∏(i+Δ j )=[f 1 (i+Δ j )+f 2 (i+Δ j ) 2 ](mod K j ).

[0038] Then, the following equation can be obtained:

[0039] ∏(i+Δ j )-∏(i)

[0040] =[f 1 ·(i+Δ j )+f 2 ·(i+Δ j ) 2 -f 1 ·i-f 2 ·i 2 ](mod K j )

[0041] =[f 1 ·Δ j +f 2 ·Δ j 2 +2f 2 Δ j i](mod K j )

[0042] As can be se...

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

A calculation method of a turbo code internal interleaver is disclosed by the present invention, and comprises: dividing a sequence with a length of K j , which is input into a turbo code internal interleaver, into a plurality of windows each with a window length of ” j , the window length ” j satisfying 2 f 2 ” j (mod K j ) = 0, and K j being divided exactly by ” j , wherein f 2 is a parameter dependent on K j ; obtaining output indices each of which corresponds to each input index in a first window; calculating successively output indices each of which corresponds to each input index in a rest window according to the output indices each of which corresponds to each input index in the first window. A calculation device of a turbo code internal interleaver is also disclosed by the present invention. With the present invention, the computational complexity of the turbo code internal interleaver can be reduced, so as to reduce the time delay of a specific calculation and save memory resources.

Description

technical field [0001] The present invention relates to Long Term Evolution (LTE) in the 3rd Generation Partnership Project (3GPP), and in particular, to a method and device for calculating a turbo intra-code interleaver in LTE. Background technique [0002] The inner interleaver in a turbo encoder or turbo decoder uses equation (1) to calculate the output index from the input index: [0003] ∏(i)=(f 1 ·i+f 2 ·i 2 )mod K (1) [0004] Among them, i is the input index, and the value of i is 0, 1, 2, ..., K-1; [0005] ∏(i) is the output index; [0006] f 1 and f 2 is a parameter that depends on K; [0007] K is the length of the input sequence. [0008] Wherein, when formula (1) is used in a turbo code encoder, the sequence is a bit sequence; when used in a turbo code decoder, the sequence is a soft bit sequence, which refers to a non-binary sequence. [0009] In addition, f 1 , f 2 The specific value of and K can be from 3GPP TS 36.212 Evolved Universal Terrestria...

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
Patent Type & Authority Patents(China)
IPC IPC(8): H03M13/27H03M13/23
CPCH03M13/6525H03M13/2775H03M13/2771H03M13/2739H03M13/27
Inventor 萧少宁
Owner SANECHIPS TECH CO LTD
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