US5488637A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Decoding method and apparatus having optimum decoding paths
Assignee: Samsung Electronics Co Ltd
•
Filing: 1994-03-28
•
Granted: 1996-01-30
•
Expires: 2014-03-28
Abstract
Abstract A decoding method and apparatus having an optimum decoding path includes a Viterbi decoder having an overlapping function in which the input signal is moved in units of the window movement distance of at least one symbol and the code sequence is decoded in units representing a decoding depth, so that overlap in the decoded data occurs. Then, the output of the Viterbi decoder with the overlap function is stored in a memory. A control signal generator controls the positions of the data to be output from the memory according to the output of a counter receiving the decoded data. The most frequent data out of all data supplied to a comparator is selected as an optimum decoding path. Thus, the error associated with wrong path selection, e.g., when the data is wrongly decoded due to the error generated by the noise added during transmission, can be reduced.
Inventors
- 👤 Jechang Jeong
- 👤 Hyunsoo Shin
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-05 16:42
CPC Classifications
H; H03; H03M; H03M13/00; H03M13/37; H03M13/39; H03M13/3972; H04; H04L; H04L25/00; H04L25/02; H04L25/03; H04L25/03006; H04L25/03178; H04L25/03203; H03M13/03; H03M13/23
Claims Analysis
Total Claims: 20
Claim 1
Independent Claim
159 words
A decoding apparatus having an optimum decoding path for use in a digital communication apparatus which decodes a code sequence constituting symbols, said decoding apparatus comprising: a decoder for decoding the symbols within a window formed in units representing a decoding depth after receiving the code sequence to generate decoded data, and for relocating the window on the code sequence by a predetermined movement distance whenever the decoding with respect to the window is completed; memory means for storing the decoded data supplied from the decoder and for providing respective stored decoded data in response to respective address signals; control means for receiving the decoded data from the decoder and generating respective said address signals permitting reproduction of said stored decoded data corresponding to an identical symbol from the memory means; and means for outputting the stored decoded data having the highest frequency of occurrence among the decoded data corresponding to the identical symbol received from the memory means.
Claim 2
Dependent Claim
159 words
A decoding apparatus having an optimum decoding path for use in a digital communication apparatus which decodes a code sequence constituting symbols, said decoding apparatus comprising: a decoder for decoding the symbols within a window formed in units representing a decoding depth after receiving the code sequence to generate decoded data, and for relocating the window on the code sequence by a predetermined movement distance whenever the decoding with respect to the window is completed; memory means for storing the decoded data supplied from the decoder and for providing respective stored decoded data in response to respective address signals; control means for receiving the decoded data from the decoder and generating respective said address signals permitting reproduction of said stored decoded data corresponding to an identical symbol from the memory means; and means for outputting the stored decoded data having the highest frequency of occurrence among the decoded data corresponding to the identical symbol received from the memory means.
Claim 3
Dependent Claim
37 words
The decoding apparatus having the optimum decoding path according to claim 1, wherein said decoder moves the window by the predetermined movement distance corresponding to a number of the symbols which is smaller than the decoding depth.
Claim 4
Dependent Claim
42 words
The decoding apparatus having the optimum decoding path according to claim 1, wherein said decoder generates the decoded data with respect to the symbols identical to an overlap number which is obtained by dividing the decoding depth by the predetermined movement distance.
Claim 5
Dependent Claim
31 words
The decoding apparatus having the optimum decoding path according to claim 3, wherein said memory means has a storage capacity which is determined by the decoding depth and the overlap number.
Claim 6
Dependent Claim
80 words
The decoding apparatus having the optimum decoding path according to claim 1, wherein said control means comprises: a counter which counts the decoded data applied from said decoder in units of the decoding depth and outputs a counted value; and a control signal generator which compares the applied counted value with a predetermined reference number representing window overlap indicating storage state of the memory means, and generates respective said address signals corresponding to the storage state of the memory means.
Claim 7
Dependent Claim
41 words
The decoding apparatus having the optimum decoding path according to claim 5, wherein said control signal generator generates a control signal permitting reproduction said stored decoded data with respect to the identical symbol in units corresponding to respective predetermined movement distance.
Claim 8
Dependent Claim
74 words
The decoding apparatus having the optimum decoding path according to claim 6, wherein said control signal generator generates respective said address signals (ADDR) which satisfy the following equation when the counted value is smaller than the predetermined reference number, ADDR=(N×CO.sub.OUT -1)-N×i+i×M+j where i=0,1, . . . ,(CO OUT -1) and j=0,1, . . . ,(N-1), wherein CO OUT is the counted value, N is respective predetermined movement distance, and M is the decoding depth.
Claim 9
Dependent Claim
51 words
The decoding apparatus having the optimum decoding path according to claim 6, wherein said control signal generator generates corresponding respective address signals according to a result obtained by dividing the counted value by the predetermined reference number when the counted value is greater than or equal to the predetermined reference number.
Claim 10
Dependent Claim
67 words
The decoding apparatus having the optimum decoding path according to claim 8, wherein said control signal generator generates respective said address signals (ADDR) which satisfy the following equation when a division result produces no residue, ADDR=(M-N)-N×i+i×M×j where i=0,1, . . . ,(M/N)-1, and j=0,1, . . . ,N-1, wherein N is respective predetermined movement distance, CO OUT is the counted value and M is the decoding depth.
Claim 11
Dependent Claim
87 words
The decoding apparatus having the optimum decoding path according to claim 8, wherein said control signal generator generates respective said address signals (ADDR) which satisfies the following equations when a division result has a predetermined residue, (CO.sub.OUT modulo M/N)-N×i+i×M+j where i=0,1, . . . ,(CO OUT modulo M/N)-1 and (CO.sub.OUT modulo M/N)+N-N×i+i×M+j where i=(CO OUT modulo M/N), . . . ,(M/N)-1, wherein j=0,1, . . . (N-1) and wherein N is respective predetermined movement distance, CO OUT is the counted value, and M is the decoding depth.
Claim 12
Dependent Claim
37 words
The decoding apparatus having the optimum decoding path according to claim 6, wherein said outputting means comprises a comparator which compares the decoded data with respect to the identical symbols in units of respective predetermined movement distance.
Claim 13
Dependent Claim
134 words
A decoding method having an optimum decoding path for use in a digital communication which decodes a code sequence having symbols, said decoding method comprising the steps of: (a) decoding the symbols within a window formed in units of a decoding depth after receiving the code sequence to thereby generate decoded data; (b) repositioning the window on the code sequence by a predetermined movement distance whenever the decoding step (a) with respect to the window is completed; (c) storing the decoded data generated for each respective window to produce stored decoded data; (d) reading the stored decoded data corresponding to an identical symbol among the stored decoded data; and (e) comparing the read decoded data with each other to thereby output the decoded data having a maximum frequency of occurrence as the corresponding symbol.
Claim 14
Dependent Claim
134 words
A decoding method having an optimum decoding path for use in a digital communication which decodes a code sequence having symbols, said decoding method comprising the steps of: (a) decoding the symbols within a window formed in units of a decoding depth after receiving the code sequence to thereby generate decoded data; (b) repositioning the window on the code sequence by a predetermined movement distance whenever the decoding step (a) with respect to the window is completed; (c) storing the decoded data generated for each respective window to produce stored decoded data; (d) reading the stored decoded data corresponding to an identical symbol among the stored decoded data; and (e) comparing the read decoded data with each other to thereby output the decoded data having a maximum frequency of occurrence as the corresponding symbol.
Claim 15
Dependent Claim
44 words
The decoding method having the optimum decoding path according to claim 12, wherein the step (b) comprises a step of moving the window by the predetermined movement distance which is associated with the number of symbols and which is smaller than the decoding depth.
Claim 16
Dependent Claim
40 words
The decoding method having the optimum decoding path according to claim 12, wherein the step (b) comprises a step (b1) for decoding the identical symbol by an overlap number obtained by dividing the decoding depth by the predetermined movement distance.
Claim 17
Dependent Claim
39 words
The decoding method having the optimum decoding path according to claim 12, wherein the step (c) comprises storing the decoded data by a memory having a storage capacity which is determined by the decoding depth and an overlap number.
Claim 18
Dependent Claim
79 words
The decoding method having the optimum decoding path according to claim 12, wherein the step (d) comprises the steps of: (d1) counting the decoded data generated in the step (a) in units representing the decoding depth to thereby generate a count value; (d2) comparing the count value generated by step (d1) with a predetermined reference number representing window overlap; and (d3) reading that one of the stored decoded data corresponding to the identical symbol among the stored decoded data.
Claim 19
Dependent Claim
29 words
The decoding method having the optimum decoding path according claim 16, wherein the step (d3) comprises producing the stored decoded data in units representative of the predetermined movement distance.
Claim 20
Dependent Claim
42 words
The decoding method having the optimum decoding path according to claim 16, wherein the step (d2) comprises comparing the decoded data with respect to the identical symbol in units representing window movement by the predetermined movement distance with respect to each other.
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) | 1999-01-29 | 1999-07-31 | 2000-01-30 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-01-29 | 2003-07-31 | 2004-01-30 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-01-29 | 2007-07-31 | 2008-01-30 | $7700.00 | Window Closed / Lapsed |