Lower complexity computation of lattice reduction

Details Lower complexity computation of lattice reduction Lower complexity computation of lattice reduction

2006-05-22

2010-02-23

Tran, Khanh C (Department: 2611)

Pulse or digital communications

Receivers

Interference or noise reduction

Reexamination Certificate

active

07668268

ABSTRACT:
A signal vector is received over a plurality of channels. A channel matrix H is determined that represents at least one of the plurality of channels. An iterative algorithm such as Lenstra-Lenstra-Lovasz is used to determining a change of basis matrix T that when multiplied with the channel matrix H converges to a matrix H*T that is more orthogonal than the channel matrix H. In one aspect the iterative algorithm is upwardly bounded in the number of iterations (e.g., 20 or 30 iterations) that it may perform for any specific channel realization to determine the change of basis matrix T. In another aspect the algorithm is initiated with a matrix derived from a previously determined change of basis matrix. Both aspects may be combined in a single method or device, or either employed separately.

REFERENCES:
patent: 6724843 (2004-04-01), Clarkson et al.
patent: 2005/0175122 (2005-08-01), Nefedov et al.
patent: 2005/0281350 (2005-12-01), Chae et al.
patent: 2006/0176971 (2006-08-01), Nissani (Nissensohn)
patent: 2006/0245513 (2006-11-01), Koo et al.
patent: 2006/0256888 (2006-11-01), Nissani (Nissensohn)
patent: 2007/0230628 (2007-10-01), You et al.
patent: 2429884 (2007-03-01), None
Wen, Xue Wen et al., “LLL Lattice Reduction-Based Detection of Joint VBLAST and SFBC in MIMO/OFDM Systems”, International Conference on May 27-30, 2005, pp. 194-198, vol. 1, Communications, Circuits and Systems.
“Factoring Polynomials with Rational Coefficients”, A.K. Lenstra et al., Math Ann 261, 1982, pp. 515-534.
“MMSE-Based Lattice-Reduction for Near-ML Detection of MIMO Systems”, Dirk Wiibben et al., IEEE 2004, pp. 106-113.
“Near-Maximum-Likelihood Detection of MIMO Systems using MMSE-Based Lattice-Reduction”, Dirk Wiibben, et al., EEE Communications Society, 2004, pp. 798-802.
“Closest Point Search in Lattices”, Erik Agrell, et al., IEEE 2002, pp. 2201-2214.
“On Maximum-Likelihood Detection and the Search for the Closest Lattice Point”, Mohamed Oussama Damen, et al., IEEE 2003, pp. 2389-2402.
“Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems”, C.P. Schnorr et al., Universitat Frankfurt, Jul. 1993, pp. 1-27.
“Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis”, U. Fincke et al., Mathematics of Computation, vol. 44, No. 170, Apr. 1985, pp. 463-471.

Affiliated with

Also associated with

Rating

Lower complexity computation of lattice reduction does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Lower complexity computation of lattice reduction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lower complexity computation of lattice reduction will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4213126