In this paper, we have investigated the marginal moment generating function (MMGF) for the correlated Nakagami-m fading channel by using maximal-ratio combining (MRC) diversity scheme at receiver for the computation of channel capacity for various adaptive transmission schemes such as: 1) optimal simultaneous power and rate adaptation, 2) optimal rate adaptation with constant transmit power, 3)...

By considering quantum computation as a communication process, we relate its efficiency to its classical communication capacity. This formalism allows us to derive lower bounds on the complexity of search algorithms in the most general context. It enables us to link the mixedness of a quantum computer to its efficiency and also allows us to derive the critical level of mixedness beyond which th...

We introduce the problem of private computation, comprised of N distributed and non-colluding servers, K datasets, and a user who wants to compute a function of the datasets privately, i.e., without revealing which function he wants to compute to any individual server. This private computation problem is a strict generalization of the private information retrieval (PIR) problem, by expanding th...

The matrix inversion is an interesting topic in algebra mathematics. However, to determine an inverse matrix from a given matrix is required many computation tools and time resource if the size of matrix is huge. In this paper, we have shown an inverse closed form for an interesting matrix which has much applications in communication system. Base on this inverse closed form, the channel capacit...

See Video Abstract (click the "Video Abstract" button next to "PDF" button) A basic measure of size a set E in complex plane is logarithmic capacity cap(E). Capacities are known analytically for few simple shapes like ellipses, but most cases they must be computed numerically. We explore their computation by new "log-lightning'' method based on reciprocal-log approximations plane. For sequence ...