arXiv subjects

Naresh Sharma

Publications and source records attributed to Naresh Sharma.

23 records · Page 2Linked to original sources

arXiv2010

Entropy power inequality for a family of discrete random variables

It is known that the Entropy Power Inequality (EPI) always holds if the random variables have density. Not much work has been done to identify discrete distributions for which the inequality holds with the differential entropy replaced by the discrete entropy. Harremoës and Vignat showed that it holds for the pair (B(m,p), B(n,p)), m,n \in \mathbb{N}, (where B(n,p) is a Binomial distribution with n trials each with success probability p) for p = 0.5. In this paper, we considerably expand the set of Binomial distributions for which the inequality holds and, in particular, identify n_0(p) such that for all m,n \geq n_0(p), the EPI holds for (B(m,p), B(n,p)). We further show that the EPI holds for the discrete random variables that can be expressed as the sum of n independent identical distributed (IID) discrete random variables for large n.

cs.IT↗

arXiv2009

On the quantum f-relative entropy and generalized data processing inequalities

We study the fundamental properties of the quantum f-relative entropy, where f(.) is an operator convex function. We give the equality conditions under monotonicity and joint convexity, and these conditions are more general than, since they hold for a class of operator convex functions, and different for f(t) = -ln(t) from, the previously known conditions. The quantum f-entropy is defined in terms of the quantum f-relative entropy and we study its properties giving the equality conditions in some cases. We then show that the f-generalizations of the Holevo information, the entanglement-assisted capacity, and the coherent information also satisfy the data processing inequality, and give the equality conditions for the f-coherent information.

quant-ph↗

arXiv2008

Extensions of the quantum Fano inequality

Quantum Fano inequality (QFI) in quantum information theory provides an upper bound to the entropy exchange by a function of the entanglement fidelity. We give various Fano-like upper bounds to the entropy exchange and QFI is a special case of these bounds. These bounds also give an alternate derivation of the QFI.

quant-ph↗

arXiv2007

Space-time codes with controllable ML decoding complexity for any number of transmit antennas

We construct a class of linear space-time block codes for any number of transmit antennas that have controllable ML decoding complexity with a maximum rate of 1 symbol per channel use. The decoding complexity for $M$ transmit antennas can be varied from ML decoding of $2^{\lceil \log_2M \rceil -1}$ symbols together to single symbol ML decoding. For ML decoding of $2^{\lceil \log_2M \rceil - n}$ ($n=1,2,...$) symbols together, a diversity of $\min(M,2^{\lceil \log_2M \rceil-n+1})$ can be achieved. Numerical results show that the performance of the constructed code when $2^{\lceil \log_2M \rceil-1}$ symbols are decoded together is quite close to the performance of ideal rate-1 orthogonal codes (that are non-existent for more than 2 transmit antennas).

cs.IT↗

arXiv2006

Is the cyclic prefix necessary?

We show that one can do away with the cyclic prefix (CP) for SC-FDE and OFDM at the cost of a moderate increase in the complexity of a DFT-based receiver. Such an approach effectively deals with the decrease in the number of channel uses due to the introduction of the CP. It is shown that the SINR for SC-FDE remains the same asymptotically with the proposed receiver without CP as that of the conventional receiver with CP. The results are shown for $N_t$ transmit antennas and $N_r$ receive antennas where $N_r \geq N_t$.

cs.IT↗