会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 23. 发明申请
    • EFFICIENT ZADOFF-CHU SEQUENCE GENERATION
    • 有效的ZADOFF-CHU序列生成
    • WO2011127007A1
    • 2011-10-13
    • PCT/US2011/031166
    • 2011-04-05
    • QUALCOMM IncorporatedGAAL, PeterFUCHS, Robert J.WEI, YongbinLIU, KePAN, HanfangMALLADI, Durga PrasadMACEK, Daniel T.
    • GAAL, PeterFUCHS, Robert J.WEI, YongbinLIU, KePAN, HanfangMALLADI, Durga PrasadMACEK, Daniel T.
    • H04J13/00H04J13/14
    • H04J13/0059H04J13/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步骤。
    • 26. 发明申请
    • TURBO INTERLEAVER FOR HIGH DATA RATES
    • WO2008057906A2
    • 2008-05-15
    • PCT/US2007/083284
    • 2007-11-01
    • QUALCOMM IncorporatedWEI, YongbinSUN, JingMALLADI, Durga Prasad
    • WEI, YongbinSUN, JingMALLADI, Durga Prasad
    • H03M13/27H03M13/29
    • H03M13/2775H03M13/296H03M13/6561
    • Techniques for supporting high decoding throughput are described. A transmitter may encode a code block of data bits with a Turbo encoder. A receiver may perform decoding for the code block with a Turbo decoder having multiple soft-input soft-output (SISO) decoders. A contention-free Turbo interleaver may be used if the code block size is larger than a threshold size. A regular Turbo interleaver may be used if the code block size is equal to or smaller than the threshold size. The contention-free Turbo interleaver reorders the data bits in the code block such that information from the multiple SISO decoders, after interleaving or deinterleaving, can be written in parallel to multiple storage units in each write cycle without encountering memory access contention. The regular Turbo interleaver can reorder the data bits in the code block in any manner without regard to contention-free memory access.
    • 描述了用于支持高解码吞吐量的技术。 发射机可以使用Turbo编码器对数据位的码块进行编码。 接收机可以使用具有多个软输入软输出(SISO)解码器的Turbo解码器来对码块执行解码。 如果码块大小大于阈值大小,则可以使用无竞争的Turbo交织器。 如果码块大小等于或小于阈值大小,则可以使用常规Turbo交织器。 无竞争的Turbo交织器重新排序代码块中的数据位,使得来自多个SISO解码器的信息在交织或解交织之后可以在每个写周期中并行写入多个存储单元,而不会遇到存储器访问争用。 正常的Turbo交织器可以以任何方式重新排序代码块中的数据位,而不考虑无竞争的存储器访问。