Multi-port network modeling for fractal shape microstrip antenna

In this paper we demonstrate the use of multi-port network modeling to analyze one such antenna with fractal shaped parts. Based on simulation and experimental studies, it has been demonstrated that model can accurately predict the input characteristics of antennas with Minkowski geometry replacing a side micro strip square ring.

On the generalized degrees of freedom of the K-user symmetric MIMO Gaussian interference channel

This work derives inner and outer bounds on the generalized degrees of freedom (GDOF) of the K-user symmetric MIMO Gaussian interference channel. For the inner bound, an achievable GDOF is derived by employing a combination of treating interference as noise, zero-forcing at the receivers, interference alignment (IA), and extending the Han-Kobayashi (HK) scheme to K users, depending on the number of antennas and the INR/SNR level. An outer bound on the GDOF is derived, using a combination of the notion of cooperation and providing side information to the receivers. Several interesting conclusions are drawn from the bounds. For example, in terms of the achievable GDOF in the weak interference regime, when the number of transmit antennas (M) is equal to the number of receive antennas (N), treating interference as noise performs the same as the HK scheme and is GDOF optimal. For K >; N/M+1, a combination of the HK and IA schemes performs the best among the schemes considered. However, for N/M <; K ≤ N/M+1, the HK scheme is found to be GDOF optimal.

Minimizing the complexity of fast sphere decoding of STBCs

Decoding of linear space-time block codes (STBCs) with sphere-decoding (SD) is well known. A fast-version of the SD known as fast sphere decoding (FSD) has been recently studied by Biglieri, Hong and Viterbo. Viewing a linear STBC as a vector space spanned by its defining weight matrices over the real number field, we define a quadratic form (QF), called the Hurwitz-Radon QF (HRQF), on this vector space and give a QF interpretation of the FSD complexity of a linear STBC. It is shown that the FSD complexity is only a function of the weight matrices defining the code and their ordering, and not of the channel realization (even though the equivalent channel when SD is used depends on the channel realization) or the number of receive antennas. It is also shown that the FSD complexity is completely captured into a single matrix obtained from the HRQF. Moreover, for a given set of weight matrices, an algorithm to obtain a best ordering of them leading to the least FSD complexity is presented. The well known classes of low FSD complexity codes (multi-group decodable codes, fast decodable codes and fast group decodable codes) are presented in the framework of HRQF.

Near-optimal large-MIMO detection using randomized MCMC and randomized search algorithms

Low-complexity near-optimal detection of signals in MIMO systems with large number (tens) of antennas is getting increased attention. In this paper, first, we propose a variant of Markov chain Monte Carlo (MCMC) algorithm which i) alleviates the stalling problem encountered in conventional MCMC algorithm at high SNRs, and ii) achieves near-optimal performance for large number of antennas (e.g., 16×16, 32×32, 64×64 MIMO) with 4-QAM. We call this proposed algorithm as randomized MCMC (R-MCMC) algorithm. Second, we propose an other algorithm based on a random selection approach to choose candidate vectors to be tested in a local neighborhood search. This algorithm, which we call as randomized search (RS) algorithm, also achieves near-optimal performance for large number of antennas with 4-QAM. The complexities of the proposed R-MCMC and RS algorithms are quadratic/sub-quadratic in number of transmit antennas, which are attractive for detection in large-MIMO systems. We also propose message passing aided R-MCMC and RS algorithms, which are shown to perform well for higher-order QAM.

Dramatic Structural Changes Resulting from the Loss of a Crucial Hydrogen Bond in the Hinge Region Involved in C-Terminal Helix Swapping in SurE: A Survival Protein from Salmonella typhimurium

Domain swapping is an interesting feature of some oligomeric proteins in which each protomer of the oligomer provides an identical surface for exclusive interaction with a segment or domain belonging to another protomer. Here we report results of mutagenesis experiments on the structure of C-terminal helix swapped dimer of a stationary phase survival protein from Salmonella typhimurium (StSurE). Wild type StSurE is a dimer in which a large helical segment at the C-terminus and a tetramerization loop comprising two beta strands are swapped between the protomers. Key residues in StSurE that might promote C-terminal helix swapping were identified by sequence and structural comparisons. Three mutants in which the helix swapping is likely to be avoided were constructed and expressed in E. coli. Three-dimensional X-ray crystal structures of the mutants H234A and D230A/H234A could be determined at 2.1 angstrom and 2.35 angstrom resolutions, respectively. Contrary to expectations, helix swapping was mostly retained in both the mutants. The loss of the crucial D230 OD2- H234 NE2 hydrogen bond (2.89 angstrom in the wild type structure) in the hinge region was compensated by new inter and intra-chain interactions. However, the two fold molecular symmetry was lost and there were large conformational changes throughout the polypeptide. In spite of these changes, the dimeric structure and an approximate tetrameric organization were retained, probably due to the interactions involving the tetramerization loop. Mutants were mostly functionally inactive, highlighting the importance of precise inter-subunit interactions for the symmetry and function of StSurE.

