In this paper we present a low complexity algorithm based on the bubble search sorting method that can be used to generate Turbo code interleavers that fulfill several criteria like spreading (s-randomness), code matched criteria and even the odd-even property for Turbo Trellis Coded Modulation. Simulation results show that for s < √ N /2 the algorithm is extremely efficient for short to medium interleaver lengths.
This paper investigates the performance of a new Turbo Trellis Coded Modulation scheme over correlated flat fading channels with channel interleaving. The novelty of the scheme is based on the application of a new modified transition metric incorporated in the symbol-by-symbol MAP algorithm. We consider frequency nonselective, slow Rayleigh fading channels. Extensive simulation results together with EXIT chart analysis show that the proposed scheme achieves better performance compared to the conventional transition metric when channel state information is not available at the decoder.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.