dc.contributor.author | Koç, A. | en_US |
dc.contributor.author | Oktem, F. S. | en_US |
dc.contributor.author | Özaktaş, Haldun M. | en_US |
dc.contributor.author | Kutay, M. A. | en_US |
dc.contributor.editor | Healy, J. J. | |
dc.contributor.editor | Kutay, M. A. | |
dc.contributor.editor | Özaktaş, Haldun M. | |
dc.contributor.editor | Sheridan, J. T. | |
dc.date.accessioned | 2019-04-17T10:05:12Z | |
dc.date.available | 2019-04-17T10:05:12Z | |
dc.date.issued | 2016 | en_US |
dc.identifier.isbn | 9781493930272 | |
dc.identifier.issn | 0342-4111 | |
dc.identifier.uri | http://hdl.handle.net/11693/50829 | |
dc.description | Chapter 10 | en_US |
dc.description.abstract | Fast and accurate algorithms for digital computation of linear canonical
transforms (LCTs) are discussed. Direct numerical integration takes O.N2/ time,
where N is the number of samples. Designing fast and accurate algorithms that
take O.N logN/ time is of importance for practical utilization of LCTs. There are
several approaches to designing fast algorithms. One approach is to decompose an
arbitrary LCT into blocks, all of which have fast implementations, thus obtaining
an overall fast algorithm. Another approach is to define a discrete LCT (DLCT),
based on which a fast LCT (FLCT) is derived to efficiently compute LCTs.
This strategy is similar to that employed for the Fourier transform, where one
defines the discrete Fourier transform (DFT), which is then computed with the fast
Fourier transform (FFT). A third, hybrid approach involves a DLCT but employs
a decomposition-based method to compute it. Algorithms for two-dimensional and
complex parametered LCTs are also discussed. | en_US |
dc.language.iso | English | en_US |
dc.source.title | 327 | en_US |
dc.relation.ispartof | Linear canonical transforms | en_US |
dc.relation.ispartofseries | Springer Series in Optical Sciences;198 | |
dc.relation.isversionof | https://doi.org/10.1007/978-1-4939-3028-9_10 | en_US |
dc.relation.isversionof | https://doi.org/10.1007/978-1-4939-3028-9 | en_US |
dc.subject | Microwave | en_US |
dc.subject | Convolution | en_US |
dc.subject | Huygens | en_US |
dc.title | Fast algorithms for digital computation of linear canonical transforms | en_US |
dc.type | Book Chapter | en_US |
dc.department | Department of Electrical and Electronics Engineering | en_US |
dc.citation.spage | 327 | en_US |
dc.citation.epage | 293 | en_US |
dc.identifier.doi | 10.1007/978-1-4939-3028-9_10 | en_US |
dc.identifier.doi | 10.1007/978-1-4939-3028-9 | en_US |
dc.publisher | Springer, New York | en_US |
dc.identifier.eissn | 1556-1534 | |