Minimizing Interferences in DS–CDMA Systems
Malek Benslama, Hadj Batatia, Abderraouf Messai · 2016
Many works have tackled minimization of interferences in CDMA systems using different techniques. This chapter presents an approach to studying convolutive codes and their processing using wavelets. Convolutive codes are applied on infinite sequences of information symbols and generate infinite sequences of coded symbols. The idea of representing a convolutive code graphically comes from the Markovian characteristics of the output of the encode. Any convolutive code is represented by three equivalent but different graphs: the code's tree, the code's trellis and the state diagram. Any convolutive code is represented by three equivalent but different graphs: the code's tree, the code's trellis and the state diagram. Decoding the channel is a much more complex function. It represents one of the major problems in communications theory. Using the concept of multi-resolution analysis, the author suggests a cascade algorithm for calculating the coefficients resulting from the breakdown on an orthonormal wavelet base.