Question: The discrete Hartley transform (DHT) of a sequence x[n] of length N is defined as, where H N [a] = C N [a] + S
The discrete Hartley transform (DHT) of a sequence x[n] of length N is defined as, where HN[a] = CN[a] + SN[a], with CN[a] = cos (2?a/N), SN[a] = sin(2?a/N). Problem explores the properties of the discrete Hartley transform in detail, particularly its circular convolution property.
(a) Verify that HN [a] = HN [1 + N], and verify the following useful property of HN[a]: HN[a + b] = HN[a] CN[b] + HN[?a] SN [b] = HN[b] CN[a] + HN[?b] SN[a].
(b) By decomposing x [n] into its even-numbered points and odd ?numbered points, and by using the identity derived in part (a), derive a fast DHT algorithm based on the decimation-in-time principle.
![N-1 XH(k] = *(n]HN[nk], k = 0, 1, .. N 1, n-0](https://dsd5zvtm8ll6.cloudfront.net/si.experts.images/questions/2022/11/636a508272321_810636a50826243e.jpg)
N-1 XH(k] = *(n]HN[nk], k = 0, 1, .. N 1, n-0
Step by Step Solution
3.52 Rating (169 Votes )
There are 3 Steps involved in it
a b Using the definition of the discrete Hartley tr... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
30-E-T-E-D-S-P (432).docx
120 KBs Word File
