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

1. 发明申请

WO2009065014A1 MINIMUM FINGER LOW-POWER DEMODULATOR FOR WIRELESS COMMUNICATION 审中-公开
标题翻译：用于无线通信的最小手指低功率解调器
公开(公告)号：WO2009065014A1
公开(公告)日：2009-05-22
申请号：PCT/US2008/083596
申请日：2008-11-14
申请人： QUALCOMM Incorporated , HOWARD, Michael, Alexander , NAMGOONG, June , PAN, Hanfang
发明人： HOWARD, Michael, Alexander , NAMGOONG, June , PAN, Hanfang
IPC分类号： H04B1/707
CPC分类号： H04B1/7117
摘要： Techniques for assigning multipaths to finger processors to achieve the desired data performance and low power consumption are described. A search is initially performed to obtain a set of multipaths for a transmission from at least one base station. At least one multipath (e.g., the minimum number of multipaths) having a combined performance metric (e.g., a combined SNR) exceeding a threshold is identified. The at least one multipath is assigned to, and processed by, at least one finger processor to recover the transmission from the base station(s).
摘要翻译：描述了将多路径分配给指状处理器以实现期望的数据性能和低功耗的技术。最初执行搜索以获得用于来自至少一个基站的传输的一组多路径。识别具有超过阈值的组合性能度量（例如，组合SNR）的至少一个多路径（例如，最小数量的多路径）。至少一个多路径被分配给至少一个手指处理器并由其处理，以恢复来自基站的传输。

2. 发明申请

WO2011143305A1 SCALABLE SCHEDULER ARCHITECTURE FOR CHANNEL DECODING 审中-公开
标题翻译：用于信道解码的可调度调度器架构
公开(公告)号：WO2011143305A1
公开(公告)日：2011-11-17
申请号：PCT/US2011/036059
申请日：2011-05-11
申请人： QUALCOMM Incorporated , CHANG, Wei-Hsin , PAN, Hanfang , HOWARD, Michael Alexander , WU, Wenqing , FUCHS, Robert Jason
发明人： CHANG, Wei-Hsin , PAN, Hanfang , HOWARD, Michael Alexander , WU, Wenqing , FUCHS, Robert Jason
IPC分类号： H04L1/00
CPC分类号： H04L1/0052
摘要： Certain aspects of the present disclosure relate to a method for processing wireless communications. According to one aspect, a processing unit may receive a plurality of code blocks of a transport block and schedule the plurality of code blocks to be decoded in parallel with a plurality of decoders. Each decoder decodes at least one code block as an independent tasks. The processing unit further collects the decoded information bits from the plurality of decoders and forwards the collected decoded information bits for further processing. In one aspect, the processing unit includes an output agent to temporarily store the decoded information bits while waiting for all code blocks of the transport block to be decoded.
摘要翻译：本公开的某些方面涉及一种用于处理无线通信的方法。根据一个方面，处理单元可以接收传输块的多个码块，并且与多个解码器并行地调度要解码的多个码块。至少一个解码器解码至少一个代码块作为独立任务。处理单元进一步从多个解码器中收集解码的信息比特，并且转发所收集的解码信息比特用于进一步处理。一方面，处理单元包括一个输出代理，用于临时存储解码的信息位，同时等待传输块的所有代码块被解码。

3. 发明申请

WO2011075698A1 METHOD AND APPARATUS FOR UNIFIED CHANNEL ESTIMATION FOR WIRELESS COMMUNICATION 审中-公开
标题翻译：用于无线通信的统一通道估计的方法和装置
公开(公告)号：WO2011075698A1
公开(公告)日：2011-06-23
申请号：PCT/US2010/061142
申请日：2010-12-17
申请人： QUALCOMM INCORPORATED , YOO, Taesang , LUO, Tao , WEI, Yongbin , PAN, Hanfang , HOWARD, Michael, A.
发明人： YOO, Taesang , LUO, Tao , WEI, Yongbin , PAN, Hanfang , HOWARD, Michael, A.
IPC分类号： H04L25/02 , H04B1/10
CPC分类号： H04L25/0224 , H04L5/0007
摘要： Certain aspects of the disclosure propose a unified channel estimation algorithm that combines two or more channel estimation algorithms in a single piece of hardware or software. The proposed unified channel estimation may dynamically switch, based on one or more metrics, between different modes of operation that utilize different channel estimation algorithms.
摘要翻译：本公开的某些方面提出了将单个硬件或软件中的两个或多个信道估计算法组合的统一信道估计算法。所提出的统一信道估计可以基于利用不同信道估计算法的不同操作模式之间的一个或多个度量动态地切换。

