Pulse or digital communications – Systems using alternating or pulsating current – Plural channels for transmission of a single pulse train
Reexamination Certificate
2007-02-12
2010-11-30
Corrielus, Jean B (Department: 2611)
Pulse or digital communications
Systems using alternating or pulsating current
Plural channels for transmission of a single pulse train
C375S340000
Reexamination Certificate
active
07844008
ABSTRACT:
A QRD-M decomposition includes a first and a sequential second stage, at least. In the first stage, M branches are selected from among more than M branches entering the first stage as survive branches from which multiple decompositions are calculated. In the second stage, more than M branches are selected from among those branches entering the second stage as survive branches from which multiple decompositions are calculated. The symbol of the received signal is decided from a branch that is a survive branch of both the first and second stages. The second stage may be within a window that may include additional stages at which the pruning decision down to M survive branches is delayed. One or more windows may be used in a single QRD-M decomposition. In an embodiment, all branches entering the second stage are survive branches. It is shown that the marginal increased computational load increases accuracy.
REFERENCES:
patent: 6597743 (2003-07-01), Khayrallah et al.
patent: 7380199 (2008-05-01), Haratsch
patent: 2007/0189424 (2007-08-01), Haratsch
patent: 2007/0268980 (2007-11-01), Brannstorm et al.
patent: 2008/0075022 (2008-03-01), Lei et al.
Thornben Detert: “An Efficient Fixed Complexity QRD-M Algorithm for MIMO-OFDM using Per-Survivor Slicing”, 4thIEEE International Symposium on Wireless Communication Systems 2007, Oct. 16-19, 2007, pp. 572-576, XP031166834 IEEE, Piscataway, NJ, ISBN: 978-1-4244-0978-5.
Shengchao Li et al.: “Finite delay maximum snr breadth-first equalizer”, IEEE 56th, Vehicular Technology Conference Proceedings, Vancouver, Canada, Sep. 24-28, 2002, vol. 1, pp. 529-533, XP010608613 IEEE, New York, NY, ISBN: 978-0-7803-7467-6, the whole documents.
Kawai, H. et al., “Independent Adaptive Control of Surviving Symbol Replica Candidates at Each Stage Based on Minimum Branch Metric in QRM-MLD for OFCDM MIMO Multiplexing”, 2004 IEEE, pp. 1558-1564.
Dai, Y. et al., “A Comparative Study of QRD-M Detection and Sphere Decoding for MIMO-OFDM Systems”, 2005 IEEE 16thInternational Symposium on Personal, Indoor and Mobile Radio Communications, pp. 186-190.
Kim, K. et al., “A QRD-M/Kalman Filter-Based Detection and Channel Estimation Algorithm for MIMO-OFDM Systems”, IEEE Transactions on Wireless Communications, vol. 4, No. 2, Mar. 2005, pp. 710-721.
Chin, W. H., “QRD Based Tree Search Data Detection for MIMO Communication Systems”, 2005 IEEE, 4 pages.
Guo, Y. et al., “Reduced QRD-M Detector in MIMO-OFDM Systems With Partial and Embedded Sorting”, 2005 IEEE Globecom, pp. 187-192.
Yue, J. et al., “Channel Estimation and Data Detection for MIMO-OFDM Systems”, 2003 IEEE Globecom, pp. 581-585.
Wolniansky, P. W. et al., “V-Blast: An Architecutre for Realizing Very High Data Rates Over the Rich-Scattering Wireless Channel”, IEEE 1998, pp. 295-300.
Chen Ming
Cheng Shixin
Li Wei
Lilleberg Jorma
Wang Haifeng
Corrielus Jean B
Harrington & Smith
Nokia Corporation
LandOfFree
Delayed branch decision in quadrature decomposition with... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Delayed branch decision in quadrature decomposition with..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Delayed branch decision in quadrature decomposition with... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4251803