Antenna Selection in Interference-Constrained Underlay Cognitive Radios: SEP-Optimal Rule and Performance Benchmarking

In the underlay mode of cognitive radio, secondary users are allowed to transmit when the primary is transmitting, but under tight interference constraints that protect the primary. However, these constraints limit the secondary system performance. Antenna selection (AS)-based multiple antenna techniques, which exploit spatial diversity with less hardware, help improve secondary system performance. We develop a novel and optimal transmit AS rule that minimizes the symbol error probability (SEP) of an average interference-constrained multiple-input-single-output secondary system that operates in the underlay mode. We show that the optimal rule is a non-linear function of the power gain of the channel from the secondary transmit antenna to the primary receiver and from the secondary transmit antenna to the secondary receive antenna. We also propose a simpler, tractable variant of the optimal rule that performs as well as the optimal rule. We then analyze its SEP with L transmit antennas, and extensively benchmark it with several heuristic selection rules proposed in the literature. We also enhance these rules in order to provide a fair comparison, and derive new expressions for their SEPs. The results bring out new inter-relationships between the various rules, and show that the optimal rule can significantly reduce the SEP.

Channel training signal design for reciprocal multiple antenna systems with beamforming

Fast and efficient channel estimation is key to achieving high data rate performance in mobile and vehicular communication systems, where the channel is fast time-varying. To this end, this work proposes and optimizes channel-dependent training schemes for reciprocal Multiple-Input Multiple-Output (MIMO) channels with beamforming (BF) at the transmitter and receiver. First, assuming that Channel State Information (CSI) is available at the receiver, a channel-dependent Reverse Channel Training (RCT) signal is proposed that enables efficient estimation of the BF vector at the transmitter with a minimum training duration of only one symbol. In contrast, conventional orthogonal training requires a minimum training duration equal to the number of receive antennas. A tight approximation to the capacity lower bound on the system is derived, which is used as a performance metric to optimize the parameters of the RCT. Next, assuming that CSI is available at the transmitter, a channel-dependent forward-link training signal is proposed and its power and duration are optimized with respect to an approximate capacity lower bound. Monte Carlo simulations illustrate the significant performance improvement offered by the proposed channel-dependent training schemes over the existing channel-agnostic orthogonal training schemes.

C12-Helix development in ()n sequences - spectroscopic characterization of Boc-Aib-4(R)Val]-OMe oligomers

The solution conformations of the -hybrid oligopeptides Boc-Aib-4(R)Val]n-OMe (n = 1-8) in organic solvents have been probed by NMR, IR, and CD spectroscopic methods. In the solid state, this peptide series favors C12-helical conformations, which are backbone-expanded analogues of 310 helices in -peptide sequences. NMR studies of the six- (n = 3) and 16-residue (n = 8) peptides reveal that only two NH protons attached the N-terminus residues Aib(1) and 4(R)Val(2) are solvent-exposed. Sequential NiH-Ni+1H NOEs characteristic of local helical conformations are also observed at the residues. IR studies establish that chain extension leads to a large enhancement in the intensities of the hydrogen-bonded NH stretching bands (3343-3280 cm-1), which suggest elongation of intramolecularly hydrogen-bonded structures. The development of C12-helical structures upon lengthening of the sequence is supported by the NMR and IR observations. The CD spectra of the ()n peptides reveal a negative maximum at ca. 206 nm and a positive maximum at ca. 192 nm, spectral feature that are distinct from those of 310 helices in -peptides.

Bounds on the sum-rate capacity of the Gaussian MIMO X channel