4. 发明申请

WO2005086358A1 EFFICIENT MULTI-SYMBOL DEINTERLEAVER 审中-公开
标题翻译：有效的多符号检测器
公开(公告)号：WO2005086358A1
公开(公告)日：2005-09-15
申请号：PCT/US2005/006635
申请日：2005-02-25
申请人： QUALCOMM INCORPORATED , PAN, Hanfang , KANG, Inyup , KRYSL, James
发明人： PAN, Hanfang , KANG, Inyup , KRYSL, James
IPC分类号： H03M13/27
CPC分类号： H03M13/2764 , H03M13/2703
摘要： Embodiments disclosed herein address the need in the art for an efficient multi-symbol deinterleaver. In one aspect, a plurality of memory banks are deployed to receive and simultaneously store a plurality of values, such as soft decision values determined from a modulation constellation, in accordance with a storing pattern. In another aspect, the storing pattern comprises a plurality of cycles, a selected subset of the plurality of memory banks and an address offset for use in determining the address for storing into the respective memory banks indicated for each cycle. In yet another aspect, the stored values may be accessed in order with a sequentially increasing index, such as an address. Various other aspects are also presented. These aspects have the benefit of allowing multiple symbol values to be deinterleaved in an efficient manner, thus meeting computation time constraints, and conserving power.
摘要翻译：本文公开的实施例解决了本领域对于有效的多符号解交织器的需要。在一个方面，多个存储体被部署以根据存储模式来接收并同时存储多个值，诸如从调制星座确定的软判决值。在另一方面，存储模式包括多个周期，多个存储体的选定子集和用于确定用于存储到为每个周期指示的相应存储体中的地址的地址偏移。在另一方面，可以按顺序增加的索引（诸如地址）按顺序访问所存储的值。还提出了各种其他方面。这些方面具有允许以有效的方式解码多个符号值的好处，从而满足计算时间限制并节省功率。

5. 发明申请

WO2011059813A2 APP (A PRIORI PROBABILITY) STORAGE DESIGN FOR LTE TURBO DECODER WITH QUADRATIC PERMUTATION POLYNOMIAL INTERLEAVER 审中-公开
标题翻译：适用于LTE TURBO解码器的应用（PRIORI PROBABILITY）存储设计
公开(公告)号：WO2011059813A2
公开(公告)日：2011-05-19
申请号：PCT/US2010/054703
申请日：2010-10-29
申请人： QUALCOMM Incorporated , PAN, Hanfang , WEI, Yongbin
发明人： PAN, Hanfang , WEI, Yongbin
IPC分类号： H03M13/05 , G06F12/02 , G06F11/10
CPC分类号： H04L1/0055 , H04L1/0052 , H04L1/0071
摘要： Systems and methodologies are described that facilitate ensuring contention and/or collision free memory within a turbo decoder. A Posteriori Probability (APP) Random Access Memory (RAM) can be segmented or partitioned into two or more files with an interleaving sub-group within each file. This enables parallel operation in a turbo decoder and allows a turbo decoder to access multiple files simultaneously without memory access contention.
摘要翻译：描述了有助于确保turbo解码器内争用和/或无冲突的存储器的系统和方法。后验概率（APP）随机存取存储器（RAM）可以被分割或分割成两个或多个文件与每个文件内的交织子组。这使得能够在turbo解码器中并行操作，并且允许turbo解码器同时访问多个文件而没有存储器访问争用。

6. 发明申请

