Great news!! A fast, butterfly (aka FFT-like), implementation of the Noiselet Transform [1] is now integrated into the LazyLinop toolbox [2] – “a python toolbox to ease and accelerate computations with (“matrix-free”) linear operators.” Thank you to Pascal Carrivain and Rémi Gribonval from the OCKHAM/INRIA team [3], in ENS Lyon, France (where I’m currently invited for a sabbatical year in 25-26) for this implementation. The idea came from common discussions we had together (I share my office with Pascal at ENS Lyon) about possible additional butterfly transformations to complete the (already long) list of operators integrated to LazyLinop. The whole Noiselet Tansform (and its inverse) is described here in the LazyLinop documentation, with a demonstration code in python. Enjoy!
---
[1] https://laurentjacques.gitlab.io/post/some-comments-on-noiselets/
[2] https://faustgrp.gitlabpages.inria.fr/lazylinop/index.html "Lazylinop is a python toolbox to ease and accelerate computations with (“matrix-free”) linear operators. It provides glue to combine linear operators as easily as NumPy arrays, PyTorch/CuPy compatibility, standard signal/image processing linear operators, as well as advanced tools to approximate large matrices by efficient butterfly operators."
[3] https://team.inria.fr/ockham/
#Noiselet #CompressiveSensing #Butterfly #fft #InverseProblem #Python #Numeric #PyTorch

Some comments on the Noiselet Transform (special "LazyLinopt update") | Laurent Jacques
Updates: (22/04/26) Great news!! A fast, butterfly (aka FFT-like), implementation of the Noiselet Transform (see below) is now integrated into the LazyLinop toolbox – “a python toolbox to ease and accelerate computations with (“matrix-free”) linear operators.



