作者: Barzan Mozafari , Mohammad H. Savoji
DOI: 10.1109/ISSPA.2007.4555315
关键词: Sliding window protocol 、 Algorithm 、 Digital signal processing 、 Sequence 、 Signal processing 、 Algorithm design 、 Mathematics 、 Hadamard transform 、 Fast Walsh–Hadamard transform 、 Walsh function
摘要: Walsh-Hadamard transform (WHT) has many applications in digital signal processing including bioinformatics. While there are efficient algorithms for implementing this such as fast WHT (FWHT), performing continuously on a sliding window over long sequence is time consuming. As it not reasonable to compute separate upon arrival of every new sample, another implementation named running (RWHT) been introduced (G. Deng and A. Ling, 1996) which needs have some update vectors pre-calculated. In paper we report an recursive algorithm find these vectors. Also propose easy-to-compute explicit formula computing coefficients computation independent the vector size. A proof comparison between proposed based also given.