Delayed branch decision in quadrature decomposition with M-searchtng
A technology of orthogonal decomposition and branch, applied in the direction of shaping network, baseband system, digital transmission system, etc. in the transmitter/receiver, which can solve the problem of not achieving the best performance.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0017] An exemplary embodiment of the present invention, a QRD-M search algorithm with branch delay decision and its complexity and link analysis is disclosed herein. It can be seen that the current preferred scheme can significantly improve the system performance compared to the conventional scheme which keeps the same number of branches (M value) in the search. Using high-order modulation (such as 16QAM) and a relatively larger value of M (such as 8), the improved scheme with M of 4 has approximately the same performance as the conventional scheme with M of 8, but the complexity can be halved.
[0018] The present invention can be implemented in MIMO OFDM type communication such as communication most suitable for MIMO Long Term Evolution (LTE) / WiMAX / ... and the like. There is a sliding window for QRD-M detectors to jointly make final decisions within multiple layers. The invention can be implemented in and implemented by a MIMO receiver.
[0019] A MIMO-OFDM communication ...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More - R&D
- Intellectual Property
- Life Sciences
- Materials
- Tech Scout
- Unparalleled Data Quality
- Higher Quality Content
- 60% Fewer Hallucinations
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com