WO2011041592A3 RECURSIVE REALIZATION OF POLYNOMIAL PERMUTATION INTERLEAVING 审中-公开
公开(公告)号：WO2011041592A3
公开(公告)日：2011-04-07
申请号：PCT/US2010/050979
申请日：2010-09-30
申请人： QUALCOMM INCORPORATED , PAN, Hanfang , HOWARD, Michael, A. , WEI, Yongbin , KONGELF, Michael, A.
发明人： PAN, Hanfang , HOWARD, Michael, A. , WEI, Yongbin , KONGELF, Michael, A.
IPC分类号： H04L1/00 , H03M13/27
摘要： Systems and methodologies are described that facilitate automatically generating interleaved addresses based on quadratic permution polynomials (QPP) during turbo decoding. An efficient recursive technique can be employed in which layers of nested loops enable the computation of a polynomial f(x) = (ax + bx2) mod N and a modular function given interleaved parameters "a" and "b" from a look up table. With the recursive technique, interleaved addresses can be generated, one interleaved address per clock cycle which can maintain turbo decoding performance.

7. 发明申请

WO2011041592A2 RECURSIVE REALIZATION OF POLYNOMIAL PERMUTATION INTERLEAVING 审中-公开
标题翻译：多元实时交互的实现
公开(公告)号：WO2011041592A2
公开(公告)日：2011-04-07
申请号：PCT/US2010050979
申请日：2010-09-30
申请人： QUALCOMM INC , PAN HANFANG , HOWARD MICHAEL A , WEI YONGBIN , KONGELF MICHAEL A
发明人： PAN HANFANG , HOWARD MICHAEL A , WEI YONGBIN , KONGELF MICHAEL A
IPC分类号： H04L1/00
CPC分类号： H03M13/2775 , H03M13/2739 , H03M13/2764 , H03M13/6502 , H03M13/6505 , H03M13/6525
摘要： Systems and methodologies are described that facilitate automatically generating interleaved addresses during turbo decoding. An efficient recursive technique can be employed in which layers of nested loops enable the computation of a polynomial and a modular function given interleaved parameters "a" and "b" from a look up table. With the recursive technique, interleaved addresses can be generated, one interleaved address per clock cycle which can maintain turbo decoding performance.
摘要翻译：描述了在turbo解码期间促进自动生成交织地址的系统和方法。可以采用一种有效的递归技术，其中嵌套循环层能够计算多项式和给出来自查询表的交织参数“a”和“b”的模块化函数。使用递归技术，可以生成交织地址，每个时钟周期的一个交错地址，可以保持turbo解码性能。

8. 发明申请

WO2011143259A1 METHOD AND APPARATUS FOR PARALLEL DE-INTERLEAVING OF LTE INTERLEAVED DATA 审中-公开
标题翻译：用于LTE交互数据并行去交织的方法和装置
公开(公告)号：WO2011143259A1
公开(公告)日：2011-11-17
申请号：PCT/US2011/035978
申请日：2011-05-10
申请人： QUALCOMM Incorporated , WU, Wenqing , PAN, Hanfang , HOWARD, Michael A.
发明人： WU, Wenqing , PAN, Hanfang , HOWARD, Michael A.
IPC分类号： H03M13/27
CPC分类号： H03M13/2775 , H03M13/2739 , H03M13/275 , H03M13/6525 , H03M13/6566
摘要： A wireless communication signal in Long Term Evolution (LTE) may be interleaved in a manner which permits a partitioning of a received inter-column bit- reversed interleaved code block for improved de-interleaving. The code block may be divided into equal subportions which may be simultaneously de-interleaved both forward and backward, and in parallel with other subportions. An even number of subportions may be provided. Dividing a received code block in this manner may improve de-interleaving performance.
摘要翻译：长期演进（LTE）中的无线通信信号可以以允许对接收到的列间比特反转交织码块进行分区以改进解交织的方式进行交织。码块可以被划分成相等的子部分，其可以同时前向和后向解交织，并且与其他子部分并行。可以提供偶数个子部分。以这种方式分割接收到的码块可以提高去交织性能。

