Patent US5285480A successfully refreshed from Google Patents.
US5285480A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Adaptive MLSE-VA receiver for digital cellular radio
Assignee: BlackBerry Ltd
•
Filing: 1991-09-03
•
Granted: 1994-02-08
•
Expires: 2011-09-03
Abstract
Abstract A TDMA RF received signal is demodulated by first being filtered with a fixed transversal filter having a characteristic selected for matching a fixed square root raised cosine pulse characteristic of the received signal. The filtered signal is then adaptively filtered for compensating for a time varying impulse response of the channel. The adaptive filtering is performed initially during a synchronizing portion (preamble) of the filtered signal in accordance with a fast recursive least squares algorithm. Subsequent filter adaptation to a data portion of the filtered signal is accomplished in accordance with a computationally less expensive normalized least mean square procedure. The adaptive filter repetitively applies a modified Viterbi algorithm to blocks of 2D symbols, such that D symbols are released for adapting the adaptive filter means during the data portion of the filtered signal and the signal. The released symbols are also employed for adapting elements required in computing a metric for the modified Viterbi algorithm and the reconstructed signal used to form an error signal that drives the adaptation algorithms.
Inventors
- 👤 Sandeep Chennakeshu
- 👤 Anand Narasimhan
- 👤 John B. Anderson
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 21:35
CPC Classifications
H; H04; H04B; H04B7/00; H04B7/24; H04B7/26; H04B7/2643; H04L; H04L25/00; H04L25/02; H04L25/03; H04L25/03006; H04L25/03012; H04L25/03019; H04L25/03038; H04L25/03178; H04L25/03248; H04L25/03254; H04L2025/03433; H04L2025/03439; H04L2025/03445; H04L2025/03471; H04L2025/03477; H04L2025/03592; H04L2025/03726; H04L25/03203; H04L25/03229; H04L25/03299
Claims Analysis
Total Claims: 20
Claim 1
Independent Claim
137 words
Apparatus for demodulating a time division multiple access (TDMA) signal having a plurality of symbols, said signal comprising at least a synchronizing portion and a data portion within a time slot, said apparatus comprising: means for receiving the signal over a channel; first filter means coupled to an output of the receiving means and comprising a fixed transversal filter having a characteristic selected for matching to a fixed signal pulse characteristic of the received signal for producing a filtered signal, said first filter means characteristic being selected for matching a square root raised cosine pulse characteristic of the received signal; and second filter means coupled to an output of the first filter means and comprising an adaptive filter having a characteristic selected for adaptively compensating the filtered signal for a time varying impulse response of the channel.
Claim 2
Dependent Claim
137 words
Apparatus for demodulating a time division multiple access (TDMA) signal having a plurality of symbols, said signal comprising at least a synchronizing portion and a data portion within a time slot, said apparatus comprising: means for receiving the signal over a channel; first filter means coupled to an output of the receiving means and comprising a fixed transversal filter having a characteristic selected for matching to a fixed signal pulse characteristic of the received signal for producing a filtered signal, said first filter means characteristic being selected for matching a square root raised cosine pulse characteristic of the received signal; and second filter means coupled to an output of the first filter means and comprising an adaptive filter having a characteristic selected for adaptively compensating the filtered signal for a time varying impulse response of the channel.
Claim 3
Dependent Claim
64 words
Apparatus as set forth in claim 1 and further comprising means responsive to the filtered signal for initially adapting the second filter means during a synchronizing portion of the filtered signal in accordance with a recursive least squares technique and for subsequently adapting the second filter means during the data portion of the filtered signal in accordance with a normalized least mean square technique.
Claim 4
Dependent Claim
21 words
Apparatus as set forth in claim 2 wherein the recursive least squares technique is implemented by a complex fast kalman algorithm.
Claim 5
Dependent Claim
48 words
Apparatus as set forth in claim 2 wherein signal elements represented by {s(1)} are determined initially through an autocorrelation of a channel impulse response, with signal element s(0) being fixed and signal elements s(1), 1=1,2, . . . N being adapted using the normalized least mean square technique.
Claim 6
Dependent Claim
74 words
Apparatus as set forth in claim 1 wherein the second filter means further includes means for processing the filtered signal in accordance with a Viterbi algorithm of decision depth D, the Viterbi algorithm being repetitively applied on blocks of 2D symbols, such that D symbols are released for adapting the second filter means and signal elements, during a data portion of the filtered signal, in accordance with a normalized least mean square (NLMS) technique.
Claim 7
Independent Claim
113 words
A method for demodulating a time division multiple access (TDMA) signal having a plurality of symbols, said signal comprising at least a synchronizing portion and a data portion within a time slot, comprising the steps of: receiving the signal over a channel; filtering the received signal with fixed transversal filter means having a characteristic selected for matching to a fixed signal pulse characteristic of the received signal, the step of filtering the received signal including matching a filter to a square root raised cosine pulse characteristic of the received signal; and adaptively filtering the filtered signal with adaptive filter means in order to compensate for a time varying impulse response of the channel.
Claim 8
Independent Claim
113 words
A method for demodulating a time division multiple access (TDMA) signal having a plurality of symbols, said signal comprising at least a synchronizing portion and a data portion within a time slot, comprising the steps of: receiving the signal over a channel; filtering the received signal with fixed transversal filter means having a characteristic selected for matching to a fixed signal pulse characteristic of the received signal, the step of filtering the received signal including matching a filter to a square root raised cosine pulse characteristic of the received signal; and adaptively filtering the filtered signal with adaptive filter means in order to compensate for a time varying impulse response of the channel.
Claim 9
Dependent Claim
37 words
The method as set forth in claim 6 and further comprising the step of: adapting the adaptive filter means during the data portion of the filtered signal in accordance with a normalized least mean square (NLMS) algorithm.
Claim 10
Dependent Claim
65 words
The method as set forth in claim 6 wherein the step of adaptively filtering the filtered signal includes repetitively applying a Viterbi algorithm of decision depth D to blocks of 2D symbols such that, during the data portion of the filtered signal, D symbols are released for adapting the adaptive filter means and signal elements, in accordance with a normalized least mean square (NLMS) algorithm.
Claim 11
Independent Claim
150 words
A method for demodulating a time division multiple access (TDMA) RF signal having a plurality of symbols, comprising at least a synchronizing portion and a data portion of a time slot, said method comprising the steps of: receiving the RF signal over a channel; filtering the received signal with fixed transversal filter means having a characteristic selected for matching a square root raised cosine pulse characteristic of the received RF signal; and adaptively filtering the filtered signal with adaptive filter means in order to compensate for a time varying impulse response of the channel, the step of adaptively filtering including the steps of, initially adapting the adaptive filter means during the synchronizing portion of the filtered signal in accordance with a recursive least squares algorithm; and subsequently adapting the adaptive filter means during the data portion of the filtered signal in accordance with a normalized least mean square (NLMS) algorithm.
Claim 12
Independent Claim
150 words
A method for demodulating a time division multiple access (TDMA) RF signal having a plurality of symbols, comprising at least a synchronizing portion and a data portion of a time slot, said method comprising the steps of: receiving the RF signal over a channel; filtering the received signal with fixed transversal filter means having a characteristic selected for matching a square root raised cosine pulse characteristic of the received RF signal; and adaptively filtering the filtered signal with adaptive filter means in order to compensate for a time varying impulse response of the channel, the step of adaptively filtering including the steps of, initially adapting the adaptive filter means during the synchronizing portion of the filtered signal in accordance with a recursive least squares algorithm; and subsequently adapting the adaptive filter means during the data portion of the filtered signal in accordance with a normalized least mean square (NLMS) algorithm.
Claim 13
Dependent Claim
58 words
The method set forth in claim 9 wherein the step of subsequently adapting the adaptive filter means includes repetitively applying a Viterbi algorithm of decision depth D to blocks of 2D symbols, such that D symbols are released for adapting the adaptive filter means to the data portion of the filtered signal in accordance with the NLMS algorithm.
Claim 14
Dependent Claim
55 words
The method set forth in claim 10 wherein , when 2D is not an integral multiple of the number of symbols in the slot (N sym ), the last {N sym - (N sym /2D) 2D} symbols are appended to a last block of symbols before the Viterbi algorithm is applied to the last block.
Claim 15
Independent Claim
218 words
A method for demodulating a time division multiple access (TDMA) RF signal having a plurality of symbols and at least a synchronizing portion and a data portion of a time slot, comprising the steps of: (a) receiving the RF signal over a channel; (b) determining a channel impulse response of the received signal over the synchronizing portion; (c) determining signal elements s(-1), S(0), s(1) through autocorrelation, S being defined by ##EQU11## where k represents the index of summation in said autocorrelation operation, N represents the number of samples of the channel impulse response, h(k) represents the estimate of the channel impulse response h(k), and * denotes conjugate; (d) employing a normalized least mean square algorithm for adapting the channel impulse response {h(n)}; (e) operating a maximum likelihood sequence estimator over 2D symbols, said maximum likelihood sequence estimator being implemented by a modified Viterbi algorithm of decision depth D; (f) releasing D symbols; (g) employing the released D symbols to update the channel impulse response; and (h) beginning with a Dth symbol, repeating steps (e), (f) and (g) until a penultimate data block having 2D symbols is received, or, if 2D is not an integral multiple of a number of symbols N sym , appending {N sym -(N sym /2D 2D} symbols to a last block of 2D symbols.
Claim 16
Independent Claim
218 words
A method for demodulating a time division multiple access (TDMA) RF signal having a plurality of symbols and at least a synchronizing portion and a data portion of a time slot, comprising the steps of: (a) receiving the RF signal over a channel; (b) determining a channel impulse response of the received signal over the synchronizing portion; (c) determining signal elements s(-1), S(0), s(1) through autocorrelation, S being defined by ##EQU11## where k represents the index of summation in said autocorrelation operation, N represents the number of samples of the channel impulse response, h(k) represents the estimate of the channel impulse response h(k), and * denotes conjugate; (d) employing a normalized least mean square algorithm for adapting the channel impulse response {h(n)}; (e) operating a maximum likelihood sequence estimator over 2D symbols, said maximum likelihood sequence estimator being implemented by a modified Viterbi algorithm of decision depth D; (f) releasing D symbols; (g) employing the released D symbols to update the channel impulse response; and (h) beginning with a Dth symbol, repeating steps (e), (f) and (g) until a penultimate data block having 2D symbols is received, or, if 2D is not an integral multiple of a number of symbols N sym , appending {N sym -(N sym /2D 2D} symbols to a last block of 2D symbols.
Claim 17
Dependent Claim
238 words
In a digital cellular radio receiver having a maximum likelihood sequence estimator demodulator for receiving signal elements, represented by {s(1)}, and determining a value for said signal elements from an estimated channel impulse response, represented by h(n)=[h.sub.n (1)h.sub.n (2) . . . h.sub.n (N)], wherein N denotes the number of samples of the channel impulse response, said demodulator including a channel adaption circuit, a matched filter including an adaptive filter matched to the channel impulse response, means coupling the channel adaption circuit to the adaptive filter, a modified Viterbi algorithm generator responsive to said adaptive filter, and a signal reconstruction circuit responsive to said channel adaptation circuit and said modified Viterbi algorithm generator, a method of determining a value for said signal elements comprising the steps of: (a) determining in said channel adaptation circuit a value of a first factor σ(n) in accordance with σ(n)=γσ(n-1)+1, with an initial value of σ(0)=0 and γ chosen to be a value between 0.9-0.95; (b) determining in said channel adaptation circuit a vector of smoothed channel impulse response coefficients in accordance with the expression ##EQU12## where h s (n) is the vector of smoothed channel impulse response coefficients denoted by [h sn (1), h sn (2) .sub.. . . h sn (N)], the subscript sn denoting a smoothed estimate at time n; nd (c) determining in said signal reconstruction circuit a value for the signal elements in accordance with the expression: ##EQU13##
Claim 18
Dependent Claim
238 words
In a digital cellular radio receiver having a maximum likelihood sequence estimator demodulator for receiving signal elements, represented by {s(1)}, and determining a value for said signal elements from an estimated channel impulse response, represented by h(n)=[h.sub.n (1)h.sub.n (2) . . . h.sub.n (N)], wherein N denotes the number of samples of the channel impulse response, said demodulator including a channel adaption circuit, a matched filter including an adaptive filter matched to the channel impulse response, means coupling the channel adaption circuit to the adaptive filter, a modified Viterbi algorithm generator responsive to said adaptive filter, and a signal reconstruction circuit responsive to said channel adaptation circuit and said modified Viterbi algorithm generator, a method of determining a value for said signal elements comprising the steps of: (a) determining in said channel adaptation circuit a value of a first factor σ(n) in accordance with σ(n)=γσ(n-1)+1, with an initial value of σ(0)=0 and γ chosen to be a value between 0.9-0.95; (b) determining in said channel adaptation circuit a vector of smoothed channel impulse response coefficients in accordance with the expression ##EQU12## where h s (n) is the vector of smoothed channel impulse response coefficients denoted by [h sn (1), h sn (2) .sub.. . . h sn (N)], the subscript sn denoting a smoothed estimate at time n; nd (c) determining in said signal reconstruction circuit a value for the signal elements in accordance with the expression: ##EQU13##
Claim 19
Dependent Claim
32 words
The method set forth in claim 13 wherein a value of s(0) is kept fixed, and wherein s(1) and s(-1) are updated with time in accordance with the expression of step (c).
Claim 20
Dependent Claim
28 words
The method set forth in claim 14 wherein, for an n th instant, s(1) and s(-1) are computed in accordance with the expressions: s(1)=h.sub.sn (1)h.sub.sn.sup.* (2); and s(-1)=s*(1).
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) | 1997-02-07 | 1997-08-09 | 1998-02-08 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-02-07 | 2001-08-09 | 2002-02-08 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-02-07 | 2005-08-09 | 2006-02-08 | $7700.00 | Window Closed / Lapsed |