We introduce a message passing belief propagation (BP) algorithm for factor graph over linear mod... more We introduce a message passing belief propagation (BP) algorithm for factor graph over linear models that uses messages in the form of Gaussian-like distributions. With respect to the regular Gaussian BP, the proposed algorithm adds two operations to the model, namely the wrapping and the discretization of variables. This addition requires the derivation of proper modifications of message representations and updating rules at the BP nodes. We named the new algorithm Analog-Digital-Belief-Propagation (ADBP). The ADBP allows to construct iterative decoders for mod-M ring encoders that have a complexity independent from the size of the alphabets, thus yielding efficient decoders for very high spectral efficiencies.
A/J.r(r[/(t-IH this palm, Me Prqrosc ti UOVCI n~elhod to dcsigij scria] colIculcnation of an oolc... more A/J.r(r[/(t-IH this palm, Me Prqrosc ti UOVCI n~elhod to dcsigij scria] colIculcnation of an oolcr convolutirmal code with an iuucr Ircllis code uilll molli.
ABSTRACT In this paper we propose new decoding algorithms to be embedded in the iterative decodin... more ABSTRACT In this paper we propose new decoding algorithms to be embedded in the iterative decoding strategy of parallel con-catenated convolutional codes. They are derived from the optimum maximum-a-posteriori algorithm and permit a con-tinuous decoding of the ...
Concatenated coding schemes consist of the combination of two or more simple constituent encoders... more Concatenated coding schemes consist of the combination of two or more simple constituent encoders and interleavers. The parallel concatenation known as "turbo code" has been shown to yield remarkable coding gains close to theoretical limits, yet admitting a relatively simple iterative decoding technique. The recently proposed serial concatenation of interleaved codes may offer superior performance to that of turbo codes. In both coding schemes, the core of the iterative decoding structure is a soft-input soft-output (SISO) a posteriori probability (APP) module. In this letter, we describe the SISO APP module that updates the APP's corresponding to the input and the output bits, of a code, and show how to embed it into an iterative decoder for a new hybrid concatenation of three codes, to fully exploit the benefits of the proposed SISO APP module.
Performance evaluation of turbo codes. [Electronics Letters 31, 163 (1995)]. S. Benedetto, G. Mon... more Performance evaluation of turbo codes. [Electronics Letters 31, 163 (1995)]. S. Benedetto, G. Montorsi. Abstract. Parallel concatenated coding schemes employing convolutional codes as constituent codes linked by an interleaver ...
In this letter, we propose and compare some design criteria for the search of good rate-compatibl... more In this letter, we propose and compare some design criteria for the search of good rate-compatible systematic turbo codes (RCPTC) families. The considerations presented by Benedetto et al. to find "best" component encoders for turbo-code construction are extended to find good ...
1 CHRISTMAS, wJ, KITLER, J., and PETROU, M : 'Non-iterative cont... more 1 CHRISTMAS, wJ, KITLER, J., and PETROU, M : 'Non-iterative contextual correspondence matching'. Computer Vision - ECCV'94, 1994, (Springer-Verlag, Stockholm, Sweden), 2, pp. 137-142 2 CHRISTMAS, WJ , KITTLER, J., and PETROU, M : 'Matching in computer ...
We introduce a message passing belief propagation (BP) algorithm for factor graph over linear mod... more We introduce a message passing belief propagation (BP) algorithm for factor graph over linear models that uses messages in the form of Gaussian-like distributions. With respect to the regular Gaussian BP, the proposed algorithm adds two operations to the model, namely the wrapping and the discretization of variables. This addition requires the derivation of proper modifications of message representations and updating rules at the BP nodes. We named the new algorithm Analog-Digital-Belief-Propagation (ADBP). The ADBP allows to construct iterative decoders for mod-M ring encoders that have a complexity independent from the size of the alphabets, thus yielding efficient decoders for very high spectral efficiencies.
A/J.r(r[/(t-IH this palm, Me Prqrosc ti UOVCI n~elhod to dcsigij scria] colIculcnation of an oolc... more A/J.r(r[/(t-IH this palm, Me Prqrosc ti UOVCI n~elhod to dcsigij scria] colIculcnation of an oolcr convolutirmal code with an iuucr Ircllis code uilll molli.
ABSTRACT In this paper we propose new decoding algorithms to be embedded in the iterative decodin... more ABSTRACT In this paper we propose new decoding algorithms to be embedded in the iterative decoding strategy of parallel con-catenated convolutional codes. They are derived from the optimum maximum-a-posteriori algorithm and permit a con-tinuous decoding of the ...
Concatenated coding schemes consist of the combination of two or more simple constituent encoders... more Concatenated coding schemes consist of the combination of two or more simple constituent encoders and interleavers. The parallel concatenation known as "turbo code" has been shown to yield remarkable coding gains close to theoretical limits, yet admitting a relatively simple iterative decoding technique. The recently proposed serial concatenation of interleaved codes may offer superior performance to that of turbo codes. In both coding schemes, the core of the iterative decoding structure is a soft-input soft-output (SISO) a posteriori probability (APP) module. In this letter, we describe the SISO APP module that updates the APP's corresponding to the input and the output bits, of a code, and show how to embed it into an iterative decoder for a new hybrid concatenation of three codes, to fully exploit the benefits of the proposed SISO APP module.
Performance evaluation of turbo codes. [Electronics Letters 31, 163 (1995)]. S. Benedetto, G. Mon... more Performance evaluation of turbo codes. [Electronics Letters 31, 163 (1995)]. S. Benedetto, G. Montorsi. Abstract. Parallel concatenated coding schemes employing convolutional codes as constituent codes linked by an interleaver ...
In this letter, we propose and compare some design criteria for the search of good rate-compatibl... more In this letter, we propose and compare some design criteria for the search of good rate-compatible systematic turbo codes (RCPTC) families. The considerations presented by Benedetto et al. to find "best" component encoders for turbo-code construction are extended to find good ...
1 CHRISTMAS, wJ, KITLER, J., and PETROU, M : 'Non-iterative cont... more 1 CHRISTMAS, wJ, KITLER, J., and PETROU, M : 'Non-iterative contextual correspondence matching'. Computer Vision - ECCV'94, 1994, (Springer-Verlag, Stockholm, Sweden), 2, pp. 137-142 2 CHRISTMAS, WJ , KITTLER, J., and PETROU, M : 'Matching in computer ...
Uploads
Papers by Guido Montorsi