FHT algorithm for length N = q.2m

Electronics Letters

Volumn 35, Issue 12, 1999, Pages 966-968

  Vijayakumar, N ^a   Prabhu, K M M ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY;

DISCRETE HARTLEY TRANSFORMS (DHT); FAST HARTLEY TRANSFORMS (FHT);

MATHEMATICAL TRANSFORMATIONS;

EID: 0032678075     PISSN: 00135194     EISSN: None     Source Type: Journal    
DOI: 10.1049/el:19990603     Document Type: Article

References (4)

1. BRACEWELL, R.N.: 'Discrete Hartley transform', J. Opt. Soc. Am., 1983, 73, (12), pp. 1832-1835
2. BRACEWELL, R.N.: 'The fast Hartley transform', Proc. IEEE, 1984, 72, (8), pp. 1010-1018
3. SORENSEN, H.V., et al.: 'On computing the discrete Hartley transform', IEEE Trans., 1985, ASSP-33, (4), pp. 1321-1328
4. m', IEEE Trans., 1998, CAS-45, (6), pp. 685-690