Search results for " code"

showing 10 items of 636 documents

An asymptotic approximate solution to the distribution of the capacity outage intervals in OSTBC-MIMO Rayleigh fading channels

2013

This paper deals with the study of asymptotic probability density functions (PDFs) of the outage durations of 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. The Rayleigh fading subchannels are assumed to be frequency-nonselective and mutually uncorrelated, whereas the associated Doppler power spectral density is supposed to be symmetric about the origin. In addition, the channel state information (CSI) is considered to be available only at the receiver side. Taking these assumptions into account, and drawing upon known statistical prop…

Block codeChannel capacityApproximation theoryChannel state informationStatisticsMIMOProbability distributionApplied mathematicsProbability density functionComputer Science::Information TheoryMathematicsRayleigh fading2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)
researchProduct

Exact Closed-Form Expressions for the Distribution, the Level-Crossing Rate, and the Average Duration of Fades of the Capacity of OSTBC-MIMO Channels

2009

Article from the journal: IEEE Transactions on Vehicular Technology Official site: http://dx.doi.org/10.1109/TVT.2008.927038 This paper deals with some important statistical properties of the channel capacity of multiple-input-multiple-output (MIMO) systems with orthogonal space-time block code (OSTBC) transmission. We assume that all the subchannels are uncorrelated. For OSTBC-MIMO systems, exact closed-form expressions are derived for the probability density function (PDF), the cumulative distribution function (CDF), the level-crossing rate (LCR), and the average duration of fades (ADF) of the channel capacity. Furthermore, it will be shown that these exact closed-form expressions can be …

Block codeComputer Networks and CommunicationsCumulative distribution functionMIMOAerospace EngineeringProbability density functionChannel capacitysymbols.namesakeControl theoryVDP::Technology: 500::Information and communication technology: 550::Telecommunication: 552Automotive EngineeringsymbolsApplied mathematicsProbability distributionFadingElectrical and Electronic EngineeringGaussian processComputer Science::Information TheoryMathematicsIEEE Transactions on Vehicular Technology
researchProduct

Channel Estimation and Interference Cancellation for MIMO-OFDM Systems

2007

This paper proposes a new channel estimation method and a new interference cancellation scheme for multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) systems in the presence of intersymbol interference (IS1). The proposed channel estimation method uses special training sequences (TSs) to have a desirable crest-factor of the transmitted training signal, and to prevent the influence of ISI on the channel estimation performance. By using the recommended training sequences, the ill-conditioned problem of the least square (LS) filter integrated in the proposed channel estimator can be avoided. The proposed interference cancellation scheme uses the estimated cha…

Block codeComputer Networks and Communicationsbusiness.industryOrthogonal frequency-division multiplexingComputer scienceEstimatorData_CODINGANDINFORMATIONTHEORYMIMO-OFDMInterference (wave propagation)Space–time block codeIntersymbol interferenceSignal-to-noise ratioInterference (communication)Single antenna interference cancellationChannel state informationGuard intervalDemodulationElectrical and Electronic EngineeringTelecommunicationsbusinessNyquist ISI criterionAlgorithmSoftwareComputer Science::Information TheoryCommunication channelIEICE Transactions on Communications
researchProduct

On the lattice of prefix codes

2002

AbstractThe natural correspondence between prefix codes and trees is explored, generalizing the results obtained in Giammarresi et al. (Theoret. Comput. Sci. 205 (1998) 1459) for the lattice of finite trees under division and the lattice of finite maximal prefix codes. Joins and meets of prefix codes are studied in this light in connection with such concepts as finiteness, maximality and varieties of rational languages. Decidability results are obtained for several problems involving rational prefix codes, including the solution to the primeness problem.

Block codeDiscrete mathematicsPrefix codeGeneral Computer ScienceRational languagesJoinsKraft's inequalityDecidabilityTheoretical Computer SciencePrefixCombinatoricsLattice (order)Computer Science::Formal Languages and Automata TheoryMathematicsComputer Science(all)Theoretical Computer Science
researchProduct

On the decomposition of prefix codes

2017

Abstract In this paper we focus on the decomposition of rational and maximal prefix codes. We present an effective procedure that allows us to decide whether such a code is decomposable. In this case, the procedure also produces the factors of some of its decompositions. We also give partial results on the problem of deciding whether a rational maximal prefix code decomposes over a finite prefix code.

Block codePrefix codeGeneral Computer ScienceComputer science0102 computer and information sciences02 engineering and technologyPrefix grammarKraft's inequality01 natural sciencesPrefix codeTheoretical Computer SciencePrefix codes; Finite automata; Composition of codesComposition of codes0202 electrical engineering electronic engineering information engineeringDiscrete mathematicsSelf-synchronizing codeFinite-state machineSettore INF/01 - InformaticaComputer Science (all)Rational languageLinear codePrefixComposition of code010201 computation theory & mathematicsPrefix codes020201 artificial intelligence & image processingFinite automataComputer Science::Formal Languages and Automata Theory
researchProduct

