The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Feb. 12, 2013
Filed:
Apr. 07, 2010
Peter Gaal, San Diego, CA (US);
Robert J. Fuchs, San Diego, CA (US);
Yongbin Wei, San Diego, CA (US);
KE Liu, San Diego, CA (US);
Hanfang Pan, San Diego, CA (US);
Durga Prasad Malladi, San Diego, CA (US);
Daniel T. Macek, San Diego, CA (US);
Peter Gaal, San Diego, CA (US);
Robert J. Fuchs, San Diego, CA (US);
Yongbin Wei, San Diego, CA (US);
Ke Liu, San Diego, CA (US);
Hanfang Pan, San Diego, CA (US);
Durga Prasad Malladi, San Diego, CA (US);
Daniel T. Macek, San Diego, CA (US);
QUALCOMM Incorporated, San Diego, CA (US);
Abstract
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.