A real-valued periodic orthogonal sequence derived from a real-valued shift-orthogonal finite-length sequence and its fast periodic correlation algorithm

Takahiro Matsumoto, Yoshihiro Tanada
{"title":"A real-valued periodic orthogonal sequence derived from a real-valued shift-orthogonal finite-length sequence and its fast periodic correlation algorithm","authors":"Takahiro Matsumoto,&nbsp;Yoshihiro Tanada","doi":"10.1002/ecjc.20294","DOIUrl":null,"url":null,"abstract":"<p>This paper proposes a real-valued orthogonal periodic sequence of a period <i>N</i>=2<sup>ν</sup> derived from a real-valued shift-orthogonal finite-length sequence of length <i>M</i>=2<sup>ν</sup>+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 <i>M</i>) 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 <i>N</i>=<i>M</i>−1 can be obtained. A real-valued orthogonal periodic sequence of a period <i>N</i>=2<sup>ν</sup> generated from real-valued shift-orthogonal finite-length sequence of length <i>M</i>=2<sup>ν</sup>+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 <i>N</i>log<sub>2</sub><i>N</i> 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</p>","PeriodicalId":100407,"journal":{"name":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","volume":"90 10","pages":"18-28"},"PeriodicalIF":0.0000,"publicationDate":"2007-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1002/ecjc.20294","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","FirstCategoryId":"1085","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/ecjc.20294","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

This 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

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
由实数移位正交有限长序列导出的实数周期正交序列及其快速周期相关算法
本文从一个长度为M=2μ+1的实数移位正交有限长序列导出了一个周期为N=2μ的实数正交周期序列。本文还解释了一种快速相关算法的原理,该算法能有效地对该实数正交周期序列执行周期相关处理。实数移位正交有限长度序列(长度为M)的非周期自相关函数的旁瓣除移位的右端和左端外为0。如果第一个值的后续序列与该序列的最终值重复重叠,则可以获得周期N=M−1的实值正交周期序列。通过对部分序列进行卷积,在不使用快速傅立叶变换的情况下,控制乘法和加法的次数以Nlog2N的数量级递增,获得了由长度为M=2μ+1的实数移位正交有限长度序列生成的周期为N=2μ的实数正交周期序列。©2007 Wiley Periodicals,股份有限公司Electron Comm Jpn Pt 3,90(10):2007年18月28日;在线发表于Wiley InterScience(www.InterScience.Wiley.com)。DOI 10.1002/ecjc.20294
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Toward systematic generation of 3COL instances based on minimal unsolvable structures Two computational algorithms for deriving phase equations: Equivalence and some cautions A data‐driven processor for alleviating bottlenecks of sequential programs and maintaining multiprocessing capability Robust and adaptive merge of multiple range images with photometric attribute Autostereoscopic visualization of volume data using computer‐generated holograms
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1