Fast algorithms for digital computation of linear canonical transforms

Simple item page
dc.citation.epage293en_US
dc.citation.spage327en_US
dc.contributor.authorKoç, A.en_US
dc.contributor.authorOktem, F. S.en_US
dc.contributor.authorÖzaktaş, Haldun M.en_US
dc.contributor.authorKutay, M. A.en_US
dc.contributor.editorHealy, J. J.
dc.contributor.editorKutay, M. A.
dc.contributor.editorÖzaktaş, Haldun M.
dc.contributor.editorSheridan, J. T.
dc.date.accessioned2019-04-17T10:05:12Z
dc.date.available2019-04-17T10:05:12Z
dc.date.issued2016en_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.descriptionChapter 10en_US
dc.description.abstractFast 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.identifier.doi10.1007/978-1-4939-3028-9_10en_US
dc.identifier.doi10.1007/978-1-4939-3028-9en_US
dc.identifier.eissn1556-1534
dc.identifier.isbn9781493930272
dc.identifier.issn0342-4111
dc.identifier.urihttp://hdl.handle.net/11693/50829
dc.language.isoEnglishen_US
dc.publisherSpringer, New Yorken_US
dc.relation.ispartofLinear canonical transformsen_US
dc.relation.ispartofseriesSpringer Series in Optical Sciences;198
dc.relation.isversionofhttps://doi.org/10.1007/978-1-4939-3028-9_10en_US
dc.relation.isversionofhttps://doi.org/10.1007/978-1-4939-3028-9en_US
dc.source.title327en_US
dc.subjectMicrowaveen_US
dc.subjectConvolutionen_US
dc.subjectHuygensen_US
dc.titleFast algorithms for digital computation of linear canonical transformsen_US
dc.typeBook Chapteren_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Fast_Algorithms_for_Digital_Computation_of_Linear_Canonical_Transforms.pdf
Size:
508 KB
Format:
Adobe Portable Document Format
Description:
View / Download
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Department of Electrical and Electronics Engineering