Loading...
Please wait, while we are loading the content...
Similar Documents
A new algorithm for calculation of the discrete Hartley transform
| Content Provider | Semantic Scholar |
|---|---|
| Author | Sharma, Mukesh |
| Copyright Year | 2019 |
| Abstract | Group Theory has played a very significant role in designing fast algorithms for digital signal processing. This thesis develops a new algorithm to compute tp.e Hartley Transform based on group theoretic concepts. The proposed algorithm identifies multidimensional cyclic structures within the Hartley transform kernel by using the properties of groups formed by the row and column indices. It. then uses the readily available convolution algorithms to evaluate the products of such submatrices and vectors ' properly prepared from the input sequences. A combination of such product vectors gives the desired transform. · Thus the algorithm is inherantly divided into three stages, the preprocessing stage to massage the input sequence, the convolution stage to carry out the actual product of sQ.bmatrices and the postprocessing stage to combine the product vectors. The proposes algorithm has a better computational complexity than other algoTithms available in the literature, is more universal (i.e., applicable to all lengths), and ·has a modular structure, implying its suitability for parallel implementation. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | https://preserve.lehigh.edu/cgi/viewcontent.cgi?article=6287&context=etd |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
