نتایج جستجو برای: shannon capacity
تعداد نتایج: 286802 فیلتر نتایج به سال:
In this paper a hierarchical classification framework using the feature-weighting tree for the objective of applying diverse weighting to acoustic features is proposed for speech recognition. The hierarchical feature-weighting tree with a flexible structure complexity can be constructed optimally with the optimal splitting for the recognition confusion graph. Based on the minimum classification...
In the paper we analyze the maximum lifetime problem in sensor networks with limited channel capacity for multipoint-to-multipoint and broadcast data transmission services. We show, that in order to achieve an optimal data transmission regarding the maximum lifetime problem we cannot allow for any interference of signals. We propose a new Signal to Interference plus Noise Ratio function and use...
The capacity of the Hopfield model has been considered as an imortant parameter in using this model. In this paper, the Hopfield neural network is modeled as a Shannon Channel and an upperbound to its capacity is found. For achieving maximum memory, we focus on the training algorithm of the network, and prove that the capacity of the network is bounded by the maximum number of the ortho...
Utilizing a cross-disciplinary approach, we explore Shannon information-theoretic characterizations of the information capacity limits generic electromagnetic (EM) surfaces intended for possible use in wireless communication links. Our principal task is to first formulate at general and rigorous level EM theory that can be extracted from Maxwellian fields radiated by an arbitrarily shaped conti...
In online educational systems we can easily collect and analyze extensive data about student learning. Current practice, however, focuses only on some aspects of these data, particularly on correctness of students answers. When a student answers incorrectly, the submitted wrong answer can give us valuable information. We provide an overview of possible applications of wrong answers and analyze ...
This paper derives a tight asymptotic upper bound on the maximum volume M∗(n, ) of length-n codes for memoryless channels subject to an average decoding error probability : M(n, ) = exp{nC − √nV Φ−1( ) + 1 2 log n + An, + o(1)} where C is Shannon capacity, V is channel dispersion, Φ is the tail probability of the normal distribution, and An, is a bounded sequence that can be explicitly identifi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید