Array processing using an aggregate channel matrix generated...

Pulse or digital communications – Systems using alternating or pulsating current

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C375S267000, C375S347000, C375S348000

Reexamination Certificate

active

10428603

ABSTRACT:
A method includes generating a received signal vector from a signal received over a channel. The received signal vector includes a plurality of symbols encoded in accordance with a block code having a structure. A channel matrix estimated for the channel is transformed based on the structure of the block code to generate an aggregate channel matrix. The symbols are processed using the aggregate channel matrix. A system includes a front end unit configured to generate the received signal vector, a channel estimation unit configured to estimate the channel matrix, and a processing unit configured to generate the aggregate channel matrix and process the symbols using the aggregate channel matrix.

REFERENCES:
patent: 6865237 (2005-03-01), Boariu et al.
patent: 2001/0017903 (2001-08-01), Naguib et al.
patent: 2003/0026349 (2003-02-01), Onggosanusi et al.
patent: 2003/0103584 (2003-06-01), Bjerke et al.
Siavash M. Almouti, “A Simple Transmit Diversity Technique for Wireless Communications,”IEEE Journal on Select Areas in Communications, vol. 16, No. 8, pp. 1451-1458 (Oct. 1998).
Hamid Jafarkhani, “A Quasi-Orthogonal Space-Time Block Code,”IEEE WIreless Communications and Networking Conference. Conference Record, vol. 1, pp. 42-45 (2000).
Olav Tirkkonen et al., “Complex Space-Time Block Codes for Four Tx Antennas,”Globecom '00, IEEE Global Telecommunications Conference, vol. 2, pp. 1005-1009 (2000).
Olav Tirkkonen et al., “Minimal Non-Orthogonality Rate 1 Space-Time Block Code for 3+ Tx Antennas,”IEEE 6thInt. Symp. On Spread-Spectrum Tech.&Appli., NJIT pp. 429-432 (Sep. 6-8, 2000).
Olav Tirkkonen et al., “Square-Matrix Embeddable Space-Time Block Codes for Complex Signal Constellations,”IEEE Transactions on Information Theory, vol. 48, No. 2, pp. 384-395 (Feb. 2002).
Vahid Tarokh et al., “Space-Time Block Codes from Orthogonal Designs,”IEEE Transactions on Information Theory, vol. 45, No. 5, pp. 1456-1467 (Jul. 1999).
Vahid Tarokh et al., “Combined Array Processing and Space-Time Coding,”IEEE Transactions on Information Theory, vol. 45, No. 4, pp. 1121-1128 (May 1999).
Vahid Tarokh et al., “Space-Time Codes for High Data Rate Wireless Communication: Performance Criterion and Code Construction,”IEEE Transactions on Information Theory, vol. 44, No. 2, pp. 744-765 (Mar. 1998).
P.W. Wolniansky et al., “V-BLAST: An Architecture for Realizing Very High Data Rates Over the Rich-Scattering Wireless Channel,”IEEE, pp. 295-300 (1998).
I. Emre Telatar, “Capacity of Multi-antenna Gaussian Channels,”AT&T Bell Labs,Internal Tech. Memo, Jun. 1995.
G. J. Foschini, “Layered Space-Time Architecture For Wireless Communication In A Fading Environment When Using Multi-Element Antennas,”Bell Labs Technical Journal, 1996.
Gerard J. Foschini et al., “Simplified Processing for High Spectral Efficiency Wireless Communication Employing Multi-Element Arrays,”IEEE Journal on Selected Areas in Communications, vol. 17, No. 11, pp. 1841-1852 (Nov. 1999).

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

Array processing using an aggregate channel matrix generated... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Array processing using an aggregate channel matrix generated..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Array processing using an aggregate channel matrix generated... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3917505

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