A method of decoding using a log posterior probability ratio L(uk), which is a function of forward variable α (.) and backward variable β (.). The method comprises dividing the forward variable α (.) and the backward variable β (.) into, for example, two segments p and q, wher
A method of decoding using a log posterior probability ratio L(uk), which is a function of forward variable α (.) and backward variable β (.). The method comprises dividing the forward variable α (.) and the backward variable β (.) into, for example, two segments p and q, where p plus q equal the length of the code word U. The forward segments α (.) are parallel calculated, and the backward segments β (.) are parallel calculated. The ratio L(uk) is calculated using the parallel calculated segments of α (.) and β (.).
대표청구항▼
What is claimed is: 1. A method of a turbo decoder using log A Posteriori Probability L(uk), where L(uk)=f(αk(.), βk(.)), the method comprising: dividing a forward variable α (.) and a backward variable β (.) into a plurality M of parallel segments of size p, q . . . w, where
What is claimed is: 1. A method of a turbo decoder using log A Posteriori Probability L(uk), where L(uk)=f(αk(.), βk(.)), the method comprising: dividing a forward variable α (.) and a backward variable β (.) into a plurality M of parallel segments of size p, q . . . w, where p+q, . . . +w equals the length of a coded word U; simultaneous, parallel calculating the segments of forward variable α (.) of the code word U as follows: and the segments of the backward variable β (.) of the code word U as follows: and calculating L(uk) using the parallel calculated segments of α (.) and β (.). 2. The method according to claim 1, wherein the segment sizes are set equal. 3. A signal receiver including a decoder performing the method according to claim 1. 4. The method according to claim 1, wherein the starting points αp(.), . . . , αw(.) are estimated, and the starting points βw+1(.), . . . , βq+1 are estimated. 5. The method according to claim 4, wherein the starting points for the forward variable are estimated from: and for the backward segments from: where d is an arbitrary amount of time steps. 6. The method according to claim 5, wherein d is in the range of 1 to 20. 7. The method according to claim 5, wherein d is in the range of 15 to 20. 8. The method according to claim 5, wherein the probabilities of the first states for estimating the starting points are uniform random variables. 9. The method according to claim 5, wherein the first states for estimating the starting points are a predetermined state. 10. The method according to claim 5, wherein the first states for estimating the starting point is one divided by the number of possible states. 11. A method of decoding using a log A Posteriori Probability ratio L(uk) where L(uk)=f(αk(.), β k(.) ), the method comprising: dividing a forward variable α (.) and a backward variable β (.) into two segments p and q where p+q equals the length of the code word U; parallel calculating the forward segments: α1(.), . . . ,αp(.) starting from a known α0(.) and αp+1(.), . . . ,αk(.) starting from an estimated αp(.); parallel calculating the backward segments: βK-1(.), . . . , βq+1(.) starting from a known βK(.) and βq(.), . . . , β1(.) starting from an estimated βq+1(.); and calculating L(uk) using the parallel calculated segments of α (.) and β (.). wherein the forward and backward segments are calculated simultaneously. 12. A signal receiver including a decoder performing the method according to claim 11. 13. A method according to claim 11, wherein the estimated starting point αp(.) is estimated from state probabilities αp-d+1(.), . . . , αp(.), and the estimated starting point βq+1(.) is estimated from state probabilities for βq+d(.), . . . , βq+1(.). 14. A method according to claim 13, wherein d is in the range of 1 to 20. 15. A method according to claim 13, wherein d is in the range of 15 to 20. 16. A method according to claim 13, wherein the probabilities of the first states for estimating the starting points are uniform random variables. 17. A method according to claim 13, wherein the first states for estimating the starting points are a predetermined state. 18. A method according to claim 13, wherein the first states for estimating the starting point is one divided by the number of possible states.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (14)
Joachim Hagenauer DE; Rupert Herzog DE; Andreas Schmidbauer DE, Decoding method and decoding device for a CDMA transmission system for demodulating a received signal available in serial code concatenation.
Hladik, Stephen Michael; Itani, Abdallah Mahmoud; Van Stralen, Nick Andrew; Wodnicki, Robert Gideon; Ross, John Anderson Fergus, Turbo decoder with modified input for increased code word length and data rate.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.