Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

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: 2010-12-29
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 in detail the calculation method of the interleaver in the turbo code of the present invention, the principle of the calculation method is firstly introduced.

[0037] First, the length of the interleaver in the input turbo code is K j The bit sequence or soft bit sequence is divided into the same number of segments, and 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 interleaved by formula (1) is ∏(i); in window n+1, the distance from element a is Δ j The input index of the element b of is i+Δ j , the output index interleaved 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] From the abo...

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 discloses a computing method of a turbo code interleaver, which comprises: dividing a sequence which has a length Kj and is input into the turbo code interleaver into a plurality of windows of which the window length is deltaj, wherein the window length deltaj meets a condition that 2f2deltaj(mod Kj) is equal to 0 and a condition that the Kj can be divided by the deltaj exactly, andf2 is a parameter determined by the Kj; acquiring output indexes corresponding to input indexes in a first window; and computing the output indexes corresponding to the input indexes in the rest windows in turn according to the output indexes corresponding to the input indexes in the first window. The invention also discloses a computing device of the turbo code interleaver. When the method and the device of the invention are used, the computing complexity of the turbo code interleaver can be lowered, and thus, concrete computing time delay can be reduced and memory resources can be saved.

Description

technical field [0001] The present invention relates to the long-term evolution (LTE) in the third generation partnership project (3GPP), in particular to a calculation method and device for a turbo interleaver in the LTE. Background technique [0002] The inner interleaver in a turbo encoder or a turbo decoder uses formula (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 the formula (1) is used for a turbo code encoder, the sequence is a bit sequence; when used for a turbo code decoder, the sequence is a soft bit sequence, and the soft bit sequence refers to a sequence in a non-binary form. [0009] In addition, f 1 , f 2 The specific values ​​of K and K can be obtained fro...

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 Applications(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 Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com