Repositorio Dspace

A family of fast walsh hadamard algorithms with identical sparse matrix factorization

A family of fast walsh hadamard algorithms with identical sparse matrix factorization
 
Martí i Puig, Pere
2006

Texto completo de este documento

Icon
Nombre: artconlli_a2006_marti_pere_family_fast.pdf
Tamaño: 1.295Mb
Formato: PDF
Descripción: Només accés administradors
Enllaç permanent: http://hdl.handle.net/10854/3075
 
Versió de l'editor: https://doi.org/10.1109/LSP.2006.879472
 

Resumen

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

Tipo de documento:

Artículo

Derechos:

 
(c) IEEE
 
Tots els drets reservats
 

Citación Bibliográfica:

Martí-Puig, P. (2006). A family of fast walsh hadamard algorithms with identical sparse matrix factorization. IEEE Signal Processing Letters, 13(11), 672-675. doi:10.1109/LSP.2006.879472