Non-linear Transceiver Designs with Imperfect CSIT Using Convex Optimization

In this paper, we consider non-linear transceiver designs for multiuser multi-input multi-output (MIMO) down-link in the presence of imperfections in the channel state information at the transmitter (CSIT). The base station (BS) is equipped with multiple transmit antennas and each user terminal is equipped with multiple receive antennas. The BS employs Tomlinson-Harashima precoding (THP) for inter-user interference pre-cancellation at the transmitter. We investigate robust THP transceiver designs based on the minimization of BS transmit power with mean square error (MSE) constraints, and balancing of MSE among users with a constraint on the total BS transmit power. We show that these design problems can be solved by iterative algorithms, wherein each iteration involves a pair of convex optimization problems. The robustness of the proposed algorithms to imperfections in CSIT is illustrated through simulations.

Design of plane sand-bed channels affected by seepage

The importance of seepage in the design of channels is discussed. Experimental investigations reveal that seepage, either in the downward direction (suction) or in the upward direction (injection), can significantly change the resistance as well as the mobility of the sand-bed particles. A resistance equation relating 'particle Reynolds number' and 'shear Reynolds number' under seepage conditions is developed for plane sediment beds. Finally, a detailed design procedure of the plane sediment beds affected by seepage is presented.

Dielectric properties of poly(vinylidene luoride)/CaCu3Ti4O12 nanocrystal composite thick films

The poly(vinylidene fluoride)/CaCu3Ti4O12 (CCTO) nanocrystal composite films (thickness approximate to 85 mu m) with relatively high dielectric permittivity (90 at 100 Hz) were prepared by the solution casting followed by spin coating technique. The structural, the microstructural and the dielectric properties of the composites were studied using X-ray diffraction, Scanning Electron Microscope, and Impedance analyzer respectively. The effective dielectric permittivity (e(eff)) of the composite increased with increase in the volume fraction of CCTO at all the frequencies (100 Hz to 1 MHz) under investigation. The room temperature dielectric permittivity which is around 90 at 100 Hz, has increased to about 290 at 125 degrees C (100 Hz). These results may be exploited in the development of high energy density capacitors.

Constant weight codes based on ideals of commutative rings

We present a construction of constant weight codes based on the prime ideals of a Noetherian commutative ring. The coding scheme is based on the uniqueness of the primary decomposition of ideals in Noetherian rings. The source alphabet consists of a set of radical ideals constructed from a chosen subset of the prime spectrum of the ring. The distance function between two radical ideals is taken to be the Hamming metric based on the symmetric distance between sets. As an application we construct codes for random networks employing SAF routing.

Including the fermion vacuum fluctuations in the (2+1) flavor Polyakov quark-meson model

We consider the (2 + 1) flavor Polyakov quark-meson model and study the effect of including fermion vacuum fluctuations on the thermodynamics and phase diagram. The resulting model predictions are compared to the recent QCD lattice simulations by the HotQCD and Wuppertal-Budapest collaborations. The variation of the thermodynamic quantities across the phase transition region becomes smoother. This results in better agreement with the lattice data. Depending on the value of the mass of the sigma meson, including the vacuum term results in either pushing the critical end point into higher values of the chemical potential or excluding the possibility of a critical end point altogether.

Rainbow connection number and connected dominating sets

The rainbow connection number of a connected graph is the minimum number of colors needed to color its edges, so that every pair of its vertices is connected by at least one path in which no two edges are colored the same. In this article we show that for every connected graph on n vertices with minimum degree delta, the rainbow connection number is upper bounded by 3n/(delta + 1) + 3. This solves an open problem from Schiermeyer (Combinatorial Algorithms, Springer, Berlin/Hiedelberg, 2009, pp. 432437), improving the previously best known bound of 20n/delta (J Graph Theory 63 (2010), 185191). This bound is tight up to additive factors by a construction mentioned in Caro et al. (Electr J Combin 15(R57) (2008), 1). As an intermediate step we obtain an upper bound of 3n/(delta + 1) - 2 on the size of a connected two-step dominating set in a connected graph of order n and minimum degree d. This bound is tight up to an additive constant of 2. This result may be of independent interest. We also show that for every connected graph G with minimum degree at least 2, the rainbow connection number, rc(G), is upper bounded by Gc(G) + 2, where Gc(G) is the connected domination number of G. Bounds of the form diameter(G)?rc(G)?diameter(G) + c, 1?c?4, for many special graph classes follow as easy corollaries from this result. This includes interval graphs, asteroidal triple-free graphs, circular arc graphs, threshold graphs, and chain graphs all with minimum degree delta at least 2 and connected. We also show that every bridge-less chordal graph G has rc(G)?3.radius(G). In most of these cases, we also demonstrate the tightness of the bounds.

Channel estimation using minimum bit error rate framework for BPSK signals

We consider the design of a linear equalizer with a finite number of coefficients in the context of a classical linear intersymbol-interference channel with additive Gaussian noise for channel estimation. Previous literature has shown that Minimum Bit Error Rate(MBER) based detection has outperformed Minimum Mean Squared Error (MMSE) based detection. We pose the channel estimation problem as a detection problem and propose a novel algorithm to estimate the channel based on the MBER framework for BPSK signals. It is shown that the proposed algorithm reduces BER compared to an MMSE based channel estimation when used in MMSE or MBER detection.

VIRTUAL VIEW SYNTHESIS BY NON-LOCAL MEANS FILTERING USING TEMPORAL DATA

A novel algorithm for Virtual View Synthesis based on Non-Local Means Filtering is presented in this paper. Apart from using the video frames from the nearby cameras and the corresponding per-pixel depth map, this algorithm also makes use of the previously synthesized frame. Simple and efficient, the algorithm can synthesize video at any given virtual viewpoint at a faster rate. In the process, the quality of the synthesized frame is not compromised. Experimental results prove the above mentioned claim. The subjective and objective quality of the synthesized frames are comparable to the existing algorithms.