Abstract
AbstractThis paper proposes a real‐valued orthogonal periodic sequence of a period N=2ν derived from a real‐valued shift‐orthogonal finite‐length sequence of length M=2ν+1. This paper also explains the principle of a fast correlation algorithm that efficiently executes periodic correlation processing for this real‐valued orthogonal periodic sequence. The sidelobe of an aperiodic autocorrelation function for a real‐valued shift‐orthogonal finite‐length sequence (length of M) is 0 except for the right and left ends of the shift. If the subsequent sequence of first values repeatedly overlap the final values of this sequence, a real‐valued orthogonal periodic sequence of a period N=M−1 can be obtained. A real‐valued orthogonal periodic sequence of a period N=2ν generated from real‐valued shift‐orthogonal finite‐length sequence of length M=2ν+1 is obtained by convoluting partial sequences and based on that controls the number of multiplications and the number of additions to increment on the order of Nlog2N without using fast Fourier transformation. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(10): 18–28, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20294
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Electronics and Communications in Japan (Part III: Fundamental Electronic Science)
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
