基于配对变换的哈尔变换新算法的发展及其在TMS DSP处理器上的实现。

{"title":"基于配对变换的哈尔变换新算法的发展及其在TMS DSP处理器上的实现。","authors":"","doi":"10.29121/ijesrt.v9.i6.2020.5","DOIUrl":null,"url":null,"abstract":"Paired transform splits the mathematical structure of many discrete unitary transforms, including the Fourier, Hadamard, Cosine and Hartley transforms, into the minimum number of short transforms. The discrete Haar transform that is very useful in many signal and image processing applications can be also calculated by the fast paired transform. The Haar transform can be considered as the particular case of the paired transforms, namely the 2-paired transform. In this research a Novel Fast algorithm for Haar transform is developed using paired transform: Paired Fast Haar Transform (Paired FHT). For illustration purposes relation between the Haar and paired transforms are described using the examples for 16, 8, 4 – point transforms are analyzed in detail. Finally the novel Haar transform: Paired Fast Haar transform is implemented using Code Compose Studio for TMS DSP processor Starter Kit (TMS DSK) TMS 320 C 6713 DSP processor for understanding the possible sampling rates.","PeriodicalId":426715,"journal":{"name":"June-2020","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"DEVELOPMENT OF NOVEL ALGORITHM FOR HAAR TRANSFORM USING PAIRED TRANSFORM: IMPLEMENTATION ON TMS DSP PROCESSORS.\",\"authors\":\"\",\"doi\":\"10.29121/ijesrt.v9.i6.2020.5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Paired transform splits the mathematical structure of many discrete unitary transforms, including the Fourier, Hadamard, Cosine and Hartley transforms, into the minimum number of short transforms. The discrete Haar transform that is very useful in many signal and image processing applications can be also calculated by the fast paired transform. The Haar transform can be considered as the particular case of the paired transforms, namely the 2-paired transform. In this research a Novel Fast algorithm for Haar transform is developed using paired transform: Paired Fast Haar Transform (Paired FHT). For illustration purposes relation between the Haar and paired transforms are described using the examples for 16, 8, 4 – point transforms are analyzed in detail. Finally the novel Haar transform: Paired Fast Haar transform is implemented using Code Compose Studio for TMS DSP processor Starter Kit (TMS DSK) TMS 320 C 6713 DSP processor for understanding the possible sampling rates.\",\"PeriodicalId\":426715,\"journal\":{\"name\":\"June-2020\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"June-2020\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.29121/ijesrt.v9.i6.2020.5\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"June-2020","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.29121/ijesrt.v9.i6.2020.5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

配对变换将许多离散酉变换的数学结构,包括傅里叶变换、哈达玛变换、余弦变换和哈特利变换,分解成最小数量的短变换。在许多信号和图像处理应用中非常有用的离散哈尔变换也可以通过快速配对变换来计算。Haar变换可以看作是成对变换的特殊情况,即2对变换。本文提出了一种基于配对变换的快速Haar变换算法:配对快速Haar变换(paired FHT)。为了说明目的,用16点、8点、4点变换的例子详细分析了哈尔变换和配对变换之间的关系。最后,利用Code Compose Studio for TMS DSP处理器Starter Kit (TMS DSK) TMS 320c6713 DSP处理器实现了新的Haar变换:配对快速Haar变换,以了解可能的采样率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
DEVELOPMENT OF NOVEL ALGORITHM FOR HAAR TRANSFORM USING PAIRED TRANSFORM: IMPLEMENTATION ON TMS DSP PROCESSORS.
Paired transform splits the mathematical structure of many discrete unitary transforms, including the Fourier, Hadamard, Cosine and Hartley transforms, into the minimum number of short transforms. The discrete Haar transform that is very useful in many signal and image processing applications can be also calculated by the fast paired transform. The Haar transform can be considered as the particular case of the paired transforms, namely the 2-paired transform. In this research a Novel Fast algorithm for Haar transform is developed using paired transform: Paired Fast Haar Transform (Paired FHT). For illustration purposes relation between the Haar and paired transforms are described using the examples for 16, 8, 4 – point transforms are analyzed in detail. Finally the novel Haar transform: Paired Fast Haar transform is implemented using Code Compose Studio for TMS DSP processor Starter Kit (TMS DSK) TMS 320 C 6713 DSP processor for understanding the possible sampling rates.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信