Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/17791
Title: Symmetric sine and cosine structures for trigonometric transforms
Authors: Chan, YH 
Siu, WC 
Issue Date: 1991
Publisher: Birkhäuser
Source: Circuits, systems and signal processing, 1991, v. 10, no. 4, p. 433-441 How to cite?
Journal: Circuits, systems and signal processing 
Abstract: In this paper we firstly define two new formulations, the symmetric sine structure (SSS) and the symmetric cosine structure (SCS). Then we propose a simple algorithm to realize one-dimensional SCS and SSS with sequence lengths equal to 2m. We show that a 2m-length discrete Hartley transform can be realized through a 2m-1-length SCS and a 2m-1-length SSS, which achieves the same multiplicative complexity as the minimum number of multiplications reported in the literature. However, our approach gives the advantage of requiring less additions compared with conventional approaches. Furthermore, this approach can also be applied to realize a 2m-length real-valued discrete Fourier transform, which requires the lowest number of multiplications compared with conventional real-valued algorithms and needs no complex number operations as found in other real-valued algorithms.
URI: http://hdl.handle.net/10397/17791
ISSN: 0278-081X
EISSN: 1531-5878
DOI: 10.1007/BF01194881
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

44
Last Week
2
Last month
Checked on Sep 18, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.