A fast algorithm of compressed sensing

Abstract

After studying the compressed sensing theory and its main reconstruction algorithm-Matching Pursuit (MP) algorithm, this paper proposes a new approach to improve the speed of MP algorithm, and it describes how to build a Beowulf parallel computing system with 8 PCs. Its parallel computations is implemented by Message-Passing-Interface(MPI), and a 100Mb/s high speed Ethernet network interconnects all PCs. Test is made using parallel computing program to measure the parallel efficiency of the system, results show that this approach can reduce the MP algorithm computing time-cost form 78 minutes with a PC to 11 minutes with 8 PCs.