会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 8. 发明授权
    • Efficient zadoff-chu sequence generation
    • 高效的zadoff-chu序列生成
    • US08374072B2
    • 2013-02-12
    • US12755998
    • 2010-04-07
    • Peter GaalRobert J. FuchsYongbin WeiKe LiuHanfang PanDurga Prasad MalladiDaniel T. Macek
    • Peter GaalRobert J. FuchsYongbin WeiKe LiuHanfang PanDurga Prasad MalladiDaniel T. Macek
    • H04J11/00H04W4/00
    • 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 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步骤。
    • 10. 发明授权
    • Efficient multi-symbol deinterleaver
    • 高效的多符号解交织器
    • US07954016B2
    • 2011-05-31
    • US12717742
    • 2010-03-04
    • Hanfang PanInyup KangJames Krysl
    • Hanfang PanInyup KangJames Krysl
    • H03M13/03G06F11/00G11C29/00
    • H03M13/2764H03M13/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.
    • 本文公开的实施例解决了本领域对于有效的多符号解交织器的需要。 在一个方面,部署多个存储体以根据存储模式接收并同时存储多个值,诸如从调制星座确定的软判决值。 在另一方面,存储模式包括多个周期,多个存储体的选定子集和用于确定用于存储到为每个周期指示的相应存储体中的地址的地址偏移。 在另一方面,可以按顺序增加的索引(诸如地址)按顺序访问所存储的值。 还提出了各种其他方面。 这些方面具有允许以有效的方式解码多个符号值的好处,从而满足计算时间限制并节省功率。