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

1. 发明申请

US20110075615A1 RECURSIVE REALIZATION OF POLYNOMIAL PERMUTATION INTERLEAVING 有权
标题翻译：多元实时交互的实现
公开(公告)号：US20110075615A1
公开(公告)日：2011-03-31
申请号：US12571319
申请日：2009-09-30
申请人： Hanfang Pan , Michael A. Howard , Yongbin Wei , Michael A. Kongelf
发明人： Hanfang Pan , Michael A. Howard , Yongbin Wei , Michael A. Kongelf
IPC分类号： H04W4/00 , G06F1/16
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解码性能。

2. 发明授权

US08397123B2 Recursive realization of polynomial permutation interleaving 有权
标题翻译：递归实现多项式置换交织
公开(公告)号：US08397123B2
公开(公告)日：2013-03-12
申请号：US12571319
申请日：2009-09-30
申请人： Hanfang Pan , Michael A. Howard , Yongbin Wei , Michael A. Kongelf
发明人： Hanfang Pan , Michael A. Howard , Yongbin Wei , Michael A. Kongelf
IPC分类号： H03M13/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解码性能。

3. 发明申请

US20110194430A1 METHOD AND APPARATUS FOR UNIFIED CHANNEL ESTIMATION FOR WIRELESS COMMUNICATION 审中-公开
标题翻译：用于无线通信的统一通道估计的方法和装置
公开(公告)号：US20110194430A1
公开(公告)日：2011-08-11
申请号：US12968674
申请日：2010-12-15
申请人： Taesang Yoo , Tao Luo , Yongbin Wei , Hanfang Pan , Michael A. Howard
发明人： Taesang Yoo , Tao Luo , Yongbin Wei , Hanfang Pan , Michael A. Howard
IPC分类号： H04W24/00
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. 发明申请

US20110143672A1 METHOD AND SYSTEMS FOR PARALLEL CHANNEL ESTIMATION AND INTERFERENCE CANCELLATION 审中-公开
标题翻译：用于并行通道估计和干扰消除的方法和系统
公开(公告)号：US20110143672A1
公开(公告)日：2011-06-16
申请号：US12966185
申请日：2010-12-13
申请人： Taesang Yoo , Tao Luo , Yongbin Wei , Hanfang Pan , Michael A. Howard
发明人： Taesang Yoo , Tao Luo , Yongbin Wei , Hanfang Pan , Michael A. Howard
IPC分类号： H04B15/00
CPC分类号： H04J11/004 , H04L25/0206 , H04L25/0224 , H04L2025/03426
摘要： Certain aspects of the disclosure propose parallel channel estimation and interference cancellation in a wireless communications system. For each common reference signal tone offset, interference cancellation and channel estimation may be performed independently. The proposed channel estimation method may increase performance of a system.
摘要翻译：本公开的某些方面在无线通信系统中提出并行信道估计和干扰消除。对于每个公共参考信号色调偏移，可以独立地执行干扰消除和信道估计。所提出的信道估计方法可以提高系统的性能。

5. 发明授权

