Gholamali Aminian
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Gholamali Aminian has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Amin Gohari
The Chinese University of Hong Kong
2 shared publications - Mahtab Mirmohseni
5/6GIC, Institute for Communication Systems (ICS), University of Surrey, Guildford, U.K.
2 shared publications - Masoumeh Nasiri-Kenari
Department of Electrical Engineering, Sharif University of Technology, Tehran, Iran
2 shared publications Hamid G. Bafghi
Department of Electrical Engineering, Sharif University of Technology, Tehran, Iran
1 shared publication- Hamid Ghourchian
Department of Intelligent Systems Division of Information Sci- ence and Engineering KTH Royal Institute of Technology 10044 Stockholm Sweden
1 shared publication
Latest Publications
- 29 August 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 64 (12) , 7828-7846
On the Capacity of a Class of Signal-Dependent Noise Channels
In some applications, the variance of additive measurement noise depends on the signal that we aim to measure. For instance, additive signal-dependent Gaussian noise (ASDGN) channel models are used in molecular and optical communication. Herein we provide lower and upper bounds on the capacity of additive signal-dependent noise (ASDN) channels. The first lower bound is based on an extension of majorization inequalities, and the second lower bound utilizes properties of the differential entropy. The lower bounds are valid for arbitrary additive signaldependent noise (ASDN) channels. The upper bound is based on a previous idea of the authors (“symmetric relative entropy”) and is applied to the additive signal-dependent Gaussian noise (ASDGN) channels. These bounds indicate that in the ASDN channels (unlike the classical AWGN channels), the capacity does not necessarily become larger by reducing the noise variance function. We also provide sufficient conditions under which the capacity becomes infinite. This is complemented by some conditions implying that the capacity is finite, and a unique capacity achieving measure exists (in the sense of the output measure).
- 29 August 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 64 (12) , 7828-7846
On the Capacity of a Class of Signal-Dependent Noise Channels
In some applications, the variance of additive measurement noise depends on the signal that we aim to measure. For instance, additive signal-dependent Gaussian noise (ASDGN) channel models are used in molecular and optical communication. Herein we provide lower and upper bounds on the capacity of additive signal-dependent noise (ASDN) channels. The first lower bound is based on an extension of majorization inequalities, and the second lower bound utilizes properties of the differential entropy. The lower bounds are valid for arbitrary additive signaldependent noise (ASDN) channels. The upper bound is based on a previous idea of the authors (“symmetric relative entropy”) and is applied to the additive signal-dependent Gaussian noise (ASDGN) channels. These bounds indicate that in the ASDN channels (unlike the classical AWGN channels), the capacity does not necessarily become larger by reducing the noise variance function. We also provide sufficient conditions under which the capacity becomes infinite. This is complemented by some conditions implying that the capacity is finite, and a unique capacity achieving measure exists (in the sense of the output measure).
- 1 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Molecular, Biological, and Multi-Scale Communications
- Vol. 4 (2) , 61-72
Diffusion-Based Molecular Communication With Limited Molecule Production Rate
This paper studies the impact of a transmitter's molecule generation process on the capacity of a concentration-based molecular communication (MC) system. Constraints caused by the molecule generation process affect the availability of the molecules at the transmitter. The transmitter has a storage of molecules, and should decide whether to release or save the currently produced molecules. As a result, the MC system has conceptual connections with energy harvesting systems. In this paper, we consider two scenarios on the propagation channel. The first scenario assumes a channel with no inter-symbol interference (ISI), i.e., a memoryless channel. We derive bounds on the capacity of the MC system in this scenario. The second scenario assumes an MC channel with ISI, in which the output of the channel depends on the history of released molecules in the previous time-slots. Based on the assumptions that either the transmitter or the receiver knows the channel statistics, we compute a lower bound on the channel capacity.
- 1 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Molecular, Biological, and Multi-Scale Communications
- Vol. 4 (2) , 61-72
Diffusion-Based Molecular Communication With Limited Molecule Production Rate
This paper studies the impact of a transmitter's molecule generation process on the capacity of a concentration-based molecular communication (MC) system. Constraints caused by the molecule generation process affect the availability of the molecules at the transmitter. The transmitter has a storage of molecules, and should decide whether to release or save the currently produced molecules. As a result, the MC system has conceptual connections with energy harvesting systems. In this paper, we consider two scenarios on the propagation channel. The first scenario assumes a channel with no inter-symbol interference (ISI), i.e., a memoryless channel. We derive bounds on the capacity of the MC system in this scenario. The second scenario assumes an MC channel with ISI, in which the output of the channel depends on the history of released molecules in the previous time-slots. Based on the assumptions that either the transmitter or the receiver knows the channel statistics, we compute a lower bound on the channel capacity.