Learn More
—We propose the use of punctured turbo codes for compression of correlated binary sources. Compression is achieved because of puncturing. The resulting performance is close to the theoretical limit provided by the Slepian–Wolf theorem. No information about the correlation between sources is required in the encoding process. The proposed source decoder(More)
—In this letter, we propose the use of punctured turbo codes to perform near-lossless compression and joint source-channel coding of binary memoryless sources. Compression is achieved by puncturing the turbo code to the desired rate. No information about the source distribution is required in the encoding process. Moreover, the source parameters do not need(More)
We propose a coding scheme based on the use of systematic linear codes with low-density generator matrix (LDGM codes) for channel coding and joint source-channel coding of multi-terminal correlated binary sources. In both cases, the structures of the LDGM encoder and decoder are shown, and a concatenated scheme aimed at reducing the error floor is proposed.(More)
With the development of microarray techniques, there is an increasing need of information processing methods to analyze the high throughput data. Clustering is one of the most promising candidates because of its simplicity, flexibility and robustness. However, there is no "perfect" clustering approach outperforming its counterparts, and it is hard to(More)
—Recently, analog joint source-channel coding has been proposed as a means of achieving near-optimum performance for high data rates with a very low complexity. However, no experimental evaluation showing the practical feasibility of this scheme has been performed to date. In this paper, we describe a software-defined radio implementation of an analog joint(More)