Turbo decoding method and turbo decoding apparatus
원문보기
IPC분류정보
국가/구분
United States(US) Patent
등록
국제특허분류(IPC7판)
H03M-013/03
H03M-013/00
출원번호
UP-0443571
(2003-05-22)
등록번호
US-7530011
(2009-07-01)
우선권정보
JP-2002-164040(2002-06-05)
발명자
/ 주소
Obuchii, Kazuhisa
Yano, Tetsuya
출원인 / 주소
Fujitsu Limited
대리인 / 주소
Katten Muchin Rosenman LLP
인용정보
피인용 횟수 :
10인용 특허 :
9
초록▼
Disclosed are a turbo decoding apparatus and method for decoding a turbo-encoded signal by repeating element decoding. The apparatus includes a plurality of element decoders for applying element decoding, e.g., MAP decoding, in parallel to respective ones of a plurality of divided signals to be deco
Disclosed are a turbo decoding apparatus and method for decoding a turbo-encoded signal by repeating element decoding. The apparatus includes a plurality of element decoders for applying element decoding, e.g., MAP decoding, in parallel to respective ones of a plurality of divided signals to be decoded, and an interleaver/deinterleaver for interleaving or deinterleaving a plurality of results of element decoding collectively. Each element decoder applies element decoding to a respective one of the divided signals, and the interleaver/deinterleaver alternately interleaves and deinterleaves a plurality of results of element decoding collectively. Turbo decoding is carried out by repeating these operations a prescribed number of times.
대표청구항▼
What is claimed is: 1. A turbo decoding method for decoding an N-bit turbo-encoded signal by repeating element decoding including steps of performing a backward probability calculation which is a repetitive calculation from back to front, performing a forward probability calculation which is a repe
What is claimed is: 1. A turbo decoding method for decoding an N-bit turbo-encoded signal by repeating element decoding including steps of performing a backward probability calculation which is a repetitive calculation from back to front, performing a forward probability calculation which is a repetitive calculation from front to back and performing a joint probability calculation, an a posteriori probability calculation, and an external-information likelihood calculation using N-number of results of the backward probability calculation and N-number of results of the forward probability calculation, comprising the steps of: providing M-number of element decoders in parallel; dividing, into M-number of divided signals, the N-bit signal to be decoded; applying element decoding to i-th divided signal (i=1, 2, . . . , M) in respective one of the element decoders in parallel; alternately interleaving and deinterleaving the M-number of results of element decoding collectively; and performing turbo decoding by repeating the above operation a prescribed number of times, wherein the step of applying element decoding includes the steps of: performing the backward probability calculation backwards by an excess amount B as an amount of overlap in overlapping windows using (i+1)-th divided signal neighboring to the i-th divided signal, and then performing the backward probability calculation using the i-th divided signal and storing backward probabilities of this backward probability calculation in a memory; performing the forward probability calculation forwards by the excess amount B using (i-1)-th divided signal neighboring to the i-th divided signal, and performing the forward probability calculation using the i-th divided signal; and executing element decoding processing using the forward probabilities calculated after the excess forward probability calculation and the backward probabilities calculated after the excess backward probability calculation which are stored in said memory; the method further comprising the steps of: when the N-bit signal to be decoded is divided into M-number of divided signals, making division size toward the end greater than other division sizes; and performing the backward probability calculation and the forward probability calculation with overlap of the amount B with regard to the other division sizes, and performing the backward probability calculation and the forward probability calculation continuously without overlap with regard to the division size toward the end. 2. A turbo decoding method for decoding an N-bit turbo-encoded signal by repeating element decoding including steps of performing a backward probability calculation which is a repetitive calculation from back to front, performing a forward probability calculation which is a repetitive calculation from front to back and performing a joint probability calculation, an a posteriori probability calculation, and an external-information likelihood calculation using N-number of results of the backward probability calculation and N-number of results of the forward probability calculation, comprising the steps of: providing M-number of element decoders in parallel; dividing the N-bit signal to be decoded into M-number of divided signals; in one element decoder before element decoding processing is applied to each item of divided data in each element decoder: performing the backward probability calculation backwards from beginning to end, storing backward probabilities in memory discretely every L-number of backward probabilities where L is a predetermined value, performing the forward probability calculation forwards from beginning to end and storing forward probabilities in memory discretely every N/M-number of forward probabilities; in each element decoder in parallel: reading a discrete backward probability corresponding to an initial L-number of bits in N/M-bit divided data, which is to undergo element decoding, out of the memory, performing the backward probability calculation using the discrete backward probability and obtaining and storing L-number of results of backward probability calculation continuously; and then performing the forward probability calculation with regard to N/M-bit divided data to undergo element decoding using a discrete forward probability stored in the memory corresponding to this N/M-bit divided data, performing the joint probability calculation, the a posteriori probability calculation and the external-information likelihood calculation using L-number of results of the forward probability calculation and the L-number of results of the backward probability calculation that have been stored continuously, simultaneously reading out next discrete backward probability that has been stored discretely every L-number of backward probabilities, performing the backward probability calculation using the next discrete backward probability, storing L-number of results of the backward probability calculation continuously, and subsequently applying element decoding to N/M-bit divided data by repeating these operations; alternately interleaving and deinterleaving a plurality of results of element decoding collectively; and performing turbo decoding by repeating the above operation a prescribed number of times.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (9)
Hladik Stephen Michael ; Van Stralen Nick Andrew ; Fergus Ross John Anderson, High data rate maximum a posteriori decoder for segmented trellis code words.
Hladik Stephen Michael ; Check William Alan ; Glinsman Brian James ; Fleming ; III Robert Fleming, Satellite communications system utilizing parallel concatenated coding.
Shen, Ba-Zhong; Lee, Tak K., General and algebraic-constructed contention-free memory mapping for parallel turbo decoding with algebraic interleave ARP (almost regular permutation) of all possible sizes.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.