A New Upper Bound for Free Space Optical Channel Capacity Using a Simple Mathematical in Equality
Journal Title: Journal of Information Systems and Telecommunication - Year 2013, Vol 1, Issue 1
Abstract
In this paper, by using a simple mathematical inequality, we derive a $ new upper bound fkr the capacity of$ free space optical channel in coherent case. Then, by applying general fading distribution, we obtain an upper bound for mutual information in non-coherent case. Finally, we derive the corresponding optimal input distributions for both coherent and non-coherent cases, compare the results with previous works numerically and illustrate that our results subsume some of previous results in special cases.
Authors and Affiliations
Arezu Rezazadeh, Ghosheh Abed Hodtani
Keywords
Related Articles
- EP ID EP190117
- DOI 10.7508/jist.2013.01.001
- Views 144
- Downloads 0
A Fast and Accurate Sound Source Localization Method using Optimal Combination of SRP and TDOA Methodologies
This paper presents an automatic sound source localization approach based on combination of the basic time delay estimation sub method namely, Time Difference of Arrival (TDOA), and Steered Response Power (SRP) methods....
Parameter Estimation in Hysteretic Systems Based on Adaptive Least-Squares
In this paper, various identification methods based on least-squares technique to estimate the unknown parameters of structural systems with hysteresis are investigated. The Bouc-Wen model is used to describe the behavio...
Trust evaluation in unsupervised network: A fuzzy logic approach
Because of the possibility of anonymity and impersonation in social networks, trust plays an important role in these networks. Pear to pear networks, by eliminating the supervisor roles, besides its benefit in decreasing...
A Linear Model for Energy-Aware Scheduling Problem Considering Interference in Real-time Wireless Sensor Networks
An important factor in increasing quality of service in real-time wireless networks is minimizing energy consumption, which contradicts with increasing message delivery rate because of associating a time deadline to each...
Active Steganalysis of Transform Domain Steganography Based on Sparse Component Analysis
This paper presents a new active steganalysis method to break the transform domain steganography. Most of steganalysis techniques focus on detecting the presence or absence of a secret message in a cover (passive stegana...