Browsing by Subject "Asymptotic behaviors"

Now showing 1 - 2 of 2

Open Access
On the capacity of MIMO systems with amplitude-limited inputs
(IEEE, 2014) Elmoslimany, A.; Duman, Tolga M.
In this paper, we study the capacity of multiple-input multiple-output (MIMO) systems under the constraint that amplitude-limited inputs are employed. We compute the channel capacity for the special case of multiple-input singleo-utput (MISO) channels, while we are only able to provide upper and lower bounds on the capacity of the general MIMO case. The bounds are derived by considering an equivalent channel via singular value decomposition, and by enlarging and reducing the corresponding feasible region of the channel input vector, for the upper and lower bounds, respectively. We analytically characterize the asymptotic behavior of the derived capacity upper and lower bounds for high and low noise levels, and study the gap between them. We further provide several numerical examples illustrating their computation.
Open Access
An upper bound on the capacity of non-binary deletion channels
(IEEE, 2013) Rahmati, M.; Duman, Tolga M.
We derive an upper bound on the capacity of non-binary deletion channels. Although binary deletion channels have received significant attention over the years, and many upper and lower bounds on their capacity have been derived, such studies for the non-binary case are largely missing. The state of the art is the following: as a trivial upper bound, capacity of an erasure channel with the same input alphabet as the deletion channel can be used, and as a lower bound the results by Diggavi and Grossglauser in [1] are available. In this paper, we derive the first non-trivial non-binary deletion channel capacity upper bound and reduce the gap with the existing achievable rates. To derive the results we first prove an inequality between the capacity of a 2K-ary deletion channel with deletion probability d, denoted by C2K(d), and the capacity of the binary deletion channel with the same deletion probability, C2(d), that is, C2K(d) ≤ C2(d)+(1-d) log(K). Then by employing some existing upper bounds on the capacity of the binary deletion channel, we obtain upper bounds on the capacity of the 2K-ary deletion channel. We illustrate via examples the use of the new bounds and discuss their asymptotic behavior as d → 0. © 2013 IEEE.