Efficient reduced complexity windowed optimal time domain...

Pulse or digital communications – Receivers – Interference or noise reduction

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C375S285000, C375S350000, C375S232000

Reexamination Certificate

active

11405860

ABSTRACT:
An algorithm for computing an efficient, reduced complexity, windowed optimal linear time domain equalizer for a dispersive channel comprises the steps of determining a window of maximum energy in the impulse response of length equal to or less than a number of cyclic prefix samples associated with a received digital data signal, computing the corresponding inside and outside matrices, performing an inverse Cholesky decomposition of the inside matrix, creating a resultant matrix as the product of the outer and the upper and lower square root inner matrix, followed by Householder reduction and QL transformation to thereby compute the time domain equalizer as the linear transformation of the eigenvector corresponding to the smallest eigenvalue at the receiver. The smallest eigenvalue is determined using the aforementioned orthogonal transformations without determining all the eigenvalues efficiently but without the loss accuracy associated with iterative methods like the conventional power method. The algorithm may be most conveniently implemented, for example, in the form of a thirty-two bit digital signal processor at a data receiver.

REFERENCES:
patent: 5117291 (1992-05-01), Fadavi-Ardekani et al.
patent: 5228058 (1993-07-01), Ushirokawa et al.
patent: 5461640 (1995-10-01), Gatherer
patent: 5471504 (1995-11-01), Lee et al.
patent: 5621768 (1997-04-01), Lechleider
patent: 6396886 (2002-05-01), Kapoor
patent: 6404806 (2002-06-01), Ginesi et al.
patent: 6408022 (2002-06-01), Fertner
patent: 6650716 (2003-11-01), Ratnarajah
patent: 6671313 (2003-12-01), Rached et al.
patent: 6724849 (2004-04-01), Long et al.
patent: 6778618 (2004-08-01), Celebi
patent: 6904107 (2005-06-01), Rached et al.
patent: 6907270 (2005-06-01), Blanz
patent: 7027536 (2006-04-01), Al-Dhahir
patent: 2002/0181549 (2002-12-01), Linnartz et al.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Efficient reduced complexity windowed optimal time domain... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Efficient reduced complexity windowed optimal time domain..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient reduced complexity windowed optimal time domain... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3878278

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.