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

Velocity matching method for limited longness circulation caching of Turbo code

A circular buffering and rate matching technology, applied in the field of communication, can solve the problems of multiple overlapping, degraded retransmission performance, uneven distribution of HARQ starting points, etc., to achieve the effect of reducing size and improving retransmission performance

Active Publication Date: 2012-07-04
ZTE CORP
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0009] In the existing rate matching method of finite-length circular buffer, the HARQ starting points corresponding to each redundant version are unevenly distributed in the circular buffer, which may cause some codewords to overlap multiple times during the HARQ packet retransmission process. The other part of the codewords does not overlap, which will lead to a decrease in retransmission performance

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
  • Velocity matching method for limited longness circulation caching of Turbo code
  • Velocity matching method for limited longness circulation caching of Turbo code
  • Velocity matching method for limited longness circulation caching of Turbo code

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0033] The rate matching method (for one-dimensional limited-length circular buffer) of the limited-length circular buffer of Turbo code according to an embodiment of the present invention, comprises the following steps:

[0034] Step A1, performing Turbo encoding on the bit data of the input information block;

[0035] Step A2, determining the size of the limited-length circular cache;

[0036] Step A3: The starting position k of the HARQ data packet specified by each redundancy version value 0 Uniformly or approximately uniformly distributed over length N cb In the finite-length circular buffer of ;

[0037] Step A4, according to the number of HARQ retransmissions, select the value of the redundant version, start from the starting position corresponding to the value of the redundant version, read the bit data of length L sequentially from left to right, and form the current HARQ data packet;

[0038] Step A5, sending the current HARQ data packet to the subsequent process...

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 rate matching method for finite length loop buffer of a turbo code, comprising the steps: turbo coding is carried out to data bits of an input data block, upon which the size of a one-dimensional finite length loop buffer is decided; the initial positions of hybrid automatic repeat request data packets appointed by a plurality of predefined redundancy version values are evenly or approximately distributed in the one-dimensional finite length loop buffer; a redundancy version value is selected from the predefined redundancy version values in line with times of the hybrid automatic repeat requests; then data bits with specific length are read in turn from the initial position of hybrid automatic repeat request data packets appointed by the selected redundancy version values, thus a hybrid automatic repeat request data packet is formed and then sent out. The invention has the advantages of reduced size of circular buffer and improved repeat performance of hybridautomatic repeat request data packet.

Description

technical field [0001] The present invention relates to the communication field, and more specifically relates to a rate matching method of a limited-length circular buffer of a Turbo code. Background technique [0002] In a wireless communication system, the channel coding link is the underlying technology of the physical layer, which determines the underlying transmission performance and transmission reliability of the wireless communication system. In the latest 3GPP LTE standard research, the channel coding link adopts a series of latest technologies, which improves the transmission performance of the physical layer while simplifying the implementation complexity. Among them, in the latest 3GPP standard protocol, ① Turbo code based on Quadratic Polynomial Permutation (QPP) interleaver is adopted as the channel coding scheme for data services; ② rate matching based on Circular Buffer is adopted The method is used to realize the matching between the length of the transmit...

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/29
Inventor 许进袁志锋李松徐俊胡留军
Owner ZTE CORP
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