Loading...
Search for:
channel-inputs
0.006 seconds
Deterministic multiple access wiretap channel
, Article Proceedings 2010 IEEE International Conference on Information Theory and Information Security, ICITIS 2010, 17 December 2010 through 19 December 2010, Beijing ; 2010 , Pages 998-1001 ; 9781424469406 (ISBN) ; Salimi, S ; Salmasizadeh, M ; Sharif University of Technology
2010
Abstract
Two-user Multiple Access Channel with a Wire- Tapper (MAC-WT) is considered. A general outer bound for the secrecy capacity region is given. Also, we have defined the Deterministic MAC-WT, where the channel input of each user is a deterministic function of the channel output and the channel input of the other user. For this network single-letter inner and outer bounds for the secrecy capacity region are given. Furthermore, it is shown that in the Deterministic MAC-WT, if the wiretapper channel is a degraded version of the main channel, inner and outer bounds meet and the secrecy capacity region is characterized
A learning automata-based adaptive uniform fractional guard channel algorithm
, Article Journal of Supercomputing ; Volume 71, Issue 3 , 2015 , Pages 871-893 ; 09208542 (ISSN) ; Meybodi, M. R ; Sharif University of Technology
Kluwer Academic Publishers
2015
Abstract
In this paper, we propose an adaptive call admission algorithm based on learning automata. The proposed algorithm uses a learning automaton to specify the acceptance/rejection of incoming new calls. It is shown that the given adaptive algorithm converges to an equilibrium point which is also optimal for uniform fractional channel policy. To study the performance of the proposed call admission policy, the computer simulations are conducted. The simulation results show that the level of QoS is satisfied by the proposed algorithm and the performance of given algorithm is very close to the performance of uniform fractional guard channel policy which needs to know all parameters of input traffic....
Unified approach to the capacity evaluation of the relay channel
, Article IET Communications ; Volume 3, Issue 7 , 2009 , Pages 1208-1215 ; 17518628 (ISSN) ; Aref, M. R ; Sharif University of Technology
2009
Abstract
The authors indicate the dependence between the inputs of the relay channel with one auxiliary random variable as Cover, El-Gamal and Salehi have done for the multiple access channel with arbitrarily correlated sources. Then, by considering broadcast and multiple access sub-channels in the relay channel, the authors describe the essential role of the relay with special Markovity conditions on the auxiliary random variable and channel input-outputs, and unify most of known capacity theorems into one capacity theorem. The capacity theorem potentially may be applicable to a more general class of relay channels including at least the relay channels with known capacity. © The Institution of...
Transmission of a bit over a discrete poisson channel with memory
, Article IEEE Transactions on Information Theory ; Volume 67, Issue 7 , 2021 , Pages 4710-4727 ; 00189448 (ISSN) ; Gohari, A ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc
2021
Abstract
A coding scheme for transmission of a bit maps a given bit to a sequence of channel inputs (called the codeword associated with the transmitted bit). In this paper, we study the problem of designing the best code for a discrete Poisson channel with memory (under peak-power and total-power constraints). The outputs of a discrete Poisson channel with memory are Poisson distributed random variables with a mean comprising of a fixed additive noise and a linear combination of past input symbols. Assuming a maximum-likelihood (ML) decoder, we search for a codebook that has the smallest possible error probability. This problem is challenging because error probability of a code does not have a...
Transmission of a bit over a discrete Poisson channel with memory
, Article 2020 IEEE Information Theory Workshop, ITW 2020, 11 April 2021 through 15 April 2021 ; 2021 ; 9781728159621 (ISBN) ; Gohari, A ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc
2021
Abstract
A coding scheme for transmission of a bit maps a given bit to a sequence of channel inputs (called the codeword associated to the transmitted bit). In this paper, we study the problem of designing the best code for a discrete Poisson channel with memory (under peak-power and total-power constraints). The outputs of a discrete Poisson channel with memory are Poisson distributed random variables with a mean comprising a fixed additive noise and a linear combination of past input symbols. Assuming a maximum-likelihood (ML) decoder, we find the best codebook design by minimizing the error probability of the decoder over all codebooks. For the case of having only a total-power constraint, the...
Transmission of a bit over a discrete poisson channel with memory
, Article IEEE Transactions on Information Theory ; Volume 67, Issue 7 , 2021 , Pages 4710-4727 ; 00189448 (ISSN) ; Gohari, A ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc
2021
Abstract
A coding scheme for transmission of a bit maps a given bit to a sequence of channel inputs (called the codeword associated with the transmitted bit). In this paper, we study the problem of designing the best code for a discrete Poisson channel with memory (under peak-power and total-power constraints). The outputs of a discrete Poisson channel with memory are Poisson distributed random variables with a mean comprising of a fixed additive noise and a linear combination of past input symbols. Assuming a maximum-likelihood (ML) decoder, we search for a codebook that has the smallest possible error probability. This problem is challenging because error probability of a code does not have a...
Transmission of a bit over a discrete Poisson channel with memory
, Article 2020 IEEE Information Theory Workshop, ITW 2020, 11 April 2021 through 15 April 2021 ; 2021 ; 9781728159621 (ISBN) ; Gohari, A ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc
2021
Abstract
A coding scheme for transmission of a bit maps a given bit to a sequence of channel inputs (called the codeword associated to the transmitted bit). In this paper, we study the problem of designing the best code for a discrete Poisson channel with memory (under peak-power and total-power constraints). The outputs of a discrete Poisson channel with memory are Poisson distributed random variables with a mean comprising a fixed additive noise and a linear combination of past input symbols. Assuming a maximum-likelihood (ML) decoder, we find the best codebook design by minimizing the error probability of the decoder over all codebooks. For the case of having only a total-power constraint, the...