commons-issues mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Bernhard Gr├╝newaldt (JIRA) <>
Subject [jira] Updated: (MATH-215) Fast Hadamard Transform
Date Sat, 27 Dec 2008 19:34:44 GMT


Bernhard Gr├╝newaldt updated MATH-215:


Implements suggestions of Luc Maisonobe - 27/Dec/08 08:51 AM
The transform only uses two columns at a time from the matrix, wouldn't it be possible to
simply use two single dimension arrays only ?
I also think the check for n being a power of two can be done without the pow and log functions
by comparing n and Integer.highestOneBit. 

> Fast Hadamard Transform
> -----------------------
>                 Key: MATH-215
>                 URL:
>             Project: Commons Math
>          Issue Type: New Feature
>    Affects Versions: 1.0, 1.1, 1.2
>            Reporter: Daniel Kuan
>             Fix For: 2.1
>         Attachments:,
> To date, the mathematical transforms package of Commons Maths, org.apache.commons.math.transform,
only contains implementations for the Fourier, Sine, and Cosine transforms.
> This issue serves to propose and track the creation of an implementation for the Hadamard
> Definition of the hadamard transform:
> Unfortunately, Mathworld does not provide a very detailed definition.
> An elegant algorithm for the fast hadamard transform can be found here:

This message is automatically generated by JIRA.
You can reply to this email to add a comment to the issue online.

View raw message