9. 发明申请

WO2011127007A1 EFFICIENT ZADOFF-CHU SEQUENCE GENERATION 审中-公开
标题翻译：有效的ZADOFF-CHU序列生成
公开(公告)号：WO2011127007A1
公开(公告)日：2011-10-13
申请号：PCT/US2011/031166
申请日：2011-04-05
申请人： QUALCOMM Incorporated , GAAL, Peter , FUCHS, Robert J. , WEI, Yongbin , LIU, Ke , PAN, Hanfang , MALLADI, Durga Prasad , MACEK, Daniel T.
发明人： GAAL, Peter , FUCHS, Robert J. , WEI, Yongbin , LIU, Ke , PAN, Hanfang , MALLADI, Durga Prasad , MACEK, Daniel T.
IPC分类号： H04J13/00 , H04J13/14
CPC分类号： H04J13/0059 , H04J13/14
摘要： Efficient apparatus and method for Zadoff-Chu ("Chu") sequence generation avoids additional processing and hardware complexity of conventional quadratic generating formula followed by Discrete Fourier Transform (DFT) with a reference signal generator that produces both a Zadoff-Chu sequence and its DFT. In the wireless communication system (e.g., Long Term Evolution (LTE) system), Chu sequences are extensively used, especially in the uplink (UL). Because of the single carrier operating mode, transmitting a Chu sequence in principle involves a succession of generating that sequence, performing a DFT operation and then an IFFT operation. Assuming that the sequence length is N, the initial sequence generation requires 2N multiplications and the DFT requires more than Nlog2(N) multiplications. Given the frequent processing of Chu sequences, this would represent a complexity burden. The invention makes it possible to perform the sequence generation and DFT steps without any multiplication operation, except for possibly calculating certain initial parameters.
摘要翻译：用于Zadoff-Chu（“Chu”）序列生成的高效装置和方法避免了传统二次生成公式的附加处理和硬件复杂性，随后是具有产生Zadoff-Chu序列及其DFT的参考信号发生器的离散傅里叶变换（DFT）。在无线通信系统（例如，长期演进（Long Term Evolution，LTE）系统）中，尤其在上行链路（UL）中广泛使用了Chu序列。由于单载波操作模式，原则上发送Chu序列涉及一系列生成该序列，执行DFT操作，然后进行IFFT操作。假设序列长度为N，则初始序列生成需要2N次乘法，并且DFT需要多于Nlog2（N）个乘法。鉴于Chu序列的频繁处理，这将代表一个复杂的负担。除了可能计算某些初始参数之外，本发明使得可以执行没有任何乘法运算的序列生成和DFT步骤。

10. 发明申请

WO2011059813A3 CONTENTION-FREE STORAGE DESIGN FOR LTE TURBO DECODER WITH QUADRATIC PERMUTATION POLYNOMIAL INTERLEAVER 审中-公开
标题翻译： LTE TURBO解码器的无连续存储设计，具有四元制多边形交织
公开(公告)号：WO2011059813A3
公开(公告)日：2011-07-21
申请号：PCT/US2010054703
申请日：2010-10-29
申请人： QUALCOMM INC , PAN HANFANG , WEI YONGBIN
发明人： PAN HANFANG , WEI YONGBIN
IPC分类号： H04L1/00
CPC分类号： H04L1/0055 , H04L1/0052 , H04L1/0071
摘要： Systems and methodologies are described that facilitate ensuring contention and/or collision free memory within a turbo decoder. A Posteriori Probability (APP) Random Access Memory (RAM) can be segmented or partitioned into two or more files with an interleaving sub-group within each file. This enables parallel operation in a turbo decoder and allows a turbo decoder to access multiple files simultaneously without memory access contention.
摘要翻译：描述了有助于确保turbo解码器内争用和/或无冲突的存储器的系统和方法。后验概率（APP）随机存取存储器（RAM）可以被分割或分割成两个或多个文件与每个文件内的交织子组。这使得能够在turbo解码器中并行操作，并且允许turbo解码器同时访问多个文件而没有存储器访问争用。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式