We consider the MIMO X channel (XC), a system consisting of two transmit-receive pairs, where each transmitter communicates with both the receivers. Both the transmitters and receivers are equipped with multiple antennas. First, we derive an upper bound on the sum-rate capacity of the MIMO XC under individual power constraint at each transmitter. The sum-rate capacity of the two-user multiple access channel (MAC) that results when receiver cooperation is assumed forms an upper bound on the sum-rate capacity of the MIMO XC. We tighten this bound by considering noise correlation between the receivers and deriving the worst noise covariance matrix. It is shown that the worst noise covariance matrix is a saddle-point of a zero-sum, two-player convex-concave game, which is solved through a primal-dual interior point method that solves the maximization and the minimization parts of the problem simultaneously. Next, we propose an achievable scheme which employs dirty paper coding at the transmitters and successive decoding at the receivers. We show that the derived upper bound is close to the achievable region of the proposed scheme at low to medium SNRs.

Fermions in synthetic non-Abelian gauge potentials: rashbon condensates to novel Hamiltonians

Recent advances in the generation of synthetic gauge fields in cold atomic systems have stimulated interest in the physics of interacting bosons and fermions in them. In this paper, we discuss interacting two-component fermionic systems in uniform non-Abelian gauge fields that produce a spin-orbit interaction and uniform spin potentials. Two classes of gauge fields discussed include those that produce a Rashba spin-orbit interaction and the type of gauge fields (SM gauge fields) obtained in experiments by the Shanxi and MIT groups. For high symmetry Rashba gauge fields, a two-particle bound state exists even for a vanishingly small attractive interaction described by a scattering length. Upon increasing the strength of a Rashba gauge field, a finite density of weakly interacting fermions undergoes a crossover from a BCS like ground state to a BEC state of a new kind of boson called the rashbon whose properties are determined solely by the gauge field and not by the interaction between the fermions. The rashbon Bose-Einstein condensate (RBEC) is a quite intriguing state with the rashbon-rashbon interactions being independent of the fermion-fermion interactions (scattering length). Furthermore, we show that the RBEC has a transition temperature of the order of the Fermi temperature, suggesting routes to enhance the transition temperatures of weakly interacting superfluids by tuning the spin-orbit coupling. For the SM gauge fields, we show that in a regime of parameters, a pair of particles with finite centre-of-mass momentum is the most strongly bound. In other regimes of centre-of-mass momenta, there is no two-body bound state, but a resonance like feature appears in the scattering continuum. In the many-body setting, this results in flow enhanced pairing. Also, strongly interacting normal states utilizing the scattering resonance can be created opening the possibility of studying properties of helical Fermi liquids. This paper contains a general discussion of the physics of Feshbach resonance in a non-Abelian gauge field, where several novel features such as centre-of-mass-momentum-dependent effective interactions are shown. It is also shown that a uniform non-Abelian gauge field in conjunction with a spatial potential can be used to generate novel Hamiltonians; we discuss an explicit example of the generation of a monopole Hamiltonian.

SC-FDMA for multiuser communication on the downlink

Single-carrier frequency division multiple access (SC-FDMA) has become a popular alternative to orthogonal frequency division multiple access (OFDMA) in multiuser communication on the uplink. This is mainly due to the low peak-to-average power ratio (PAPR) of SC-FDMA compared to that of OFDMA. Long-term evolution (LTE) uses SC-FDMA on the uplink to exploit this PAPR advantage to reduce transmit power amplifier backoff in user terminals. In this paper, we show that SC-FDMA can be beneficially used for multiuser communication on the downlink as well. We present SC-FDMA transmit and receive signaling architectures for multiuser communication on the downlink. The benefits of using SC-FDMA on the downlink are that SC-FDMA can achieve i) significantly better bit error rate (BER) performance at the user terminal compared to OFDMA, and ii) improved PAPR compared to OFDMA which reduces base station (BS) power amplifier backoff (making BSs more green). SC-FDMA receiver needs to do joint equalization, which can be carried out using low complexity equalization techniques. For this, we present a local neighborhood search based equalization algorithm for SC-FDMA. This algorithm is very attractive both in complexity as well as performance. We present simulation results that establish the PAPR and BER performance advantage of SC-FDMA over OFDMA in multiuser SISO/MIMO downlink as well as in large-scale multiuser MISO downlink with tens to hundreds of antennas at the BS.

Training for Antenna Selection in Time-Varying Channels: Optimal Selection, Energy Allocation, and Energy Efficiency Evaluation

