Method and apparatus for performing calculations for forward (alpha) and reverse (beta) metrics in a map decoder
원문보기
IPC분류정보
국가/구분
United States(US) Patent
등록
국제특허분류(IPC7판)
H03D-001/00
H04L-027/06
출원번호
US-0952309
(2001-09-12)
발명자
/ 주소
Tran,Hau Thien
Cameron,Kelly B.
Shen,Ba Zhong
Jones,Christopher R.
출원인 / 주소
Broadcom Corporation
대리인 / 주소
Christie, Parker &
인용정보
피인용 횟수 :
0인용 특허 :
33
초록▼
Method and apparatus for performing calculations for forward (alpha) and reverse (beta) metrics in a map decoder. The method includes using a min star (min*) operation to receive the metrics and a priori values as well as forming min star structures from individual min star operations. Two separate
Method and apparatus for performing calculations for forward (alpha) and reverse (beta) metrics in a map decoder. The method includes using a min star (min*) operation to receive the metrics and a priori values as well as forming min star structures from individual min star operations. Two separate outputs from the min star operation may be maintained separately throughout all calculations and combined only when a final value is required. In addition input to the min star operators that are available prior to a particular decoder iteration may be combined separately to allow an increase in speed within decoding iterations. The same principals apply to the more popular max star operation.
대표청구항▼
What is claimed is: 1. A method of calculating alpha (α) values in a map decoder, the method comprising: (a) selecting a state to calculate an α value for; (b) determining which previous states may result in a transition into the selected state; (c) determining a likelihood for each tran
What is claimed is: 1. A method of calculating alpha (α) values in a map decoder, the method comprising: (a) selecting a state to calculate an α value for; (b) determining which previous states may result in a transition into the selected state; (c) determining a likelihood for each transition from a previous state into the selected state; (d) determining the transition having the most likelihood using a min* (min star) operation by computing a log likelihood of transitions from a previous states into the selected state using a Min* structure; (e) assigning the α value of the selected state to be equal to the result of the min* operation; and (f) adding an offset to log computations in the Min* operation. 2. The method of claim 1 further comprising repeating steps (a) through (e) for all permissible trellis states. 3. The method of claim 1 further comprising repeating steps (a) through (e) simultaneously for all permissible trellis states. 4. A method as in claim 1, further comprising computing simultaneously log likelihoods for all transitions from previous states into the selected state by performing a min* to predict the likelihood of all possible transitions from a previous state into the selected state. 5. The method of claim 1, wherein using a Min* structure comprises using a parallel Min* structure. 6. The method of claim 1 wherein the offset is 0.5. 7. A method as in claim 1, further comprising adding an a priori probability and branch metrics prior to incorporation into Min* operation. 8. A method of calculating beta (β) values in a map decoder, the method comprising: (a) selecting a state to calculate an β value for; (b) determining which next states may result in a transition from the selected state; (c) determining a likelihood for each transition to a next state from the selected state; (d) determining the transition having the most likelihood using a min* (min star) operation by computing a log likelihood of transitions into next states from the selected state using a Min* structure; (e) assigning the β value of the selected state to be equal to the result of the min* operation; and (f) adding an offset to log computations in the Min* operation. 9. The method of claim 8 further comprising repeating steps (a) through (e) for all permissible trellis states. 10. The method of claim 8 further comprising repeating steps (a) through (e) simultaneously for all permissible trellis states. 11. A method as in claim 8, further comprising computing simultaneously log likelihoods for all transitions into next states from the selected state by performing a min* simultaneously of all possible transitions into a next state from the selected state. 12. The method of claim 8, wherein using a Min* structure comprises using a parallel Min* structure. 13. The method of claim 8 wherein the offset is 0.5. 14. A method as in claim 8, wherein an a priori probability and branch metrics are added together prior to incorporation into Min* operation. 15. A method as in claim 8 wherein beta values are maintained as separate Min_β and Ln_β values, wherein Min β is minimum of the operands comparing a first input (A) and a second input (B) to the decoder, A comprises an β metric, a priori values and a transition metric for a first previous state of the decoder and B comprises an β metric, a priori values and a transition metric for a second previous state of the decoder, and ln β=-log(1+e-|A-B|). 16. A method as in claim 8 wherein log likelihoods are maintained as separate Min_β and Ln_β values and are added to be used in the calculation of extrinsic probability values, wherein Min β is minimum of the operands comparing a first input (A) and a second input (B) to the decoder, A comprises an β metric, a priori values and a transition metric for a first previous state of the decoder and B comprises an β metric, a priori values and a transition metric for a second previous state of the decoder, and ln β=-log(1+e-|A-B|). 17. A method of calculating alpha (α) values in a map decoder, the method comprising: (a) selecting a state to calculate an α value for; (b) determining which previous states may result in a transition into the selected state; (c) determining a likelihood for each transition from a previous state into the selected state; (d) determining the transition having the most likelihood using a max* (max star) operation by computing a log likelihood of transitions from a previous states into the selected state using a Max* structure; (e) assigning the α value of the selected state to be equal to the result of the max* operation; and (f) adding an offset to log computations in the Max* operation. 18. The method of claim 17 further comprising repeating steps (a) through (e) for all permissible trellis states. 19. The method of claim 17 further comprising repeating steps (a) through (e) simultaneously for all permissible trellis states. 20. A method as in claim 17, further comprising computing simultaneously log likelihoods for all transitions from previous states into the selected state by performing a max* to predict the likelihood of all possible transitions from a previous state into the selected state. 21. The method of claim 17, wherein using a Max* structure comprises using a parallel Max* structure. 22. The method of claim 17 wherein the offset is 0.5. 23. A method as in claim 17, wherein an a priori probability and branch metrics are added together prior to incorporation into Max* operation. 24. A method of calculating beta (β) values in a map decoder, the method comprising: (a) selecting a state to calculate an β value for; (b) determining which next states may result in a transition from the selected state; (c) determining a likelihood for each transition to a next state from the selected state; (d) determining the transition having the most likelihood using a max* (max star) operation by computing a log likelihood of transitions into next states from the selected state using a Max* structure; (e) assigning the β value of the selected state to be equal to the result of the max* operation; and (f) adding an offset to log computations in the max* operation. 25. The method of claim 24 further comprising repeating steps (a) through (e) for all permissible trellis states. 26. The method of claim 24 further comprising repeating steps (a) through (e) simultaneously for all permissible trellis states. 27. A method as in claim 24, further comprising computing simultaneously log likelihoods for all transitions into next states from the selected state by performing a max* simultaneously of all possible transitions into a next state from the selected state. 28. The method of claim 24, wherein using a Max* structure comprises using a parallel Max* structure. 29. The method of claim 24 wherein the offset is 0.5. 30. A method as in claim 24, wherein an a priori probability and branch metrics are added together prior to incorporation into Max* operation. 31. A method as in claim 24 wherein beta values are maintained as separate Max β and Ln_β values, wherein Max β is maximum of the operands comparing a first input (A) and a second input (B) to the decoder, A comprises an β metric, a priori values and a transition metric for a first previous state of the decoder and B comprises an β metric, a priori values and a transition metric for a second previous state of the decoder, and ln β=-log(1+e-|A-B|). 32. A method as in claim 24 wherein log likelihoods are maintained as separate Max β and Ln13 β values and are added to be used in the calculations of extrinsic values, wherein Max β is maximum of the operands comparing a first input (A) and a second input (B) to the decoder, A comprises an β metric, a priori values and a transition metric for a first previous state of the decoder and B comprises an β metric, a priori values and a transition metric for a second previous state of the decoder, and ln β=-log(1+e-|A-B|).
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (33)
Yi Byung Kwan, Communications system handoff operation combining turbo coding and soft handoff techniques.
Berrou Claude (Le Conquet FRX), Error-correction coding method with at least two systematic convolutional codings in parallel, corresponding iterative d.
Marchetto Robert F. (Burnaby CAX) Stewart Todd A. (West Vancouver CAX) Fawcett Glenn S. (Vancouver CAX), High performance modem using pilot symbols for equalization and frame synchronization.
Van Stralen Nick Andrew ; Ross John Anderson Fergus ; Hladik Stephen Michael ; Itani Abdallah Mahmoud ; Wodnicki Robert Gideon, High-speed turbo decoder.
Hagenauer Joachim,DEX ; Burkert Frank,DEX, Method and arrangement for determining an adaptive abort criterion in iterative decoding of multi-dimensionally coded i.
Bonnot Christophe (Sevres FRX) Gerbault Bertrand (Paris FRX) Seguy Jean-Christophe (Fontenay aux Roses FRX), Method and system for interleaving and deinterleaving SDH frames.
Berrou Claude (le Conquet FRX) Adde Patrick (Brest FRX), Method for a maximum likelihood decoding of a convolutional code with decision weighting, and corresponding decoder.
Pyndiah Ramesh,FRX ; Adde Patrick,FRX, Process for transmitting information bits with error correction coding and decoder for the implementation of this process.
Pyndiah Ramesh,FRX ; Adde Patrick,FRX, Process for transmitting information bits with error correction coding, coder and decoder for the implementation of this process.
Hinedi Sami M. ; Griep Karl R. ; Million Samson, Punctured serial concatenated convolutional coding system and method for low-earth-orbit satellite data communication.
Hladik Stephen Michael ; Check William Alan ; Glinsman Brian James ; Fleming ; III Robert Fleming, Satellite communications system utilizing parallel concatenated coding.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.