Unlock instant, AI-driven research and patent intelligence for your innovation.
MAP algorithm based Turbo decoding method and device
What is Al technical title?
Al technical title is built by PatSnap Al team. It summarizes the technical point description of the patent document.
An algorithm and decoding technology, applied in the field of Turbo decoding method and device based on MAP algorithm, can solve the problems of complex implementation, small effective decoding time ratio, performance degradation, etc., and achieve simple implementation structure and improve effective decoding time. Effect
Inactive Publication Date: 2016-02-03
SANECHIPS TECH CO LTD
View PDF3 Cites 0 Cited by
Summary
Abstract
Description
Claims
Application Information
AI Technical Summary
This helps you quickly interpret patents by identifying the three key elements:
Problems solved by technology
Method used
Benefits of technology
Problems solved by technology
Limited by the length of the overlap, this method is complicated to implement and seriously degraded in performance at high code rates, and the effective decoding time of each sub-block accounts for a relatively small proportion
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
Click on the blue label to locate the original text in one second.
Reading with bidirectional positioning of images and text.
Smart Image
Examples
Experimental program
Comparison scheme
Effect test
Embodiment 1
[0077] Figure 5 A sliding window pipeline calculation flow chart with inherited boundary value provided for Embodiment 1 of the present invention, as shown in Figure 5 As shown, the process includes:
[0078] In the first time window, the input data (information bit Ys, check bit Yp and prior information La) of a sliding window window length LEN is stored in the RAM array, and in the second time window, Ys is read from the RAM array , Yp and La, calculate β1, and store it in RAM. Among them, β1 represents the β value of the entire window of the first sliding window; in the third time window, read Ys, Yp and La from the RAM array, calculate α1 and β2, and store them in the RAM array...and so on, until this The α and β of the last sliding window of a sub-block are all calculated.
[0079] Wherein, the input data (information bit Ys, parity bit Yp and prior information La) RAM array includes two RAMs whose size is the window length LEN, RAM(0) and RAM(1).
[0080] Input dat...
Embodiment 2
[0083] Figure 7 A structural diagram of a Turbo code MAP calculation unit with inherited boundary conditions provided for Embodiment 2 of the present invention, based on Figure 7 As shown in the structure, in this embodiment, the preset block and window boundaries are used as the initial state to complete the first double iteration. For subblock 1, the initial value of α is constant:
[0084] [0,INF,INF,INF,INF,INF,INF,INF]; for sub-block n, the initial value of β is also constant:
[0085] [0,INF,INF,INF,INF,INF,INF,INF]. The initial value of each window boundary for the first iteration, the default eight states α of α and β 0 ~α 7 and beta 0 ~β 7 Equal probability, specifically,
[0087] In the ith iteration (i>1), the window boundary value of β is read from the RAM array storing β, and the block boundaries of α and β are obtained by reading the corresponding registers.
[0088] Among them, ...
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
Login to View More
Abstract
The embodiment of the invention discloses an MAP algorithm based Turbo decoding method. The MAP algorithm based Turbo decoding method comprises the steps of performing iterative estimation for an information symbol by using an MAP algorithm, wherein alpha and beta window boundary values of each sliding window are obtained by adopting a window boundary value inheriting mode, alpha and beta block boundary values of each sub-block are obtained by adopting a block boundary value inheriting mode, and LLR values of a whole window and a whole block are deduced based on the alpha boundary values and the beta boundary values; and performing decoding judgment based on the LLR values. The MAP algorithm based Turbo decoding device comprises a first processing module used for performing iterative estimation for the information symbol by using the MAP algorithm, wherein the alpha boundary value and the beta boundary value of each sliding window are obtained by adopting the window boundary value inheriting mode, the alpha boundary value and the beta boundary value of each block are obtained by adopting the block boundary value inheriting mode, and the LLR values of the whole window and the whole block are deduced based on the alpha boundary values and the beta boundary values; and a second processing module used for performing decoding judgment based on the LLR values.
Description
technical field [0001] The invention relates to the field of communication technology, in particular to a turbo decoding method and device based on a MAP algorithm. Background technique [0002] At the International Communication Conference held in Geneva, Switzerland in 1993, C.Berrou, A.Glavieux and P.Thitimajshiwa of the British University of Communications in France first proposed a coding and decoding scheme called Turbo code. It is composed of two recursive circular convolutional codes (RSC) combined in parallel concatenation through an interleaver. This scheme uses feedback iterative decoding to truly explore the potential of concatenated codes, and is similar to random The encoding and decoding method broke through the short code design idea of the minimum distance, making it closer to the performance of the ideal random code. Some existing communication systems, such as 3GPP LTE / LTE-A, WCDMA, TD-SCDMA and other systems, all adopt Turbo code as channel coding. ...
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
Application Date:The date an application was filed.
Publication Date:The date a patent or application was officially published.
First Publication Date:The earliest publication date of a patent with the same application number.
Issue Date:Publication date of the patent grant document.
PCT Entry Date:The Entry date of PCT National Phase.
Estimated Expiry Date:The statutory expiry date of a patent right according to the Patent Law, and it is the longest term of protection that the patent right can achieve without the termination of the patent right due to other reasons(Term extension factor has been taken into account ).
Invalid Date:Actual expiry date is based on effective date or publication date of legal transaction data of invalid patent.
Login to View More 
Login to View More