Search results for "Computer Science::Information Theory"

showing 10 items of 272 documents

On the spectral moments of non-WSSUS mobile-to mobile double-Rayleigh fading channels

2017

This paper deals with the mathematical analysis of the spectral moments of non-wide-sensestationary uncorrelated-scattering (non-WSSUS) mobile-to-mobile (M2M) double-Rayleigh fading channels. The point of departure is a recently proposed geometry-based statistical model (GBSM) for M2M double-Rayleigh fading channels from which general analytical expressions are derived for the average Doppler shift, Doppler spread, average delay, and delay spread. Closed-form solutions of such expressions are presented for the particular case of the geometrical two-rings scattering model. The obtained results indicate that the average Doppler shift and Doppler spread are directly influenced by not only the …

Carrier signalComputer scienceScatteringBandwidth (signal processing)020206 networking & telecommunications020302 automobile design & engineering02 engineering and technologyCommunications systemDelay spreadsymbols.namesake0203 mechanical engineeringComputer Science::Networking and Internet Architecture0202 electrical engineering electronic engineering information engineeringsymbolsFadingStatistical physicsDoppler effectComputer Science::Information TheoryRayleigh fadingCommunication channel2017 IEEE 28th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)
researchProduct

On the statistical properties of the capacity of OSTBC Nakagami-lognormal MIMO channels

2010

This article presents a thorough statistical analysis of the capacity of orthogonal space-time block coded (OSTBC) Nakagami-lognormal (NLN) multiple-input multipleoutput (MIMO) channels. The NLN channel model allows to study the joint effects of fast fading and shadowing on the statistical properties of the channel capacity. We have derived exact analytical expressions for the probability density function (PDF), cumulative distribution function (CDF), level-crossing rate (LCR), and average duration of fades (ADF) of the capacity of NLN MIMO channels. It is observed that an increase in the MIMO dimension1 or a decrease in the severity of fading results in an increase in the mean channel capa…

Channel capacityCumulative distribution functionMIMOLog-normal distributionStatisticsFadingNakagami distributionProbability density functionStandard deviationComputer Science::Information TheoryMathematics2010 4th International Conference on Signal Processing and Communication Systems
researchProduct

The Influence of the Severity of Fading and Shadowing on the Statistical Properties of the Capacity of Nakagami-Lognormal Channels

2008

This paper deals with the study of the statistical properties of the capacity of Nakagami-lognormal (NLN) channels for various fading environments. Specifically, the impact of shadowing and the severity of fading on the channel capacity is investigated. We have derived analytical expressions for the probability density function (PDF), cumulative distribution function (CDF), level-crossing rate (LCR), and average duration of fades (ADF) of the channel capacity. These results are analyzed for different levels of shadowing and for various fading conditions, corresponding to different terrestrial environments. It is observed that the severity of fading and shadowing has a significant influence …

Channel capacityFading distributionComputer scienceCumulative distribution functionLog-normal distributionStatisticsNakagami distributionFadingComputer Science::Information TheoryCommunication channelRayleigh fadingIEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference
researchProduct

On the statistical properties of the capacity of double Hoyt fading channels

2010

The statistical properties of the capacity of narrowband double Hoyt fading channels are studied. Toward this end, analytical expressions for the probability density function (PDF) and cumulative distribution function (CDF) of the instantaneous channel capacity process are derived. Furthermore, for the characterization of the dynamical behavior of the time-varying channel capacity, expressions are provided for the level-crossing rate (LCR) and the average duration of fades (ADF). Since the double Rayleigh fading channel is a special case of the double Hoyt model, it is shown that the derived expressions can be reduced to the corresponding results already known for the capacity of the double…

Channel capacityFading distributionNarrowbandChannel state informationCumulative distribution functionMIMOComputer Science::Networking and Internet ArchitectureElectronic engineeringFadingStatistical physicsComputer Science::Information TheoryRayleigh fadingMathematics2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)
researchProduct

Channel capacity of fading channels for differentially encoded transmission

1999

The capacity of flat fading channels when applying differential encoding with noncoherent reception and no channel state information available at the receiver is considered. Numerical results indicate the gains achievable by multiple symbol detection in the case of slowly time-varying channels and provide a comparison between schemes with different potential bandwidth efficiencies.