Performance Analysis of STBC-OFDM Systems in Temporally or Spatially Correlated Fading Channels

2010

This paper analyzes the performance of space-time block coded orthogonal frequency division multiplexing (OFDM) systems. In our analysis, we abandon the usually made assumption of quasi-static channel conditions. Instead of this, we consider the more general and realistic case that the channel envelope changes during two consecutive transmission time slots. In addition, we take the spatial correlation between sub-channels into account. We first present a general formal expression for the bit error probability (BEP), from which we find analytical solutions for the BEP not only for temporally fading channels but also for spatially correlated channels. The knowledge of the obtained analytical …

Block codeSpatial correlationComputer sciencebusiness.industryOrthogonal frequency-division multiplexingData_CODINGANDINFORMATIONTHEORYSpace–time block codeSignal-to-noise ratioFadingWidebandTransmission timeTelecommunicationsbusinessAlgorithmComputer Science::Information TheoryCommunication channel2010 IEEE Wireless Communication and Networking Conference
researchProduct

The Influence of Spatial Correlation and Severity of Fading on the Statistical Properties of the Capacity of OSTBC Nakagami-m MIMO Channels

2009

This paper deals with the analysis of statistical prop- erties of the capacity of spatially uncorrelated orthogonal space- time block coded (OSTBC) Nakagami-m multiple-input multiple- output (MIMO) channels. We have derived exact closed-form expressions for the probability density function (PDF), cumula- tive distribution function (CDF), level-crossing rate (LCR), and average duration of fades (ADF) of the channel capacity. We have also investigated the statistical properties of the approximated capacity of spatially correlated OSTBC Nakagami-m MIMO channels. The results are studied for different values of the fading parameter m, corresponding to different fading conditions. It is observed …

Block codeSpatial correlationCumulative distribution functionMIMONakagami distributionProbability density functionChannel capacityChannel codingChannel capacityVDP::Technology: 500::Information and communication technology: 550::Telecommunication: 552StatisticsMIMO communicationFadingComputer Science::Information TheoryMathematicsVTC Spring 2009 - IEEE 69th Vehicular Technology Conference
researchProduct

Design of efficient codes for the AWGN channel based on decomposable binary lattices

1998

This work is concerned with the use of binary decomposable lattice codes over the QAM Gaussian channel. First, we investigate the structure of such class of lattices: we derive consistency conditions for the binary codes appearing in their decomposition and express their nominal coding gain and some bounds for their error coefficient in terms of the parameters of the component codes. Then we describe a general multistage bounded‐distance decoding algorithm with low complexity and we evaluate its performance. Finally, we develop a design example and report the corresponding simulation results; as a reference some comparisons with standard TCM codes are also presented.

Block codeTheoretical computer scienceApplied MathematicsConcatenated error correction codeBinary numberLinear codeCoding gainComputer Science Applicationssymbols.namesakeAdditive white Gaussian noiseComputational Theory and MathematicssymbolsBinary codeElectrical and Electronic EngineeringAlgorithmDecoding methodsMathematics
researchProduct

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…

Block codesymbols.namesakeSpatial correlationChannel capacityControl theoryMIMOsymbolsMutual informationTransceiverGaussian processComputer Science::Information TheoryRayleigh fadingMathematics2014 IEEE 80th Vehicular Technology Conference (VTC2014-Fall)
researchProduct

Imation of land surface emissivity differences in the split-window channels of AVHRR

1994

Abstract A method for estimating the difference between the channel emissivities in NOAA-AVHRR Channels 4 and 5 is proposed and applied to a data set from the HAPEX-MOBILHY experiment. The method is based on the separation between the atmospheric and emissivity effects in the brightness temperature difference measured with AVHRR Channels 4 and 5. Atmospheric profiles coincident to the satellite overpass and a radiative transfer model are required to estimate the atmospheric correction for brightness temperatures. With this procedure, the emissivity difference Δe is obtained at the satellite spatial and spectral resolution, which has a great interest for correcting thermal images with the sp…

BrightnessAtmospheric correctionSoil ScienceGeologyAtmospheric radiative transfer codesCoincidentBrightness temperatureEmissivityAstrophysics::Solar and Stellar AstrophysicsEnvironmental scienceSatelliteComputers in Earth SciencesSpectral resolutionPhysics::Atmospheric and Oceanic PhysicsRemote sensingRemote Sensing of Environment
researchProduct