نتایج جستجو برای: channel capacity

تعداد نتایج: 488735  

Journal: :Information and Control 1971
Werner Kuich Hermann A. Maurer

The structure generating function of a language enumerates the number of distinct words contained in the language with respect to their length. Given any unambiguous tuple grammar, a method is described which yields a system of equations, whose unique solution is the structure generating function. The entropy (channel capacity) is an important information theoretic quantity associated with a la...

2001
Neil Runciman

Tele-operated Load Haul Dump (LHDs) machines are becoming a common tramming solution throughout many mines at INCO Limited in Copper Cliff, Ontario, Canada. To reach maximum productivity from multiple teleoperated LHDs, the system must achive a proper balance of LHD speed in the haulage network and haulage layout geometry. A study was inititated to determine if multiple LHDs, tramming in second...

2009
Lie-Liang Yang

❐ Gaussian channels with power-constraint; ❐ Band-limited Gaussian channels; ❐ Parallel Gaussian channels with average power-constraint (water-filling); ❐ Parallel coloured Gaussian channels with average power-constraint; ❐ Capacity of time-varying fading channels with channel state side-information; ❐ Capacity of Rayleigh fading channels with diversity and channel state side-information; ❐ Cap...

2006
Xiaodi Hou Liqing Zhang

What a human’s eye tells a human’s brain? In this paper, we analyze the information capacity of visual attention. Our hypothesis is that the limit of perceptible spatial frequency is related to observing time. Given more time, one can obtain higher resolution that is, higher spatial frequency information, of the presented visual stimuli. We designed an experiment to simulate natural viewing con...

Journal: :CoRR 2017
Jihad Fahs Aslan Tchamkerten Mansoor I. Yousefi

This paper investigates the discrete-time per-sample model of the zero-dispersion optical fiber. It is shown that the capacityachieving input distribution is unique, has (continuous) uniform phase and discrete amplitude with a finite number of mass points. The optimality of this multi-ring input holds when the channel is subject to general input cost constraints that include peak power constrai...

Journal: :IEEE Communications Letters 2023

In this paper, the problem of determining capacity a communication channel is formulated as cooperative game, between generator and discriminator, that solved via deep learning techniques. The task to produce input samples for which discriminator ideally distinguishes conditional from unconditional output samples. approach, referred (CORTICAL), provides both optimal signal distribution estimate...

Journal: :CoRR 2015
Shahid Mehraj Shah Vinod Sharma

Reliable communication imposes an upper limit on the achievable rate, namely the Shannon capacity. Wyner’s wiretap coding, which ensures a security constraint also, in addition to reliability, results in decrease of the achievable rate. To mitigate the loss in the secrecy rate, we propose a coding scheme where we use sufficiently old messages as key and for this scheme prove that multiple messa...

2001
Akbar M. Sayeed

Accurate and tractable channel modeling is critical to realizing the full potential of antenna arrays in wireless communications. In this paper we propose a framework for modeling multi-antenna multipath channels based on the notion of virtual spatial angles. The virtual angles are fixed a priori and are determined by the number of antennas at the transmitter and receiver and the spacing betwee...

2002
Peter Almers Fredrik Tufvesson Ove Edfors Andreas F. Molisch

We analyze the channel capacity of multiple-input multiple-output (MIMO) systems in frequency selective channels, with channel knowledge at the transmitter side. An optimum transmission scheme uses Shannon’s principle of waterfilling jointly in the frequency and the spatial domain. However, we show in this paper that the largest gain by using waterfilling resides in the spatial domain, and that...

2005
Chi Zhang

A general capacity formula C = sup X I(X; Y), which is correct for arbitrary single-user channels without feedback, is introduced in this tutorial. This new capacity formula is obtained by using a general channel model without any assumptions of the channel, introducing the notion of inf/sup-information/entropy rates, and finding a new tight converse bound on the error probability. In Section 1...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید