A new general criterion for the optimal design of (possibly) time-varying and nonlinear trellis-codes for reliable transmission of digital information sequences over arbitrary (possibly) time-varying Discrete Memoryless Channels (DMCs) is presented. The criterion is derived on the basis of new tight generally time-varying analytical upper bounds developed for the performance evaluation of MAP decoders with finite decoding constraint-lengths which minimise the symbol-error probability. New procedures related to the proposed criterion are also presented, allowing a direct construction of good trellis-codes for any arbitrary DMC and for any assigned value of the decoding constraint-length
A novel general approach to the optimal synthesis of Trellis codes for arbitrary noisy discrete memoryless channels / R., Cusani; Piazzo, Lorenzo. - (1995), pp. 66-68. (Intervento presentato al convegno IEEE Int. Symp. on Information Theory (ISIT95) tenutosi a Whistler, Canada nel Settembre) [10.1109/ISIT.1995.531170].
A novel general approach to the optimal synthesis of Trellis codes for arbitrary noisy discrete memoryless channels
E. BACCARELLI;R. CUSANI;PIAZZO, Lorenzo
1995
Abstract
A new general criterion for the optimal design of (possibly) time-varying and nonlinear trellis-codes for reliable transmission of digital information sequences over arbitrary (possibly) time-varying Discrete Memoryless Channels (DMCs) is presented. The criterion is derived on the basis of new tight generally time-varying analytical upper bounds developed for the performance evaluation of MAP decoders with finite decoding constraint-lengths which minimise the symbol-error probability. New procedures related to the proposed criterion are also presented, allowing a direct construction of good trellis-codes for any arbitrary DMC and for any assigned value of the decoding constraint-lengthI documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
