Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). We apologize for the inconvenience.
By Topic

A Family of Fast Walsh Hadamard Algorithms With Identical Sparse Matrix Factorization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Marti-Puig, P. ; Dept. of Digital Inf. Technol., Univ. of Vic

In this letter, we present a family of fast Walsh Hadamard transform algorithms that have an identical and iterative stage factorization. We show the transform factorization in terms of identical sparse matrices that implement the stages of general radix-R factorization, where R is a power of 2

Published in:

Signal Processing Letters, IEEE  (Volume:13 ,  Issue: 11 )