Patent US4484338A successfully refreshed from Google Patents.
← Back to Patent Explorer
US4484338A Expired / Lapsed US ⏱️ 0.0 years remaining

Data transmission systems

Assignee: Telent Technologies Services Ltd
•
Filing: 1981-10-26
•
Granted: 1984-11-20
•
Expires: 2001-10-26
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method and apparatus for decoding received data signals using a Viterbi algorithm. To reduce the time required to decode a data signal, the system expands k received data vectors into nk vectors where n is smaller than m, m being the number of levels of the received data signal. Thereafter, k vectors are chosen from the nk expanded vectors and a "cost", defined herein is determined for each of said k vectors. The most likely identity of the received data signal is then determined on the basis of the computed costs.

Inventors

  • 👤 Adrian P. Clark
  • 👤 Michael J. Fairfield

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-24 16:51
CPC Classifications
H; H04; H04L; H04L25/00; H04L25/38; H04L25/40; H04L25/49; H04L25/4917; H03; H03M; H03M13/00; H03M13/37; H03M13/39; H04L25/02; H04L25/03; H04L25/03006; H04L25/03178; H04L25/03203; H04L25/03229; H04L25/03248; H04L25/03299

Claims Analysis

Total Claims: 8
Claim 1
Independent Claim 101 words
A method of detecting a multi-level input signal using a Viterbi algorithm, in which the incoming signal has m levels, said method comprising the steps of sampling the incoming signal at regular predetermined intervals thereby to generate signal samples, expanding each signal sample of the received signal into nk expanded vectors where n is smaller than m, from the nk expanded vectors having a respective cost associated therewith, selecting k vectors with the smallest costs, storing said selected k vectors together with their associated costs, and calculating the most likely level of the received signal on the basis of said costs.
Claim 2
Independent Claim 101 words
A method of detecting a multi-level input signal using a Viterbi algorithm, in which the incoming signal has m levels, said method comprising the steps of sampling the incoming signal at regular predetermined intervals thereby to generate signal samples, expanding each signal sample of the received signal into nk expanded vectors where n is smaller than m, from the nk expanded vectors having a respective cost associated therewith, selecting k vectors with the smallest costs, storing said selected k vectors together with their associated costs, and calculating the most likely level of the received signal on the basis of said costs.
Claim 3
Dependent Claim 38 words
A method of detecting a multi-level input signal as claimed in claim 1 in which the expansion process is performed sequentially in two operations and in which n=m 1/2 , k vectors being chosen after each expansion process.
Claim 4
Dependent Claim 55 words
A method of detecting a multi-level input signal as claimed in claim 1 wherein the expansion process is performed simultaneously in two operations and in which n≦m 1/2 such that the two sets of nk expanded vectors give a total of n 2 k vectors from which are selected the k vectors to be stored.
Claim 5
Independent Claim 142 words
An apparatus for decoding a multi-level data signal employing a Viterbi algorithm wherein the data signal has m levels, said apparatus comprising: receiving means for receiving said data signal, sampling means for sampling the received data signal at regular predetermined intervals thereby to generate a plurality of signal samples, expanding means for expanding each signal sample of the received data signal into nk expanded vectors wherein n is smaller than m, cost generating means for generating a cost associated with each of said selected k vectors, selecting means for selecting k vectors from said nk expanded vectors which have the smallest cost, storing means for storing said selected k vectors together with a respective cost associated with each of said k vectors, and calculating means for calculating the most likely level of said received data signal on the basis of said cost.
Claim 6
Independent Claim 142 words
An apparatus for decoding a multi-level data signal employing a Viterbi algorithm wherein the data signal has m levels, said apparatus comprising: receiving means for receiving said data signal, sampling means for sampling the received data signal at regular predetermined intervals thereby to generate a plurality of signal samples, expanding means for expanding each signal sample of the received data signal into nk expanded vectors wherein n is smaller than m, cost generating means for generating a cost associated with each of said selected k vectors, selecting means for selecting k vectors from said nk expanded vectors which have the smallest cost, storing means for storing said selected k vectors together with a respective cost associated with each of said k vectors, and calculating means for calculating the most likely level of said received data signal on the basis of said cost.
Claim 7
Dependent Claim 41 words
An apparatus according to claim 4 wherein said expanding means comprises means for sequentially expanding each sample in two sequential operations in which n=m 1/2 , and means for selecting k vectors having expanding each said sample of received data signal.
Claim 8
Dependent Claim 65 words
An apparatus as recited in claim 4 wherein said expanding means comprises means for expanding each sample of the received data signal in two simultaneous operations in which n is less than or equal to the square root of m such that the two sets of nk expanded vectors render a total of n 2 k vectors from which k vectors are selected and stored.

References Cited (Backward Citations)

US4130818A Cited
US4171516A Cited
US4240156A Cited
US4293953A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1987-11-20 1988-05-21 1988-11-20 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1991-11-20 1992-05-21 1992-11-20 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1995-11-20 1996-05-21 1996-11-20 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag