Invention Grant
US08503584B2 Efficient implementation of M-algorithm based on QR decomposition for higher-order constellations
有权
基于QR分解的高阶星座的M-algorithm的有效实现
- Patent Title: Efficient implementation of M-algorithm based on QR decomposition for higher-order constellations
- Patent Title (中): 基于QR分解的高阶星座的M-algorithm的有效实现
-
Application No.: US12974039Application Date: 2010-12-21
-
Publication No.: US08503584B2Publication Date: 2013-08-06
- Inventor: Gennady Zilberman , Eliahou Arviv , Daniel Briker , Gil Naveh , Moshe Bukris
- Applicant: Gennady Zilberman , Eliahou Arviv , Daniel Briker , Gil Naveh , Moshe Bukris
- Applicant Address: US CA San Jose
- Assignee: LSI Corporation
- Current Assignee: LSI Corporation
- Current Assignee Address: US CA San Jose
- Agency: Otterstedt, Ellenbogen & Kammer, LLP
- Main IPC: H04L27/06
- IPC: H04L27/06

Abstract:
A method of detecting received data in a communication system includes the steps of: performing a QR decomposition on a received input vector as a function of one or more characteristics of a communication channel over which the input vector was transmitted; generating a subset of best symbol candidates from a symbol constellation by comparing an input sample (corresponding to an element of the input vector) with one or more prescribed thresholds; identifying at least one symbol satisfying prescribed minimum Euclidian distance criteria among multiple ambiguity symbols in the subset of best symbol candidates; and generating a subset of best symbols including a prescribed number of symbols from the symbol constellation determined to be closest to the input sample. The subset of best symbols is used in a subsequent iteration of the steps of generating the subset of best symbol candidates and identifying at least one symbol satisfying the prescribed minimum Euclidian distance criteria.
Public/Granted literature
- US20120155579A1 Efficient Implementation of M-Algorithm Based on QR Decomposition for Higher-Order Constellations Public/Granted day:2012-06-21
Information query