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

dc.contributor	Universitat de Vic. Escola Politècnica Superior
dc.contributor	Universitat de Vic. Grup de Recerca en Tecnologies Digitals
dc.contributor.author	Martí i Puig, Pere
dc.date.accessioned	2014-05-23T10:26:06Z
dc.date.available	2014-05-23T10:26:06Z
dc.date.created	2006
dc.date.issued	2006
dc.identifier.citation	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	ca_ES
dc.identifier.issn	1070-9908
dc.identifier.uri	http://hdl.handle.net/10854/3075
dc.description.abstract	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	ca_ES
dc.format	application/pdf
dc.format.extent	4 p.	ca_ES
dc.language.iso	eng	ca_ES
dc.publisher	IEEE	ca_ES
dc.rights	(c) IEEE
dc.rights	Tots els drets reservats	ca_ES
dc.subject.other	Algorismes	ca_ES
dc.title	A family of fast walsh hadamard algorithms with identical sparse matrix factorization	ca_ES
dc.type	info:eu-repo/semantics/article	ca_ES
dc.identifier.doi	https://doi.org/10.1109/LSP.2006.879472
dc.relation.publisherversion	http://ieeexplore.ieee.org/
dc.rights.accessRights	info:eu-repo/semantics/closedAccess	ca_ES
dc.type.version	info:eu-repo/publishedVersion