{"title":"广义离散Hartley变换(GDHT)分支的相似性","authors":"B. N. Madhukar, S. Bharathi","doi":"10.1109/DISCOVER47552.2019.9008089","DOIUrl":null,"url":null,"abstract":"This paper presents new similarity properties for the offshoots of GDHT. GDHT and its offshoots are finite dimensional discrete transforms that have wide ranging and ramifying applications in Pure Mathematics and Applied Mathematical Applications such as Digital Signal Processing, Image Processing, and Communications Engineering. The similarity properties can be used for computing the time domain signal from its frequency domain expression or contra if and only if an existing GDHT (and its offshoots) pair exists. In such instances, the merits of the properties lie in the belt-tightening of computational intricacy and outlay essentially.","PeriodicalId":274260,"journal":{"name":"2019 IEEE International Conference on Distributed Computing, VLSI, Electrical Circuits and Robotics (DISCOVER)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Similarity properties for the offshoots of the Generalized Discrete Hartley Transform (GDHT)\",\"authors\":\"B. N. Madhukar, S. Bharathi\",\"doi\":\"10.1109/DISCOVER47552.2019.9008089\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents new similarity properties for the offshoots of GDHT. GDHT and its offshoots are finite dimensional discrete transforms that have wide ranging and ramifying applications in Pure Mathematics and Applied Mathematical Applications such as Digital Signal Processing, Image Processing, and Communications Engineering. The similarity properties can be used for computing the time domain signal from its frequency domain expression or contra if and only if an existing GDHT (and its offshoots) pair exists. In such instances, the merits of the properties lie in the belt-tightening of computational intricacy and outlay essentially.\",\"PeriodicalId\":274260,\"journal\":{\"name\":\"2019 IEEE International Conference on Distributed Computing, VLSI, Electrical Circuits and Robotics (DISCOVER)\",\"volume\":\"95 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE International Conference on Distributed Computing, VLSI, Electrical Circuits and Robotics (DISCOVER)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DISCOVER47552.2019.9008089\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE International Conference on Distributed Computing, VLSI, Electrical Circuits and Robotics (DISCOVER)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DISCOVER47552.2019.9008089","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Similarity properties for the offshoots of the Generalized Discrete Hartley Transform (GDHT)
This paper presents new similarity properties for the offshoots of GDHT. GDHT and its offshoots are finite dimensional discrete transforms that have wide ranging and ramifying applications in Pure Mathematics and Applied Mathematical Applications such as Digital Signal Processing, Image Processing, and Communications Engineering. The similarity properties can be used for computing the time domain signal from its frequency domain expression or contra if and only if an existing GDHT (and its offshoots) pair exists. In such instances, the merits of the properties lie in the belt-tightening of computational intricacy and outlay essentially.