Search results for "Block code"
showing 5 items of 15 documents
Optimal Sampling Period and Required Number of Samples for OSTBC-MIMO Rayleigh Fading Channel Capacity Simulators
2014
The purpose of this paper is to contribute to the performance assessment of channel capacity simulators. Here, we consider the instantaneous capacity (also referred to as the mutual information) in orthogonal space-time block code (OSTBC) transceiver systems over multiple-input multiple-output (MIMO) Rayleigh fading channels. To ensure that the level-crossing rate (LCR) of the instantaneous capacity can efficiently and accurately be simulated, we derive closed-form approximate solutions to the optimal sampling period and the required number of samples to be generated. Several numerical examples will be presented to illustrate the usefulness of our procedure. It will also be shown that the d…
New lower bounds for the minimum distance of generalized algebraic geometry codes
2013
Abstract In this paper, we give a new lower bound for generalized algebraic geometry codes with which we are able to construct some new linear codes having better parameters compared with the ones known in the literature. Moreover, we give a relationship between a family of generalized algebraic geometry codes and algebraic geometry codes. Finally, we propose a decoding algorithm for such a family.
On the size of transducers for bidirectional decoding of prefix codes
2012
In a previous paper [L. Giambruno and S. Mantaci, Theoret. Comput. Sci. 411 (2010) 1785–1792] a bideterministic transducer is defined for the bidirectional deciphering of words by the method introduced by Girod [ IEEE Commun. Lett. 3 (1999) 245–247]. Such a method is defined using prefix codes. Moreover a coding method, inspired by the Girod’s one, is introduced, and a transducer that allows both right-to-left and left-to-right decoding by this method is defined. It is proved also that this transducer is minimal. Here we consider the number of states of such a transducer, related to some features of the considered prefix code X . We find some bounds of such a number of states in relation wi…
Diagonal space time hadamard codes with erasure decoding algorithm
2005
A major challenge in the area of space time (ST) codes is to find codes suitable for efficient decoding, thus overcoming the problem of many existing ST code designs which require maximum-likelihood (ML) decoding. A solution could be to apply single-input single-output (SISO) channel codes and theory over temporal channel fading to the multi-input single-output (MISO) code construction and classical suboptimum decoding methods. For these purposes, an ST code construction which allows the use of efficient decoding algorithms is described. We propose a concatenated code, where the inner code is the diagonal ST Hadamard (D-STH) code with Paley constructions and the outer code is an algebraic b…
A performance study of LTE MIMO-OFDM systems using the extended one-ring MIMO channel model
2012
In this paper, we consider a long-term evolution (LTE) system for the downlink by using multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) techniques. The downlink channel is modeled by the socalled extended MIMO one-ring model. This model extends the well-known narrowband one-ring model with respect to frequency selectivity. The symbol error rate (SER) performance of the LTE MIMO-OFDM system is investigated for the downlink by employing different kinds of spatial encoders, where it is assumed that the channel state information (CSI) is perfectly known. For comparison, the space-time block coding (STBC) scheme, the vertical Bell Laboratories layered spac…