Fast communication: A block splitting technique for fast 2D Walsh transform

Authors:
Ningtao Chen;Baochang Shi;Nengchao Wang
Affiliations:
School of Computer Science & Technology, Huazhong University of Science & Technology, Wuhan 430074, PR China;Parallel Computing Institute, Huazhong University of Science & Technology, Wuhan 430074, PR China;Parallel Computing Institute, Huazhong University of Science & Technology, Wuhan 430074, PR China
Venue:
Signal Processing
Year:
2007

Citing 5
Cited 1

An Introduction to Spread-Spectrum Communications

An Introduction to Spread-Spectrum Communications
Orthogonal Transforms for Digital Signal Processing

Orthogonal Transforms for Digital Signal Processing
Fixed-Pipeline Two-Dimensional Hadamard Transform Algorithms

IEEE Transactions on Signal Processing
Fast computation of the discrete Walsh and Hadamard transforms

IEEE Transactions on Image Processing
Block wavelet transforms for image coding

IEEE Transactions on Circuits and Systems for Video Technology

Simulating data processing for an advanced ion mobility mass spectrometer

HPRCTA '07 Proceedings of the 1st international workshop on High-performance reconfigurable computing technology and applications: held in conjunction with SC07

Quantified Score

Hi-index	0.08

Visualization

Abstract

A new two-dimensional (2D) Walsh transform scheme is presented based on a block splitting technique. The advantage of the proposed approach lies in the simple data flow architecture and the reduction in array accessing operations compared with the conventional row-column (RC) scheme. The new scheme exploits adequately two local accessing properties of the cache: the time local property and the space local property. The new 2D scheme is faster than the RC scheme when applying the same one-dimensional (1D) algorithm.