Single receive antenna selection (AS) is a popular method for obtaining diversity benefits without the additional costs of multiple radio receiver chains. Since only one antenna receives at any time, the transmitter sends a pilot multiple times to enable the receiver to estimate the channel gains of its N antennas to the transmitter and select an antenna. In time-varying channels, the channel estimates of different antennas are outdated to different extents. We analyze the symbol error probability (SEP) in time-varying channels of the N-pilot and (N+1)-pilot AS training schemes. In the former, the transmitter sends one pilot for each receive antenna. In the latter, the transmitter sends one additional pilot that helps sample the channel fading process of the selected antenna twice. We present several new results about the SEP, optimal energy allocation across pilots and data, and optimal selection rule in time-varying channels for the two schemes. We show that due to the unique nature of AS, the (N+1)-pilot scheme, despite its longer training duration, is much more energy-efficient than the conventional N-pilot scheme. An extension to a practical scenario where all data symbols of a packet are received by the same antenna is also investigated.

Wafer scale fabrication of porous three-dimensional plasmonic metamaterials for the visible region: chiral and beyond

We report on a wafer scale fabrication method of a three-dimensional plasmonic metamaterial with strong chiroptical response in the visible region of the electromagnetic spectrum. The system was comprised of metallic nanoparticles arranged in a helical fashion, with high degree of flexibility over the choice of the underlying material, as well as their geometrical parameters. This resulted in exquisite control over the chiroptical properties, most importantly the spectral signature of the circular dichroism. In spite of the large variability in the arrangement, as well as the size and shape of the constituent nanoparticles, the average chiro-optical response of the material remained uniform across the wafer, thus confirming the suitability of this system as a large area chiral metamaterial. By simply heating the substrate for a few minutes, the geometrical properties of the nanoparticles could be altered, thus providing an additional handle towards tailoring the spectral response of this novel material.

Wireless Network Coding for MIMO Two-Way Relaying

The design of modulation schemes for the physical layer network-coded two-way MIMO relaying scenario is considered, with the denoise-and-forward protocol which employs two phases: Multiple Access phase and Broadcast phase. It is shown that for MIMO two-way relaying, the minimum distance of the effective constellation at the relay becomes zero when all the rows of the channel fade coefficient matrix belong to a finite number of vector subspaces referred to as the singular fade subspaces. The singular fade subspaces can be classified into two kinds based on whether their harmful effects can be removed or not: (i) the removable and (ii) the non-removable singular fade subspaces. It is shown that network coding maps obtained by the completion of appropriate partially filled Latin Rectangles can remove the harmful effects of all the removable singular fade subspaces. For 2(lambda)-PSK signal set, the removable and non-removable singular fade subspaces are characterized and, it is shown that the number of non-removable singular fade subspaces is a small fraction of the total number of singular fade subspaces and this fraction tends to zero as the constellation size tends to infinity. The Latin Rectangles for the case when the end nodes use different number of antennas are shown to be obtainable from the Latin Squares for the case when they use the same number of antennas. Also, the network coding maps which remove all the removable singular singular fade subspaces are shown to be obtainable from a small set of Latin Squares. The removal of all the singular fade subspaces by properly choosing the network coding map, provides a gain of 5.5 dB over the conventional Exclusive-OR network coding, in a Rayleigh fading scenario with 2 antennas at the end nodes and one antenna at the relay node, for 4-PSK signal set.

On the sphere decoding complexity of high-rate multigroup decodable STBCs in asymmetric MIMO systems

A space-time block code (STBC) is said to be multigroup decodable if the information symbols encoded by it can be partitioned into two or more groups such that each group of symbols can be maximum-likelihood (ML) decoded independently of the other symbol groups. In this paper, we show that the upper triangular matrix encountered during the sphere decoding of a linear dispersion STBC can be rank-deficient even when the rate of the code is less than the minimum of the number of transmit and receive antennas. We then show that all known families of high-rate (rate greater than 1) multigroup decodable codes have rank-deficient matrix even when the rate is less than the number of transmit and receive antennas, and this rank-deficiency problem arises only in asymmetric MIMO systems when the number of receive antennas is strictly less than the number of transmit antennas. Unlike the codes with full-rank matrix, the complexity of the sphere decoding-based ML decoder for STBCs with rank-deficient matrix is polynomial in the constellation size, and hence is high. We derive the ML sphere decoding complexity of most of the known high-rate multigroup decodable codes, and show that for each code, the complexity is a decreasing function of the number of receive antennas.