The concept but also a problem in CDMA is the interuser-interference, which limits the system capacity. Interference cancellation (IC) techniques promise an improvement, generally with a large expense in computation complexity. Thus, suboptimal but less complex methods are required. We consider the downlink and show that the computational complexity can be strongly reduced applying some restric...

In this paper, the channel capacity of a specified wireless indoor multiple-input multiple-output(MIMO) channel is estimated by analyzing spatial characteristics of this channel using the three-dimensional ray tracing method, and a technique for deriving an optimized separation of multi-antenna elements is proposed. At first, the ray paths, the path losses, and the time-delay profile are comput...

In this paper we consider the computation of channel capacity for ergodic multiple-input multiple-output channels with additive white Gaussian noise. Two scenarios are considered. Firstly, a time-varying channel is considered in which both the transmitter and the receiver have knowledge of the channel realization. The optimal transmission strategy is water-filling over space and time. It is sho...

Recent researches on neural network have shown great advantage in computer vision over traditional algorithms based on handcrafted features and models. Neural network is now widely adopted in regions like image, speech and video recognition. But the great computation and storage complexity of neural network based algorithms poses great difficulty on its application. CPU platforms are hard to of...

Recently the author introduced a semidefinite upper bound on the square of the stability number of a graph, the inverse theta number, which is proved here to be multiplicative with respect to the strong graph product, hence to be an upper bound for the square of the Shannon capacity of the graph. We also describe a heuristic algorithm for the stable set problem based on semidefinite programming...

The computational problem of distinguishing two quantum channels is central to quantum computing. It is a generalization of the well-known satisfiability problem from classical to quantum computation. This problem is shown to be surprisingly hard: it is complete for the class QIP of problems that have quantum interactive proof systems, which implies that it is hard for the class PSPACE of probl...

This paper proposes Secured Reliable Multipath Routing Protocol (SRMRP) using Distributed Trust Computation and Carrier Sense Multiple Access with Collision Intimation for Distributed Heterogeneous Mobile Ad-hoc Networks. This research aims at two main objectives. The first objective is to make the communication secured against attacks. For achieving this reference based trust security mechanis...

A MapReduce algorithm can be described by a mapping schema, which assigns inputs to a set of reducers, such that for each required output there exists a reducer that receives all the inputs that participate in the computation of this output. Reducers have a capacity, which limits the sets of inputs that they can be assigned. However, individual inputs may vary in terms of size. We consider, for...

We provide construction of steganographic schemes secure against adaptive chosen stegotext attacks. Our constructions achieve embedding rate equals to the Shannon entropy bound on steganographic channel capacity. Further the covertext distribution can be given as either an integrable probability function or as a random covertext sampler. We also introduce steganographic codes that are of intere...