US5347541A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Apparatus and method for utilizing a blind equalizer based on a Bayesian symbol sequence estimator for use in digital communication
Assignee: University of California
•
Filing: 1992-11-02
•
Granted: 1994-09-13
•
Expires: 2012-11-02
Abstract
Abstract A Bayesian blind equalizer which approximates the optimum symbol-by-symbol detector for an unknown intersymbol interference pattern in a communication channel is provided in a plurality of parallel processors. Each processor operates in parallel from a common data bus with each of the other processors. Each of the processors in turn generates an estimated signal and updated metric for the communication channel for a corresponding one of each of the possible data subsequences which could cause intersymbol interference. The estimated signals or innovations are then combined with the updated metrics in a supervisory processor to generate unconditional channel coefficients for the next received data sample. Using the estimated channel coefficients and received data samples, the transmitted data sample is reliably decoded notwithstanding intersymbol interference without the use of data preambles or training data and notwithstanding that the channel coefficients may be rapidly varying.
Inventors
- 👤 Ronald A. Iltis
- 👤 John J. Shynk
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 17:28
CPC Classifications
H; H04; H04L; H04L25/00; H04L25/02; H04L25/03; H04L25/03006; H04L25/03012; H04L25/03019; H04L25/03057; H04L25/0307
Claims Analysis
Total Claims: 22
Claim 1
Independent Claim
241 words
(once amended) An apparatus for performing blind equalization of digital communication over a communication channel upon which data signals are received comprising: a memory for storing every possible data subsequence in which intersymbol interference could occur and for storing updated communication channel coefficients; a first data bus coupled to said memory for communicating said received data signals, stored data subsequences and stored updated communication channel coefficients; a plurality of signal processors each coupled in parallel to said first data bus, each processor for generating estimated received data signals and updated estimated communication channel coefficients, each processor generating said estimated received data signals and updated estimated communication channel coefficients for one of said stored possible data subsequences; a second data bus coupled in parallel to said plurality of signal processors for communicating said estimated data signals and updated estimated communication channel coefficients; and a central processing circuit coupled to said first and second data buses for controlling operation of said first and second data buses and said plurality of signal processors, for estimating unconditional channel coefficients, for storing said estimated unconditional channel coefficients in said memory, and for decoding said received data according to a Bayesian estimation based on said estimated unconditional channel coefficients and updated estimated communication channel coefficients for each of said stored possible subsequences, whereby said received data which is subject to data smearing is reliably decoded notwithstanding intersymbol interference and without use of training data or signaling preambles.
Claim 2
Dependent Claim
241 words
(once amended) An apparatus for performing blind equalization of digital communication over a communication channel upon which data signals are received comprising: a memory for storing every possible data subsequence in which intersymbol interference could occur and for storing updated communication channel coefficients; a first data bus coupled to said memory for communicating said received data signals, stored data subsequences and stored updated communication channel coefficients; a plurality of signal processors each coupled in parallel to said first data bus, each processor for generating estimated received data signals and updated estimated communication channel coefficients, each processor generating said estimated received data signals and updated estimated communication channel coefficients for one of said stored possible data subsequences; a second data bus coupled in parallel to said plurality of signal processors for communicating said estimated data signals and updated estimated communication channel coefficients; and a central processing circuit coupled to said first and second data buses for controlling operation of said first and second data buses and said plurality of signal processors, for estimating unconditional channel coefficients, for storing said estimated unconditional channel coefficients in said memory, and for decoding said received data according to a Bayesian estimation based on said estimated unconditional channel coefficients and updated estimated communication channel coefficients for each of said stored possible subsequences, whereby said received data which is subject to data smearing is reliably decoded notwithstanding intersymbol interference and without use of training data or signaling preambles.
Claim 3
Dependent Claim
28 words
The apparatus of claim 1 wherein said central processing circuit comprises a supervisory processor and an address bus coupled to said supervisor processor and memory for communication therebetween.
Claim 4
Dependent Claim
37 words
The apparatus of claim 2 wherein said memory is comprised of a read only memory for storing said plurality of sets of data subsequences and a random access memory for temporarily storing said unconditional channel coefficient estimates.
Claim 5
Dependent Claim
32 words
(once amended) The apparatus of claim 1 wherein each of said signal processors comprises means for computing an estimated received value for each one of a predetermined number of possible data subsequences.
Claim 6
Dependent Claim
36 words
The apparatus of claim 4 wherein each said signal processor further comprises a corresponding channel estimator for computing a normalized least mean square (LMS) update of said channel coefficient estimates read from said first data bus.
Claim 7
Dependent Claim
34 words
The apparatus of claim 5 in combination with a transmitter wherein each of said signal processors further comprises a read only memory (g-ROM) for storing a corresponding pulse function, g(t), corresponding to said transmitter.
Claim 8
Dependent Claim
21 words
The apparatus of claim 4 wherein said predetermined number is four and wherein processors comprise said plurality of parallel signal processors.
Claim 9
Dependent Claim
134 words
(once amended) The apparatus of claim 1 wherein each said signal processor generates an estimated signal, r i (k|k-1), for each possible data subsequence, d i k ,L, through a computational operation modeled by the equation: ##EQU8## where i, l, k, n are integer indices, i, l and n representing the number or a data sequence, and k the time interval of each symbol in each sequence, T is the period of a single data symbol, g is a function representing the data symbol pulse, f is a channel coefficient, and d k-1-n i is an element from the set d i k ={d i (k), d i (k-1), . . . , d i (0)} representing the ith sequence of all logically possible data sequences beginning from the start time k=0 to k.
Claim 10
Dependent Claim
141 words
(once amended) The apparatus of claim 1 wherein each of said signal processor generates said updated channel coefficient estimates for each possible data subsequence, d i k ,L, through an operation as modeled by equation: ##EQU9## where i and k are integer indices, i representing the number of a data sequence, and k the time interval of each symbol in each sequence, L is an integer representing the number of possibly interfering data symbols, τ and f are estimated timing and channel coefficients respectively, K is a Kalman gain matrix, d i *(k) is the complex conjugate of a possible data symbol, r(k) is a received data symbol at time k, d i k ,L is a set {d i (k), d i (k-1), . . . , d i (k-L+1)} possible data subsequences, and r is an estimatcd data symbol.
Claim 11
Dependent Claim
141 words
(once amended) The apparatus of claim 8 wherein each of said signal processor generates said updated channel coefficient estimates for each possible data subsequence, d i k ,L through an operation as modeled by equation: ##EQU10## where i and k are integer indices, i representing the number of a data sequence, and k the time interval of each symbol in each sequence, L is an integer representing the number of possibly interfering data symbols, τ and f are estimated timing and channel coefficients respectively, K is a Kalman gain matrix, d i *(k) is the complex conjugate of a possible data symbol, r(k) is a received data symbol at time k, d i k ,L is a set {d i (k), d i (k-1), . . . , d i (k-L+1)} possible data subsequences, and r is an estimated data symbol.
Claim 12
Dependent Claim
154 words
(once amended) The apparatus of claim 1 wherein for each received data signal, r(k), said central processing circuit operates to generate a likelihood, P(d i k ,L |r k ), of having received said data signal, r(k), given a possible transmitted data sequence, d i k ,L, and given all prior data signals received, r k-1 , for each possible data subsequence, d i k ,L, as modeled by the recursive equation: ##EQU11## where c is a normalization constant, p(r(k)|d i k ,L,r k-1 ) is the Gaussian distribution density, i, j and k are integer indices, i and j representing the number of a data sequence, and k the time interval of each symbol in each sequence, L is an integer representing the number of possibly interfering data symbols, and d i k ,L is a set {d i (k), d i (k-1), . . . , d i (k-L+1)} possible data subsequences,
Claim 13
Dependent Claim
137 words
(once amended) The apparatus of claim 11 wherein said central processing circuit operates to update the metric that the probability that the possible data subsequence d i k ,L has been received given that the data sequence r k was received for each possible data subsequence, d i k ,L, as modeled by the equation: ##EQU12## where c is a normalization constant, p(r(k)|d i k ,L,r k-1 ) is the Gaussian distribution density, i, j and k are integer indices, i and j representing the number of a data sequence, and k the time interval of each symbol in each sequence, L is an integer representing the number of possibly interfering data symbols, and d i k ,L is a set {d i (k), d i (k-1), . . . , d i (k-L+1)} possible data subsequences.
Claim 14
Dependent Claim
142 words
(once amended) The apparatus of claim 12 wherein each of said signal processors functions to generate conditional channel estimate, τ(k|k) and f(k|k), for each possible data subsequence, d i k ,L, as modeled by the equation: ##EQU13## where i and k are integer indices, i representing the number of a data sequence, and k the time interval of each symbol in each sequence, L is an integer representing the number of possibly interfering data symbols, τ and f are estimated timing and channel coefficients respectively, K is a Kalman gain matrix, d i -(k) is the complex conjugate of a possible data symbol, r(k) is a received data symbol at time k, d i k ,L is a set {d i (k), d i (k-1), . . . , d i (k-L+1)} possible data subsequences, and r is an estimated data symbol.
Claim 15
Dependent Claim
188 words
The apparatus of claim 13 wherein said central processing circuit functions in preparation for receipt of the next data sample, r(k+1), for each next possible data subsequence, d i k-1 ,L, to generate the unconditional channel estimate, f i (k+1|k), for each possible data subsequence, d i k ,L, as modeled by the equation: ##EQU14## where i, j, m and k are integer indices, i, m and j representing the number of a data sequence, and k the time interval of each symbol in each sequence, L is an integer representing the number of possibly interfering data symbols, and d i k ,L is an element of the set {d i (k), d i (k-1), . . . , d i (k-L+1)} of all possible data subsequences, and P(d i k ,L |r k ) is the likelihood of having received said data signal, r(k), given a possible transmitted data sequence, d i k ,L, and given all prior data signals received, r k-1 , for each possible data subsequence, d i k ,L and F is a matrix describing bandwidth channel coefficients set at an estimated value.
Claim 16
Independent Claim
173 words
A method for communicating digital information in a communication channel subject to intersymbol interference by using blind equalization comprising the steps of receiving a sample r(k); determining the likelihood of having received said sample given a possible data sample sequence and given a sequence of prior received samples, said likelihood being p(r(k)|d i k ,L, r k-1 ) for each possible data subsequence, d i k ,L ; updating the probability that the sequence of data signals possibly received given the received samples including the presently received sample, said updated metric being P(d i k ,L |r k ); conditionally estimating updated channel coefficients corresponding to said communication channel for each possible data subsequence of possibly intersymbol interfering samples; unconditionally estimating channel coefficients for said communication channel for each next possible subsequence, d i k+1 ,L, for every possible intersymbol interfering received sample for the next received data sample; and receiving the next data sample, r(k+1), whereby data may be decoded notwithstanding intersymbol interference without the use of data preambles or training data.
Claim 17
Independent Claim
173 words
A method for communicating digital information in a communication channel subject to intersymbol interference by using blind equalization comprising the steps of receiving a sample r(k); determining the likelihood of having received said sample given a possible data sample sequence and given a sequence of prior received samples, said likelihood being p(r(k)|d i k ,L, r k-1 ) for each possible data subsequence, d i k ,L ; updating the probability that the sequence of data signals possibly received given the received samples including the presently received sample, said updated metric being P(d i k ,L |r k ); conditionally estimating updated channel coefficients corresponding to said communication channel for each possible data subsequence of possibly intersymbol interfering samples; unconditionally estimating channel coefficients for said communication channel for each next possible subsequence, d i k+1 ,L, for every possible intersymbol interfering received sample for the next received data sample; and receiving the next data sample, r(k+1), whereby data may be decoded notwithstanding intersymbol interference without the use of data preambles or training data.
Claim 18
Dependent Claim
111 words
The method of claim 15 where said step of updating said metric is performed for each possible data subsequence, d i k ,L, as modeled by the recursive equation: ##EQU15## where c is a normalization constant, p(r(k)|d i k ,L, r k-1 ) is the Gaussian distribution density, i,j and k are integer indices, i and j representing the number of a data sequence, and k the time interval of each symbol in each sequence, L is an integer representing the number of possibly interfering data symbols, and d i k ,L is a set {d i (k), d i (k-1), . . . , d i (k-L+1)} possible data subsequences.
Claim 19
Dependent Claim
139 words
(once amended) The method of claim 16 wherein said step of conditionally estimating said updated channel coefficients is performed for each possible data subsequence, d i k ,L, as modeled by the equation: ##EQU16## where i and k are integer indices, i representing the number of a data sequence, and k the time interval of each symbol in each sequence, L is an integer representing the number of possibly interfering data symbols, τ and f are estimated timing and channel coefficients respectively, K is a Kalman gain matrix, d i -(k) is the complex conjugate of a possible data symbol, r(k) is a received data symbol at time k, d i k ,L is a set {d i (k), d i (k-1), . . . , d i (k-L+1)} possible data subsequences, and r is an estimated data symbol.
Claim 20
Dependent Claim
166 words
(once amended) The method of claim 17 wherein said step of unconditionally estimating said channel coefficient is performed for each possible data subsequence, d i k ,L, as modeled by the equation: ##EQU17## where i, j, m and k are integer indices, i, m and j representing the number of a data sequence, and k the time interval of each symbol in each sequence, L is an integer representing the number of possibly interfering data symbols, and d i k ,L is an element of the set {d i (k), d i (k-1), . . . , d i (k-L+1)} of all possible data subsequences, and P(d i k ,L |r k ) is the likelihood of having received said data signal, r(k), given a possible transmitted data sequence, d i k ,L, and given all prior data signals received, r k-1 , for each possible data subsequence, d i k ,L and F is a matrix describing bandwidth channel coefficients set at an estimated value.
Claim 21
Dependent Claim
46 words
(once amended) The method of claim 15 further comprising the step of decoding said information from said sample r(fk) by selecting the oldest received data symbol from the most probable data subsequence when said oldest received data symbol can no longer be involved in intersymbol interference.
Claim 22
Dependent Claim
65 words
The method of claim 15 wherein said steps of updating the probability that the sequence of data signals possibly received given the received samples including the presently received sample, and said step of conditionally estimating updated channel coefficient corresponding to said communication channel for each possible data subsequence of possibly intersymbol interfering samples are simultaneously performed for each possible data subsequence, d i k ,L.
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-09-12 | 1998-03-14 | 1998-09-13 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-09-12 | 2002-03-14 | 2002-09-13 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-09-12 | 2006-03-14 | 2006-09-13 | $7700.00 | Window Closed / Lapsed |