ПЕРСПЕКТИВЫ ИСПОЛЬЗОВАНИЯ ДИСКРЕТНОГО ПРЕОБРАЗОВАНИЯ ХАРТЛИ В ТЕХНИКЕ СВЯЗИ
Анотація
Perspectives on using Discrete Hartley
Transform in communication technologies
The Discrete Hartley Transform (DHT) is a real-valued transform closely related to the DFT of a real-valued sequence. This report contains a list of advantages of DHT and presents some properties of this transform which have practical meaning.
Посилання
R. N. Bracewell. Discrete Hartley Transform. J.Opt.Soc.Am, 73(12):1832–1885, December 1983.
Hsieh S.Hou. The Fast Hartley Transform Algorithm. IEEE Transactions on Computers, C-36(2), February 1987.
Vinay Kumar Singh, Shilpi Gupta, Upena D. Dalal "Performance Comparison of Discrete Hartley Transform (DHT) and Fast Fourier Transform (FFT) OFDM System in AWGN Channel" International Journal of Computer Applications (0975 - 8887) Volume 70 - No. 9, May 2013
##submission.downloads##
Як цитувати
Номер
Розділ
Ліцензія
Авторське право (c) 2017 Роман Юрьевич Жогов
Ця робота ліцензується відповідно до Creative Commons Attribution 4.0 International License.
Authors who submit to this conference agree to the following terms:a) Authors retain copyright over their work, while allowing the conference to place this unpublished work under a Creative Commons Attribution License, which allows others to freely access, use, and share the work, with an acknowledgement of the work's authorship and its initial presentation at this conference.
b) Authors are able to waive the terms of the CC license and enter into separate, additional contractual arrangements for the non-exclusive distribution and subsequent publication of this work (e.g., publish a revised version in a journal, post it to an institutional repository or publish it in a book), with an acknowledgement of its initial presentation at this conference.
c) In addition, authors are encouraged to post and share their work online (e.g., in institutional repositories or on their website) at any point before and after the conference.