Method for decoding tail biting convolution codes of PBCH (physical broadcast channel) decoding in LTE (long term evolution)

A tail-biting convolutional code and decoding technology, which is applied in the field of mobile communication, can solve the problems of resource consumption and large amount of calculation, and achieve the effects of simplifying the method and structure, shortening the decoding time of PBCH, and saving the implementation complexity

Inactive Publication Date: 2013-01-30
MEDIATEK INC
View PDF4 Cites 11 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] The purpose of the present invention is to provide a tail-biting convolutional code decoding method for fast PBCH decoding of LTE to solve the problems of large amount of calculation and resource consumption in the prior art scheme

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
  • Method for decoding tail biting convolution codes of PBCH (physical broadcast channel) decoding in LTE (long term evolution)
  • Method for decoding tail biting convolution codes of PBCH (physical broadcast channel) decoding in LTE (long term evolution)
  • Method for decoding tail biting convolution codes of PBCH (physical broadcast channel) decoding in LTE (long term evolution)

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0022] refer to Figure 5 As shown, the PBCH demodulation and descrambling module stores the log likelihood ratio LLR in the LLR memory, which is denoted as LLR k (k=0, 1, . . . , K-1). Since PBCH can be decoded separately for each radio frame, in the case of normal CP, the value of K may be 480, 960, 1440 or 1920; in the case of extended CP, the value of K may be 432, 864, 1296 or 1728 .

[0023] The PBCH rate matching algorithm uses repetition operations to repeat 120 data before rate matching into 480, 960, 1440 or 1920 (432, 864, 1296 or 1728 in the case of Extended CP) data. Therefore, it is only necessary to record the address correspondence of 120 data sub-blocks before and after interleaving, and the location of a certain data after sub-block interleaving and rate matching before sub-block interleaving can be obtained. Table 1 shows the positions of the 120 bits encoded by the tail-biting convolutional code after sub-block interleaving. Among them, the first column...

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 method for decoding tail biting convolution codes of PBCH (physical broadcast channel) decoding in LTE (long term evolution). A tail biting convolution decoder starts computing path metric from the starting position of a CRC (cyclic redundancy check) field, and a start state for computation of the path metric is zero constantly, and the computation of the path metric is separated into two situations: when SFN (system frame number) in an MIB (master information block) is unknown, computation of the path metric is ended at the sixth bit of a Spare bit field, a starting state of tracing back is zero, thirty-six decoding results are generated by the tail biting convolution decoder, and a PBCH decoding result finally with forty bits is formed by adding four '0' at the tail end of the thirty-six decoding results; when the SFN in the MIB is given, computation of the path metric is ended at the sixth bit of an SFN bit field, a starting state of tracing back is determined by the first six bits in the SFN field, twenty-eight decoding results are generated by the tail biting convolution decoder, and the PBCH decoding result finally with forty bits is formed by adding the last two bits of the SFN and ten '0' at the tail end of the twenty-eight decoding results.

Description

technical field [0001] The invention belongs to the technical field of mobile communication, in particular to a tail-biting convolution code decoding method used for PBCH decoding in LTE. Background technique [0002] As the next-generation mainstream communication technology, LTE has the characteristics of high transmission rate, high spectrum utilization rate, and simple receiver. LTE is divided into two duplex modes, TDD and FDD. The frame structure of the two modes is as follows figure 1 shown. [0003] The PBCH of LTE carries the Master Information Block (MIB for short) in the LTE system information. The MIB includes the most important and commonly used transmission parameters of the current base station (nodeB), such as system bandwidth, PHICH configuration, and system frame number (SFN). The MIB has a total of 24 bits, of which 14 bits are used to represent system information, and the other 10 bits are spare bits, whose value is 0. figure 2 Indicates the PBCH co...

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): H04L1/00
Inventor SHAN MINGZHU XUANCHENG
Owner MEDIATEK INC
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