US08374072B2 Efficient zadoff-chu sequence generation 有权
标题翻译：高效的zadoff-chu序列生成
公开(公告)号：US08374072B2
公开(公告)日：2013-02-12
申请号：US12755998
申请日：2010-04-07
申请人： Peter Gaal , Robert J. Fuchs , Yongbin Wei , Ke Liu , Hanfang Pan , Durga Prasad Malladi , Daniel T. Macek
发明人： Peter Gaal , Robert J. Fuchs , Yongbin Wei , Ke Liu , Hanfang Pan , Durga Prasad Malladi , Daniel T. Macek
IPC分类号： H04J11/00 , H04W4/00
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 N log 2(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需要多于N个log 2（N）乘法。鉴于Chu序列的频繁处理，这将代表一个复杂的负担。除了可能计算某些初始参数之外，本发明使得可以执行没有任何乘法运算的序列生成和DFT步骤。

6. 发明授权

US08255759B2 APP (a priori probability) storage design for LTE turbo decoder with quadratic permutation polynomial interleaver 有权
标题翻译：具有二次置换多项式交织器的LTE turbo解码器的APP（先验概率）存储设计
公开(公告)号：US08255759B2
公开(公告)日：2012-08-28
申请号：US12608919
申请日：2009-10-29
申请人： Hanfang Pan , Yongbin Wei
发明人： Hanfang Pan , Yongbin Wei
IPC分类号： G06F12/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解码器同时访问多个文件而没有存储器访问争用。

7. 发明申请

US20110249548A1 EFFICIENT ZADOFF-CHU SEQUENCE GENERATION 有权
标题翻译：有效的ZADOFF-CHU序列生成
公开(公告)号：US20110249548A1
公开(公告)日：2011-10-13
申请号：US12755998
申请日：2010-04-07
申请人： Peter Gaal , Robert J. Fuchs , Yongbin Wei , Ke Liu , Hanfang Pan , Durga Prasad Malladi , Daniel T. Macek
发明人： Peter Gaal , Robert J. Fuchs , Yongbin Wei , Ke Liu , Hanfang Pan , Durga Prasad Malladi , Daniel T. Macek
IPC分类号： H04J11/00 , H04L27/28
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 N log 2(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需要多于N个log 2（N）乘法。鉴于Chu序列的频繁处理，这将代表一个复杂的负担。除了可能计算某些初始参数之外，本发明使得可以执行没有任何乘法运算的序列生成和DFT步骤。

8. 发明申请

US20110107019A1 APP (A PRIORI PROBABILITY) STORAGE DESIGN FOR LTE TURBO DECODER WITH QUADRATIC PERMUTATION POLYNOMIAL INTERLEAVER 有权
标题翻译：适用于LTE TURBO解码器的应用（PRIORI PROBABILITY）存储设计
公开(公告)号：US20110107019A1
公开(公告)日：2011-05-05
申请号：US12608919
申请日：2009-10-29
申请人： Hanfang Pan , Yongbin Wei
发明人： Hanfang Pan , Yongbin Wei
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解码器同时访问多个文件而没有存储器访问争用。

9. 发明授权

US09515808B2 Transmission of control information in a wireless network with carrier aggregation 有权
标题翻译：在具有载波聚合的无线网络中传输控制信息
公开(公告)号：US09515808B2
公开(公告)日：2016-12-06
申请号：US13558110
申请日：2012-07-25
申请人： Jelena M. Damnjanovic , Wanshi Chen , Juan Montojo , Yongbin Wei
发明人： Jelena M. Damnjanovic , Wanshi Chen , Juan Montojo , Yongbin Wei
IPC分类号： H04L5/00 , H04L5/14
CPC分类号： H04W72/0453 , H04L5/001 , H04L5/0055 , H04L5/0057 , H04L5/0058 , H04L5/0078 , H04L5/0091 , H04L5/14 , H04L25/22 , H04W16/32 , H04W72/1284 , H04W72/1294 , H04W72/14 , H04W88/02
摘要： Techniques for sending control information to support operation on multiple component carriers (CCs) are disclosed. A user equipment (UE) may be configured with multiple CCs for carrier aggregation. The multiple CCs may be associated with different uplink-downlink configurations and may have different downlink subframes and uplink subframes. In one aspect, uplink control information (UCI) for a secondary CC (SCC) may be sent on a primary CC (PCC) based on a UCI transmission timeline for the PCC (and not based on a UCI transmission timeline for the SCC). For example, a downlink grant for the SCC may be sent based on a downlink grant transmission timeline for the PCC. In another aspect, uplink grants for an SCC may be sent on the PCC based on an uplink grant transmission timeline for the PCC (and not based on an uplink grant transmission timeline for the SCC).
摘要翻译：公开了用于发送控制信息以支持多分量载波（CC）上的操作的技术。用户设备（UE）可以配置有多个用于载波聚合的CC。多个CC可以与不同的上行链路 - 下行链路配置相关联，并且可以具有不同的下行链路子帧和上行链路子帧。在一个方面，可以基于用于PCC的UCI传输时间线（而不是基于SCC的UCI传输时间线）在主CC（PCC）上发送用于辅助CC（SCC）的上行链路控制信息（UCI）。例如，可以基于PCC的下行链路许可传输时间线来发送用于SCC的下行链路许可。在另一方面，可以基于PCC的上行链路授权传输时间线（而不是基于SCC的上行链路许可传输时间线）在PCC上发送用于SCC的上行链路许可。

10. 发明授权

US09369885B2 Method and apparatus for selecting reference signal tones for decoding a channel 有权
公开(公告)号：US09369885B2
公开(公告)日：2016-06-14
申请号：US13269408
申请日：2011-10-07
申请人： Kapil Bhattad , Ke Liu , Tao Luo , Yongbin Wei
发明人： Kapil Bhattad , Ke Liu , Tao Luo , Yongbin Wei
IPC分类号： H04B1/00 , H04J11/00 , H04B7/00 , H04W24/02 , H04L27/26 , H04L5/00 , H04L25/02 , H04W84/04
CPC分类号： H04W24/02 , H03G1/02 , H04L5/0053 , H04L25/0202 , H04L27/2601 , H04W84/045
摘要： Methods and apparatuses are provided that include selecting reference signal (RS) or other tones to utilize in estimating a channel for decoding one or more channels. Where the RS tones are interfered by other base stations, interference cancelation can be performed over the RS tones. Since interference can vary over the tones, interference cancelation can yield RS tones of varying quality. Thus, a quality of each of the RS tones can be determined, and at least a subset of the RS tones can be selected for estimating a channel. Additionally or alternatively, the RS tones can be weighted or otherwise classified for performing channel estimation using the RS tones.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式