Channel capacitySpatial correlationComputer scienceChannel state informationBandwidth (signal processing)Electronic engineeringFadingData_CODINGANDINFORMATIONTHEORYElectrical and Electronic EngineeringDifferential codingPrecodingComputer Science::Information TheoryCommunication channelElectronics Letters
researchProduct

Statistical properties of the capacity of multipath fading channels

2009

It is well known that a frequency-nonselective multipath fading channel can be modeled by a sum of complex sinusoids, also called sum-of-cisoids (SOC). By using the SOC, we can efficiently model the scattered component of the received signal in non-isotropic scattering environments. Such SOC-based multipath channel models provide the flexibility of having correlated in-phase and quadrature phase components of the received signal. This paper presents the derivation and analysis of the statistical properties of the capacity of multipath fading channels under LOS conditions. As an appropriate stochastic model for the multipath fading channel, we have adopted the SOC model. We have derived the …

Channel capacityStochastic modellingComputer scienceCumulative distribution functionStatisticsAlgorithmRandom variableMultipath propagationComputer Science::Information TheoryCommunication channel2009 IEEE 20th International Symposium on Personal, Indoor and Mobile Radio Communications
researchProduct

On the Trustworthiness of Error-Correcting Codes

2007

The use of error-correcting codes protects data against accidental or intentional errors, but to what extent can a decoded message be trusted? To answer this question, one has to take the role of the receiver. First, the maximum number of errors Lambda acceptable for decoding is fixed. With the weight distribution, the probability of false decoding can be calculated, conditioned on such a Lambda-bounded strategy. This probability is a monotonously increasing function in the channel error probability p and in the maximum number of accepted errors Lambda. Therefore, pure error detection is more trustworthy than error correction. Moreover, for sufficiently small p, codes with the lexicographic…

Channel codeTheoretical computer scienceComputer scienceContext (language use)Function (mathematics)Library and Information SciencesError detection and correctionAlgorithmDecoding methodsComputer Science::Information TheoryComputer Science ApplicationsInformation SystemsCommunication channelIEEE Transactions on Information Theory
researchProduct

Analog joint source-channel Multiple Description coding scheme over AWGN parallel channels

2011

We propose a low complexity analog joint source channel coding Multiple Description (MD) scheme for transmitting the symbols of a Gaussian source across a pair of independent AWGN channels. The outputs of these channels have each a separated receiver, whereas a third receiver has both outputs available. At the transmitter side, a pair of bandwidth-reduction analog mappings are used for joint source-channel coding. The presented scheme has the inherent advantage over digital MD schemes based on separation, that coding and decoding can be performed by using a single-letter (or symbol), a strategy that is very suitable for applications where latency originated by the digital compression and th…

Channel codeTheoretical computer scienceComputer scienceMultiple description codingVariable-length codeData_CODINGANDINFORMATIONTHEORYsymbols.namesakeShannon–Fano codingAdditive white Gaussian noisesymbolsAlgorithmDecoding methodsComputer Science::Information TheoryCommunication channelData compression2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
researchProduct

Multi-channel chromatic transformations for nonlinear color pattern recognition

2002

We present a new approach for color pattern recognition based on multi-channel nonlinear correlations. High discrimination capability is obtained in comparison with common linear multi-channel detection methods. We apply the nonlinear morphological correlation to different color channel decompositions as RGB and ATD channels. Moreover, in order to improve the discrimination we have introduced a new color transformation. When a high selectivity is required, the combination of the nonlinear correlation and the new color decomposition yields to detect the object using just a single channel. Simulation results are provided.

Color histogramChannel (digital image)business.industryComputer scienceColor imageColor normalizationComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONColor balancePattern recognitionImage processingHSL and HSVColor spaceAtomic and Molecular Physics and OpticsElectronic Optical and Magnetic MaterialsOpticsRGB color modelArtificial intelligenceElectrical and Electronic EngineeringPhysical and Theoretical ChemistrybusinessComputer Science::Information TheoryOptics Communications
researchProduct

An algorithm for the solution of tree equations

1997

We consider the problem of solving equations over k-ary trees. Here an equation is a pair of labeled α-ary trees, where α is a function associating an arity to each label. A solution to an equation is a morphism from α-ary trees to k-ary trees that maps the left and right hand side of the equation to the same k-ary tree.

CombinatoricsMorphismBinary treeBranch and boundSearch algorithmTree (set theory)Function (mathematics)ArityComputer Science::Information TheoryMathematicsEquation solving
researchProduct