Fast Walsh–Hadamard–Fourier Transform Algorithm

Hamood, M. T.; Boussakta, S.

doi:10.1109/tsp.2011.2162836

Cited by 41 publications

(23 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Hamood et al [76] proposed an efficient low computational complexity algorithm called Fast Walsh-Hadamard-Fourier Transform (FWFT) that combines the calculation of the Walsh-Hadamard transform (WHT) and the discrete Fourier transform (DFT). The FWFT algorithm can be used in Walsh-Hadamard spread orthogonal frequency division multiplexing systems (WHT-SOFDM) in order to increase the computational speed and to reduce the implementation cost.…”

Section: Fast Walsh-hadamard-fourier Transformmentioning

confidence: 99%

See 1 more Smart Citation

Multicarrier Spread Spectrum Modulation Schemes and Efficient FFT Algorithms for Cognitive Radio Systems

Sundararajan

Govindaswamy

2014

Electronics

View full text Add to dashboard Cite

Spread spectrum (SS) and multicarrier modulation (MCM) techniques are recognized as potential candidates for the design of underlay and interweave cognitive radio (CR) systems, respectively. Direct Sequence Code Division Multiple Access (DS-CDMA) is a spread spectrum technique generally used in underlay CR systems. Orthogonal Frequency Division Multiplexing (OFDM) is the basic MCM technique, primarily used in interweave CR systems. There are other MCM schemes derived from OFDM technique, like Non-Contiguous OFDM, Spread OFDM, and OFDM-OQAM, which are more suitable for CR systems. Multicarrier Spread Spectrum Modulation (MCSSM) schemes like MC-CDMA, MC-DS-CDMA and SS-MC-CDMA, combine DS-CDMA and OFDM techniques in order to improve the CR system performance and adaptability. This article gives a detailed survey of the various spread spectrum and multicarrier modulation schemes proposed in the literature. Fast Fourier Transform (FFT) plays a vital role in all the multicarrier modulation techniques. The FFT part of the modem can be used for spectrum sensing. The performance of the FFT operator plays a crucial role in the overall performance of the system. Since the cognitive radio is an adaptive system, the FFT operator must also be adaptive for various input/output values, in order to save energy and time taken for execution. This article also includes the various efficient FFT algorithms proposed in the literature, which are suitable for CR systems.

show abstract

Section: Fast Walsh-hadamard-fourier Transformmentioning

confidence: 99%

“…Algorithms proposed in [76,77], are used for WHT-spread OFDM systems. These algorithms combine WHT and DFT computations into a single transform.…”

Section: Summary Of Efficient Fft Algorithmsmentioning

confidence: 99%

Multicarrier Spread Spectrum Modulation Schemes and Efficient FFT Algorithms for Cognitive Radio Systems

Sundararajan

Govindaswamy

2014

Electronics

View full text Add to dashboard Cite

show abstract

“…Monir T et al then proposed the efficient combination of DFT and Walsh calculations. This technique is used to perform Fast Walsh Hadamard Transforms (FWHT) by utilizing Radix-4 [4]. Later then, the efficient algorithm of calculating both Walsh transforms and DFT transforms using the famous Radix-2 was also published [5].…”

Section: Introductionmentioning

confidence: 99%

Design of 8-point DFT based on Rademacher Functions

Zulfikar¹,

Walidainy²

2016

IJECE

View full text Add to dashboard Cite

This paper presents a new circuit design for 8-point DFT algorithm based on product of Rademacher functions. The designed circuit is basically constructed base on 8-point DFT decimation in time that mainly construct of two 4-point and four 2-point DFTs. However, the operation of the design circuit is different. It utilized the advantages of Rademacher functions simplicity. Therefore, the proposed design is constructed from our previous design 4-point DFT which is based on product of Rademacher functions. Some analysis upon number types, internal connections and complex conjugate of the results to achieve the more efficient circuit have been made. Therefore, instead of four, the proposed design requires only three 2-point DFTs. Again, two output results of the design DFT have been removed since they are equal in terms of magnitude to the other results, but two negative circuit are required as a compensation. Moreover, the previous designed circuit of 4-point DFT has been replaced with the new circuit design. This circuit is special designed for non-standalone used, the circuit must be integrated inside the proposed 8-point DFT.

show abstract

“…The simplicity of Walsh transforms, combines with the powerfully of Fourier transforms result in a more efficient transform algorithm was available [17][18][19]. A method of calculating both DFT and WHT is developed through the factorization of intermediate transform T by Bousasakta and Holt [17].…”

mentioning

confidence: 99%

“…An efficient algorithm which combines the calculation of DFT and WHT was also introduced. The technique is based on the development of radix-4 fast Walsh Hadamard Transform (FWHT) [18]. Another efficient method of calculating both DFT and WHT using radix-2 was published [19].…”

mentioning

confidence: 99%

FPGA Hardware Realization: Addition of Two Digital Signals Based on Walsh Transforms

Zulfikar

Abbasi

Alamoud

2016

IJECE

View full text Add to dashboard Cite

This paper presents hardware realization of an addition of two digital signals based on Walsh transforms and inverse Walsh transforms targeted to the Xilinx FPGA Spartan 3 board. The realization utilizes Walsh Transform to convert the input data to the frequency domain and the inverse Walsh transform to reconvert the data from the frequency domain. The designed system is capable of performing addition, subtraction, multiplication and Arbitrary Waveform Generation (AWG). However, in the present work, the hardware realization of addition only has been demonstrated. The Clock frequency for realization into the board is supplied by an external function generator. Output results are captured using a logic analyzer. Input data to the board (system) is passed manually through the available slide switches on-board.

show abstract

Fast Walsh–Hadamard–Fourier Transform Algorithm

Cited by 41 publications

References 13 publications

Multicarrier Spread Spectrum Modulation Schemes and Efficient FFT Algorithms for Cognitive Radio Systems

Multicarrier Spread Spectrum Modulation Schemes and Efficient FFT Algorithms for Cognitive Radio Systems

Design of 8-point DFT based on Rademacher Functions

FPGA Hardware Realization: Addition of Two Digital Signals Based on Walsh Transforms

Contact Info

Product

Resources

About