专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US08670508B2 Method and system for a low-complexity soft-output MIMO detection 有权
标题翻译：低复杂度软输出MIMO检测的方法和系统
公开(公告)号：US08670508B2
公开(公告)日：2014-03-11
申请号：US13149743
申请日：2011-05-31
申请人： Dimpesh Patel , Mahdi Shabany , Glenn Gulak
发明人： Dimpesh Patel , Mahdi Shabany , Glenn Gulak
IPC分类号： H04L27/00
CPC分类号： H04B7/0456 , H04L25/03203
摘要： 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.
摘要翻译：用于软输出K-Best MIMO检测的方法包括计算用于发送位的估计符号向量和对数似然比（LLR）值。该方法包括相关的丢弃路径选择过程，最后一阶段按需扩展过程以及松弛的LLR计算过程。相关丢弃路径选择过程包括分析每个中间树级别的K-Best路径和丢弃路径，并且仅选择那些被丢弃的路径用于进一步处理，这将有助于至少一个发送位的LLR计算。最后阶段的按需扩展过程包括根据需要在树级别2NT-1（NT =发射天线的数量）上将K路径扩展到最后树级别2NT处的仅2K-1最小部分欧几里德距离（PED）路径。松弛的LLR计算方案包括通过假设丢弃的路径PED大于或等于K-最佳路径PED来近似LLR计算。

2. 发明申请

US20190278513A1 Data Transfer Method and Apparatus for Differential Data Granularities 审中-公开
公开(公告)号：US20190278513A1
公开(公告)日：2019-09-12
申请号：US16422827
申请日：2019-05-24
申请人： Shrinivas Venkatraman , Eng Hun Ooi , Sahar Khalili , Dimpesh Patel , Kuan Hua Tan
发明人： Shrinivas Venkatraman , Eng Hun Ooi , Sahar Khalili , Dimpesh Patel , Kuan Hua Tan
IPC分类号： G06F3/06 , G06F13/42
摘要： Apparatuses, storage media and methods associated with data transfer, are disclosed herein. In some embodiments, an apparatus for computing comprises: a commit generator and a media write generator. The commit generator is arranged to generate commit indicators correspondingly associated with media slices of a storage media to respectively denote to a storage media controller of the storage media whether to proceed with writing the media slices into the storage media. The media write generator is arranged provide data chunks of the media slices to be written into the storage media, and the associated commit indicators to the storage media controller. A size of each data chunk is smaller than a size of each media slice. Other embodiments are also described and claimed.

3. 发明申请

US20120134451A1 Method and System for a Low-Complexity Soft-Output MIMO Detection 有权
标题翻译：低复杂度软输出MIMO检测方法与系统
公开(公告)号：US20120134451A1
公开(公告)日：2012-05-31
申请号：US13149743
申请日：2011-05-31
申请人： Dimpesh Patel , Mahdi Shabany , Glenn Gulak
发明人： Dimpesh Patel , Mahdi Shabany , Glenn Gulak
IPC分类号： H04L27/00
CPC分类号： H04B7/0456 , H04L25/03203
摘要： 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.
摘要翻译：用于软输出K-Best MIMO检测的方法包括计算用于发送位的估计符号向量和对数似然比（LLR）值。该方法包括相关的丢弃路径选择过程，最后一阶段按需扩展过程以及松弛的LLR计算过程。相关丢弃路径选择过程包括分析每个中间树级别的K-Best路径和丢弃路径，并且仅选择那些被丢弃的路径用于进一步处理，这将有助于至少一个发送位的LLR计算。最后阶段的按需扩展过程包括根据需要在树级别2NT-1（NT =发射天线的数量）上将K路径扩展到最后树级别2NT处的仅2K-1最小部分欧几里德距离（PED）路径。松弛的LLR计算方案包括通过假设丢弃的路径PED大于或等于K-最佳路径PED来近似LLR计算。

4. 发明授权

US09318813B2 Signal processing block for a receiver in wireless communication 有权
标题翻译：用于无线通信中的接收机的信号处理块
公开(公告)号：US09318813B2
公开(公告)日：2016-04-19
申请号：US12786288
申请日：2010-05-24
申请人： Dimpesh Patel , Glenn Gulak , Mahdi Shabany
发明人： Dimpesh Patel , Glenn Gulak , Mahdi Shabany
IPC分类号： G06F17/16 , H01Q23/00 , H01Q21/28
CPC分类号： H01Q23/00 , G06F17/16 , H01Q21/28
摘要： A QRD processor for computing input signals in a receiver for wireless communication relies upon a combination of multi-dimensional Givens Rotations, Householder Reflections and conventional two-dimensional (2D) Givens Rotations, for computing the QRD of matrices. The proposed technique integrates the benefits of multi-dimensional annihilation capability of Householder reflections plus the low-complexity nature of the conventional 2D Givens rotations. Such integration increases throughput and reduces the hardware complexity, by first decreasing the number of rotation operations required and then by enabling their parallel execution. A pipelined architecture is presented (290) that uses un-rolled pipelined CORDIC processors (245a to 245d) iteratively to improve throughput and resource utilization, while reducing the gate count.
摘要翻译：用于在无线通信的接收机中计算输入信号的QRD处理器依赖于多维Givens旋转，Householder反射和常规二维（2D）Givens旋转的组合，用于计算矩阵的QRD。所提出的技术整合了众议院反思的多维湮灭能力的好处加上常规2D Givens旋转的低复杂度性质。这种集成通过首先减少所需的旋转操作数量，然后通过使其并行执行来增加吞吐量并降低硬件复杂性。提出了一种流水线架构（290），它可以迭代地使用未压缩的流水线CORDIC处理器（245a到245d）来提高吞吐量和资源利用率，同时减少门数。

5. 发明申请

US20110264721A1 SIGNAL PROCESSING BLOCK FOR A RECEIVER IN WIRELESS COMMUNICATION 有权
标题翻译：无线通信接收机的信号处理块
公开(公告)号：US20110264721A1
公开(公告)日：2011-10-27
申请号：US12786288
申请日：2010-05-24
申请人： Dimpesh Patel , Glenn Gulak , Mahdi Shabany
发明人： Dimpesh Patel , Glenn Gulak , Mahdi Shabany
IPC分类号： G06F17/16 , G06F5/01
CPC分类号： H01Q23/00 , G06F17/16 , H01Q21/28
摘要： A QRD processor for computing input signals in a receiver for wireless communication relies upon a combination of multi-dimensional Givens Rotations, Householder Reflections and conventional two-dimensional (2D) Givens Rotations, for computing the QRD of matrices. The proposed technique integrates the benefits of multi-dimensional annihilation capability of Householder reflections plus the low-complexity nature of the conventional 2D Givens rotations. Such integration increases throughput and reduces the hardware complexity, by first decreasing the number of rotation operations required and then by enabling their parallel execution. A pipelined architecture is presented (290) that uses un-rolled pipelined CORDIC processors (245a to 245d) iteratively to improve throughput and resource utilization, while reducing the gate count.
摘要翻译：用于在无线通信的接收机中计算输入信号的QRD处理器依赖于多维Givens旋转，Householder反射和常规二维（2D）Givens旋转的组合，用于计算矩阵的QRD。所提出的技术整合了众议院反思的多维湮灭能力的好处加上常规2D Givens旋转的低复杂度性质。这种集成通过首先减少所需的旋转操作数量，然后通过使其并行执行来增加吞吐量并降低硬件复杂性。提出了一种流水线架构（290），它可以迭代地使用未压缩的流水线CORDIC处理器（245a到245d）来提高吞吐量和资源利用率，同时减少门数。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式