Patent US5712880A successfully refreshed from Google Patents.
US5712880A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Traceback-performing apparatus in viterbi decoder
Assignee: Samsung Electronics Co Ltd
•
Filing: 1995-11-14
•
Granted: 1998-01-27
•
Expires: 2015-11-14
Abstract
Abstract A traceback-performing apparatus includes a first storing portion which receives and stores new path metric values and minimum path metric value so that the first input value is output later and the later input value is output first. A first trace logic portion which receives outputs of the first storing portion and the minimum path metric value and generates a first state which is the next state to be traced. A second storing portion which receives and stores the output of the first storing portion so that the first input value is output first and the later input value is output later. A second trace logic portion which receives the output of the second storing portion and the first state and generates a second state which is the next state to be traced. And, a third storing portion which receives and stores the second state so that the first input value is output later and the later input value is output first so as to find the decoded bits. Therefore, cost is saved in embodying the Viterbi decoder in a VLSI by reducing the required chip area, simplifying address-generation and eliminating the need for global interconnection.
Inventors
- 👤 Min-joong Rim
- 👤 Young-Uk Oh
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 15:06
CPC Classifications
H; H03; H03M; H03M13/00; H03M13/65; H03M13/6502; H03M13/37; H03M13/39; H03M13/3961; H03M13/41; H03M13/4107; H03M13/4161; H03M13/4169; H03M13/6505
Claims Analysis
Total Claims: 8
Claim 1
Independent Claim
298 words
A traceback-performing apparatus in a Viterbi decoder implemented in a VLSI which comprises branch metric means for calculating branch metric values by receiving a bit-stream to correct errors of the bit-stream, adding-comparing-selecting means for calculating new path metric values from current path metric values corresponding to the branch metric values, minimum path metric means for calculating a minimum path metric value among the new path metric values and temporarily storing the calculated value, and traceback means for receiving said new path metric values and minimum path metric value and searching a survival path to find decoded bits, and in which a constraint length is K, the size of a memory action group is L, where K and L are positive integers, and best state detecting means generates a current state value every uniform period, said traceback means comprising: first storing means for receiving and storing said new path metric values and minimum path metric value so that the first input value is output later and the later input value is output first; first trace logic means for receiving outputs of said first storing means and said current state value and generating a first state which is the next state to be traced; second storing means for receiving and storing the output of said first storing means so that the first input value is output first and the later input value is output later; second trace logic means for receiving the output of said second storing means and the first state and generating a second state which is the next state to be traced; and third storing means for receiving and storing the second state so that the first input value is output later and the later input value is output first, so as to find the decoded bits.
Claim 2
Dependent Claim
298 words
A traceback-performing apparatus in a Viterbi decoder implemented in a VLSI which comprises branch metric means for calculating branch metric values by receiving a bit-stream to correct errors of the bit-stream, adding-comparing-selecting means for calculating new path metric values from current path metric values corresponding to the branch metric values, minimum path metric means for calculating a minimum path metric value among the new path metric values and temporarily storing the calculated value, and traceback means for receiving said new path metric values and minimum path metric value and searching a survival path to find decoded bits, and in which a constraint length is K, the size of a memory action group is L, where K and L are positive integers, and best state detecting means generates a current state value every uniform period, said traceback means comprising: first storing means for receiving and storing said new path metric values and minimum path metric value so that the first input value is output later and the later input value is output first; first trace logic means for receiving outputs of said first storing means and said current state value and generating a first state which is the next state to be traced; second storing means for receiving and storing the output of said first storing means so that the first input value is output first and the later input value is output later; second trace logic means for receiving the output of said second storing means and the first state and generating a second state which is the next state to be traced; and third storing means for receiving and storing the second state so that the first input value is output later and the later input value is output first, so as to find the decoded bits.
Claim 3
Dependent Claim
356 words
A traceback-performing apparatus in a Viterbi decoder implemented in a VLSI which comprises branch metric means for calculating branch metric values by receiving a bit-stream to correct errors of the bit-stream, adding-comparing-selecting means for calculating new path metric values from current path metric values corresponding to the branch metric values, minimum path metric means for calculating a minimum path metric value among the new path metric values and temporarily storing the calculated value, and traceback means for receiving said new path metric values and minimum metric value and searching a survival path to find decoded bits, and in which a constraint length is K, the size of a memory action group is L/2, where K and L are positive integers, and best state detecting means generates a current state value every uniform period, said traceback means comprising: first storing means for receiving and storing said new path metric values and minimum path metric value so that the first input value is output later and the later input value is output first; first trace logic means for receiving outputs of said first storing means and said current state value and generating a first state which is the next state to be traced; second storing means for receiving and storing the output of said first storing means so that the first input value is output first and the later input value is output later; second trace logic means for receiving the output of said second storing means and the first state and generating a second state which is the next state to be traced; third storing means for receiving and storing the output of said second storing means so that the first input value is output first and the later input value is output later; third trace logic means for receiving the output of said third storing means and the second state, and generating a third state which is the next state to be traced; and fourth storing means for receiving and storing the third state so that the first input is output later and the later input is output first, so as to find the decoded bits.
Claim 4
Dependent Claim
356 words
A traceback-performing apparatus in a Viterbi decoder implemented in a VLSI which comprises branch metric means for calculating branch metric values by receiving a bit-stream to correct errors of the bit-stream, adding-comparing-selecting means for calculating new path metric values from current path metric values corresponding to the branch metric values, minimum path metric means for calculating a minimum path metric value among the new path metric values and temporarily storing the calculated value, and traceback means for receiving said new path metric values and minimum metric value and searching a survival path to find decoded bits, and in which a constraint length is K, the size of a memory action group is L/2, where K and L are positive integers, and best state detecting means generates a current state value every uniform period, said traceback means comprising: first storing means for receiving and storing said new path metric values and minimum path metric value so that the first input value is output later and the later input value is output first; first trace logic means for receiving outputs of said first storing means and said current state value and generating a first state which is the next state to be traced; second storing means for receiving and storing the output of said first storing means so that the first input value is output first and the later input value is output later; second trace logic means for receiving the output of said second storing means and the first state and generating a second state which is the next state to be traced; third storing means for receiving and storing the output of said second storing means so that the first input value is output first and the later input value is output later; third trace logic means for receiving the output of said third storing means and the second state, and generating a third state which is the next state to be traced; and fourth storing means for receiving and storing the third state so that the first input is output later and the later input is output first, so as to find the decoded bits.
Claim 5
Independent Claim
307 words
A method of performing traceback in a Viterbi decoder implemented in a VLSI which comprises branch metric means for calculating branch metric values by receiving a bit-stream to correct errors of the bit-stream, adding-comparing-selecting means for calculating new path metric values from current path metric values corresponding to the branch metric values, minimum path metric means for calculating a minimum path metric value among the new path metric values and temporarily storing the calculated value, and traceback means for receiving said new path metric values and minimum path metric value and searching a survival path to find decoded bits, and in which a constraint length is K, the size of a memory action group is L, where K and L are positive integers, and best state detecting means generates a current state value every uniform period, the method comprising the steps of: receiving and storing said new path metric values and minimum path metric value in a first storing means so that the first input value is output later and the later input value is output first; receiving outputs of said first storing means and said current state value at a first trace logic means and generating a first state which is the next state to be traced; receiving and storing the output of said first storing means in a second storing means so that the first input value is output first and the later input value is output later; receiving the output of said second storing means and the first state and at a second trace logic means generating a second state which is the next state to be traced; and receiving and storing the second state in a third storing means so that the first input value is output later and the later input value is output first, so as to find the decoded bits.
Claim 6
Independent Claim
307 words
A method of performing traceback in a Viterbi decoder implemented in a VLSI which comprises branch metric means for calculating branch metric values by receiving a bit-stream to correct errors of the bit-stream, adding-comparing-selecting means for calculating new path metric values from current path metric values corresponding to the branch metric values, minimum path metric means for calculating a minimum path metric value among the new path metric values and temporarily storing the calculated value, and traceback means for receiving said new path metric values and minimum path metric value and searching a survival path to find decoded bits, and in which a constraint length is K, the size of a memory action group is L, where K and L are positive integers, and best state detecting means generates a current state value every uniform period, the method comprising the steps of: receiving and storing said new path metric values and minimum path metric value in a first storing means so that the first input value is output later and the later input value is output first; receiving outputs of said first storing means and said current state value at a first trace logic means and generating a first state which is the next state to be traced; receiving and storing the output of said first storing means in a second storing means so that the first input value is output first and the later input value is output later; receiving the output of said second storing means and the first state and at a second trace logic means generating a second state which is the next state to be traced; and receiving and storing the second state in a third storing means so that the first input value is output later and the later input value is output first, so as to find the decoded bits.
Claim 7
Independent Claim
366 words
A method of performing traceback in a Viterbi decoder implemented in a VLSI which comprises branch metric means for calculating branch metric values by receiving a bit-stream to correct errors of the bit-stream, adding-comparing-selecting means for calculating new path metric values from current path metric values corresponding to the branch metric values, minimum path metric means calculating a minimum path metric value among the new path metric values and temporarily storing the calculated value, and traceback means for receiving said new path metric values and minimum metric value and searching a survival path to find decoded bits, and in which a constraint length is K, the size of a memory action group is L/2, where K and L are positive integers, and best state detecting means generates a current state value every uniform period, the method comprising the steps of: receiving and storing said new path metric values and minimum path metric value in a first storing means so that the first input value is output later and the later input value is output first; receiving outputs of said first storing means and said current state value at a first trace logic means and generating a first state which is the next state to be traced; receiving and storing the output of said first storing means in a second storing means so that the first input value is output first and the later input value is output later; receiving the output of said second storing means and the first state at a second trace logic means and generating a second state which is the next state to be traced; receiving and storing the output of said second storing means in a third storing means so that the first input value is output first and the later input value is output later; receiving the output of said third storing means and the second state, at a third trace logic means and generating a third state which is the next state to be traced; and receiving and storing the third state in a fourth storing means so that the first input is output later and the later input is output first, so as to find the decoded bits.
Claim 8
Independent Claim
366 words
A method of performing traceback in a Viterbi decoder implemented in a VLSI which comprises branch metric means for calculating branch metric values by receiving a bit-stream to correct errors of the bit-stream, adding-comparing-selecting means for calculating new path metric values from current path metric values corresponding to the branch metric values, minimum path metric means calculating a minimum path metric value among the new path metric values and temporarily storing the calculated value, and traceback means for receiving said new path metric values and minimum metric value and searching a survival path to find decoded bits, and in which a constraint length is K, the size of a memory action group is L/2, where K and L are positive integers, and best state detecting means generates a current state value every uniform period, the method comprising the steps of: receiving and storing said new path metric values and minimum path metric value in a first storing means so that the first input value is output later and the later input value is output first; receiving outputs of said first storing means and said current state value at a first trace logic means and generating a first state which is the next state to be traced; receiving and storing the output of said first storing means in a second storing means so that the first input value is output first and the later input value is output later; receiving the output of said second storing means and the first state at a second trace logic means and generating a second state which is the next state to be traced; receiving and storing the output of said second storing means in a third storing means so that the first input value is output first and the later input value is output later; receiving the output of said third storing means and the second state, at a third trace logic means and generating a third state which is the next state to be traced; and receiving and storing the third state in a fourth storing means so that the first input is output later and the later input is output first, so as to find the decoded bits.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-01-26 | 2001-07-28 | 2002-01-27 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-01-26 | 2005-07-28 | 2006-01-27 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-01-26 | 2009-07-28 | 2010-01-27 | $7700.00 | Window Closed / Lapsed |