Low complexity BCM for wireless applications with different codeword lengths

The aim of this paper is to present BCM (block-coded modulation) schemes suitable for simple wireless communication systems, using codewords with different lengths for different coding levels. The main purpose of this schemes is to allow for more flexibility on the choice of good asymptotic gain, low complexity and coding rate. The concept proof presented is a BCM/QPSK performance in the Gaussian and Rayleigh channels, obtained by Monte Carlo simulation. The results show that the performance of the arrays with different length codewords are better than an equivalent, equal length codeword array, using the same sub-optimum decoding algorithm. Furthermore, the serial operations number to decode the array is less, in the proposed coding scheme, compared with the conventional coding scheme