Optimized Architecture for Computing Zadoff-Chu Sequences with Application to LTE

Optimized Architecture for Computing Zadoff-Chu Sequences with Application to LTE
复制标题

DOI:
10.1109/glocom.2009.5426248
复制
发表时间:
2009-11
期刊:
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference
影响因子:
--
通讯作者:
Mohammad M. Mansour
Mohammad M. Mansour
中科院分区:
其他
文献类型:
--
作者:
Mohammad M. Mansour

文献摘要

被引文献

相似文献

基于CORDIC算法,提出了一种计算Zadoff-Chu(ZC)复序列元素的优化算法和相应的可重构结构。该算法利用一种简单的对偶关系在时间域和频域计算ZC序列元素。算法变换用于递归计算元素,并消除带非常数项的乘子。将该算法应用于LTE物理层物理随机接入信道(PRACH)检测的搜索块中。PRACH发送从ZC序列构建的前导以建立初始接入以及与基站的上行链路同步。基于该算法,实现了一种可重构的硬件结构,以高精度动态生成这些前导码,消除了存储大量长复数ZC序列元素的需要。仿真结果表明,该结构能够获得接近浮点精度理想误码率的LTE PRACH误码率。
An optimized algorithm and a corresponding re-configurable architecture for computing Zadoff-Chu (ZC) complex sequence elements based on the CORDIC algorithm are proposed. The algorithm computes ZC-sequence elements both in time domain and frequency domain using a simple duality relationship. Algorithm transforms are employed to compute the elements recursively and eliminate multipliers with non-constant terms. The algorithm is applied in a searcher block for detecting the physical random access channel (PRACH) in LTE PHY layer. The PRACH transmits a preamble constructed from ZC sequences to establish initial access along with uplink synchronization with the base station. A reconfigurable hardware architecture was implemented to generate these preambles on the fly with high accuracy based on the proposed algorithm, eliminating the need for storing a large number of long complex ZC sequence elements. Simulation results demonstrate that the proposed architecture is capable of achieving detection error rates for LTE PRACH that are close to ideal rates achieved using floating-point precision.