公开(公告)号：US09337911B2

公开(公告)日：2016-05-10

申请号：US14158546

申请日：2014-01-17

Applicant: MaxLinear, Inc.

Inventor： Dimpesh Patel ,  Mahdi Shabany ,  Glenn Gulak

IPC: H04B7/04 ,  H04L25/03

CPC classification number: H04B7/0456 ,  H04L25/03203

Abstract: An approach for Soft-output K-Best MIMO detection comprises computing an estimated symbol vector and Log-Likelihood Ratio (LLR) values for transmitted bits. The approach includes a relevant discarded paths selection process, a last-stage on-demand expansion process, and a relaxed LLR computation process. The relevant discarded paths selection process includes analyzing the K-Best paths and discarded paths at each intermediate tree level and selecting only those discarded paths for further processing that will help in LLR computation for at least one of the transmitted bits. The last-stage on-demand expansion process includes expanding K paths at the tree level 2NT−1 (NT=number of transmit antennas) on-demand to only 2K−1 lowest Partial Euclidean Distance (PED) paths at last tree level 2NT. The relaxed LLR computation scheme includes approximating LLR computations by assuming that discarded path PED is greater than or equal K-Best path PED.

Abstract translation: 用于软输出K-Best MIMO检测的方法包括计算用于发送位的估计符号向量和对数似然比（LLR）值。 该方法包括相关的丢弃路径选择过程，最后一阶段按需扩展过程以及松弛的LLR计算过程。 相关丢弃路径选择过程包括分析每个中间树级别的K-Best路径和丢弃路径，并且仅选择那些被丢弃的路径用于进一步处理，这将有助于至少一个发送位的LLR计算。 最后阶段的按需扩展过程包括根据需要在树级别2NT-1（NT =发射天线的数量）上将K路径扩展到最后树级别2NT处的仅2K-1最小部分欧几里德距离（PED）路径。 松弛的LLR计算方案包括通过假设丢弃的路径PED大于或等于K-最佳路径PED来近似LLR计算。