𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Multilevel coding modulation system with binary block codes

✍ Scribed by E.C.G. Wille; W. Godoy Jr.


Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
96 KB
Volume
24
Category
Article
ISSN
0140-3664

No coin nor oath required. For personal study only.

✦ Synopsis


This paper proposes an original system for the attainment of codes for multilevel coding modulation. These codes are made up of short binary block codes and are found through computer search. Some of these codes are shown here. The decoding of the proposed codes is easy, due to its binary representation. A comparison with Sayegh's and Baldini's codes is made and the decoding simulation results of some codes are shown.


πŸ“œ SIMILAR VOLUMES


Performance analysis of multilevel coded
✍ Kazuyuki Kaneda; Haruo Ogiwara πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 317 KB

In order to analytically evaluate the characteristics of the multilevel coding method using finite interleaving for a fading communication channel, an evaluation method for coding performance is proposed. In this method, the error rate of PSK after passing through a fading communication channel in w

Multilevel trellis-coded modulations for
✍ Valadon, C. ;Tafazolli, R. ;Evans, B. G. πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 318 KB

In this paper the performance of multilevel trellis-coded modulations (MTCMs) for satellite mobile multimedia systems using synchronous CDMA is investigated. A model for the multiple-access interference arising from the non-orthogonality of the spreading waveforms is developed for different modulati

Sequence matching with binary codes
✍ James H. Bradford πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 334 KB
The construction of periodically time-va
✍ Naonori Ogasahara; Manabu Kobayashi; Shigeichi Hirasawa πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 483 KB

## Abstract In 1996 Rosenthal and York proposed (time‐invariant) BCH convolutional codes [4] in which the parity check matrix of a BCH code is used in the construction of the convolutional code. The lower bound on the minimum free distance of a BCH convolutional code is guaranteed by the BCH limit.

Codes for almost block diagonal systems
✍ R.W. Brankin; I. Gladwell πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 380 KB

We present a new set of codes for solving almost block diagonal systems of linear equations and for performing multiplicative operations with matrices represented using the same data structures. These data structures arise when solving ordinary differential equation boundary value problems with non-