Research on Compressed Sensing Algorithm Based on C-RAN Forward Link

Abstract

With the rapid development of mobile communication technology, wireless services and application scenarios are evolving toward diversification and intelligence. Large bandwidth, low latency, and massive connections are urgent needs for future network development, and traditional communication network architectures can no longer adapt. With the development of contemporary communication networks, the network architecture of C-RAN (Centralized, Cooperative, Cloud Radio Access Network) can concentrate base station processing resources, dynamically allocate transmitted signals, and have high spectrum utilization. In signal transmission, it also has the advantages of high efficiency, flexible scheduling and energy saving. However, the limited capacity of the fronthaul link under the C-RAN architecture makes signal compression and decompression especially important. This paper proposes an efficient and stable compressed sensing algorithm-a new stepwise orthogonal matching pursuit algorithm (NStOMP algorithm). First, the algorithm does not depend on the number of atoms selected in each iteration, S, and achieves stable compressed signal transmission. Secondly, it combines the idea of backtracking to filter the wrongly selected atoms in the first screening, and performs the second screening of atoms to reconstruct and restore the signal with a higher probability. This paper compares the proposed NStOMP algorithm with the improved StOMP algorithm and other common CS algorithms. The simulation results verify the stability of the proposed algorithm and its advantages compared with the reconstruction effect of common signal compression algorithms. It has better application value in the actual fronthaul network architecture.