A new fast parallel array algorithm to compute the discrete Hubert transform for radix-2 length sequences is proposed. Unlike the existing fast methods which use transforms such as the fast Fourier transform, the proposed algorithm does not require the help of any fast transforms. This array algorithm offers a suitable expression for developing a VLSI systolic array for the discrete Hubert transform. The authors propose one-dimensional and two-dimensional systolic architectures for the discrete Hubert transform. The proposed architectures have the features of massive parallelism, high pipelining, regular data flow, modular nature and local interconnections. These arrays offer high speed computation of the discrete Hubert transform for real-time signal processing applications. © IEE, 1997.