Symbol decoding based on signal subspace decomposition in MSK

Abstract

The availability of fast processors with architectures tailored to meet the computational demand of digital signal processing algorithms is widely applied to demodulation and decodification of CPM signals in some scenes: Mobiles, AWGN channels,... In this application the number of floating point operations executed by each processed symbol is a critical parameter to be designed, this is to be minimized. In this paper a method that reduces significantly the number of operations (until 80%) by symbol for CPM signals is presented. The decodification stage is performed from the rank reduced signal subspace obtained by means of an orthogonal decomposition of the signal [1].