利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

21 条记录 (耗时 0.032 秒)

    Efficient zadoff-chu sequence generation
    1.
    发明授权
    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步骤。

    EFFICIENT ZADOFF-CHU SEQUENCE GENERATION
    2.
    发明申请
    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步骤。

    Recursive realization of polynomial permutation interleaving
    4.
    发明授权
    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解码性能。

    APP (A PRIORI PROBABILITY) STORAGE DESIGN FOR LTE TURBO DECODER WITH QUADRATIC PERMUTATION POLYNOMIAL INTERLEAVER
    7.
    发明申请
    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解码器同时访问多个文件而没有存储器访问争用。

    APP (a priori probability) storage design for LTE turbo decoder with quadratic permutation polynomial interleaver
    8.
    发明授权
    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解码器同时访问多个文件而没有存储器访问争用。

    Minimum finger low-power demodulator for wireless communication
    9.
    发明授权
    Minimum finger low-power demodulator for wireless communication 有权
    用于无线通信的最小手指低功耗解调器

    公开(公告)号：US08798214B2

    公开(公告)日：2014-08-05

    申请号：US11940313

    申请日：2007-11-14

    申请人： Michael Alexander Howard ,  June Namgoong ,  Hanfang Pan

    发明人： Michael Alexander Howard ,  June Namgoong ,  Hanfang Pan

    IPC分类号： H04B7/10

    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）的至少一个多路径（例如，最小数量的多路径）。 至少一个多路径被分配给至少一个手指处理器并由其处理，以恢复来自基站的传输。

    SCALABLE SCHEDULER ARCHITECTURE FOR CHANNEL DECODING
    10.
    发明申请
    SCALABLE SCHEDULER ARCHITECTURE FOR CHANNEL DECODING 审中-公开
    用于信道解码的可调度调度器架构

    公开(公告)号：US20110280133A1

    公开(公告)日：2011-11-17

    申请号：US13104844

    申请日：2011-05-10

    申请人： Wei-Hsin Chang ,  Hanfang Pan ,  Michael Alexander Howard ,  Wenqing Wu

    发明人： Wei-Hsin Chang ,  Hanfang Pan ,  Michael Alexander Howard ,  Wenqing Wu

    IPC分类号： H04W72/04 ,  H04W24/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.

    摘要翻译： 本公开的某些方面涉及一种用于处理无线通信的方法。 根据一个方面，处理单元可以接收传输块的多个码块，并且与多个解码器并行地调度要解码的多个码块。 至少一个解码器解码至少一个代码块作为独立任务。 处理单元进一步从多个解码器中收集解码的信息比特，并且转发所收集的解码信息比特用于进一步处理。 一方面，处理单元包括一个输出代理，用于临时存储解码的信息位，同时等待传输块的所有代码块被解码。