Multiuser Data Separation for Short Message Service using ICA

摘要

This paper presents a new algorithm for efficient separation of short messages which are mixed in a multi user short message system. Separation of mixed random binary sequences of data is more difficult than normal sequences. The proposed algo­rithm applies Kullback leibler independent compo­nent analysis over mixed binary sequences of received data. To make ICA sufficient for separation of mixed binary sequences, a random binary tail is inserted after multiuser SMS data at the transmitter side. The random binary tail helps to increase the data length and it makes the ICA more efficient. In this paper, we explain how technically this process is done. This paper presents a new algorithm for efficient separation of short messages which are mixed in a multi user short message system. Separation of mixed random binary sequences of data is more difficult than normal sequences. The proposed algorithm applies Kullback leibler independent component analysis over mixed binary sequences of received data. To make ICA sufficient for separation of mixed binary sequences, a random binary tail is inserted after multiuser SMS data at the transmitter side. The random binary tail helps to increase the data length and it makes the ICA more efficient. In this paper, we explain how technically this process is done.