Far field subwavelength source resolution using Phase Conjugating Lens Assisted With Evanescent-to-Propagating Spectrum Conversion

The imaging properties of a phase conjugating lens operating in the far field zone of the imaged source and augmented with scatterers positioned in the source near field region are theoretically studied in this paper. The phase conjugating lens consists of a double sided 2D assembly of straight wire elements, individually interconnected through phase conjugation operators. The scattering elements are straight wire segments which are loaded with lumped impedance loads at their centers. We analytically and numerically analyze all stages of the imaging process; i) evanescent-to-propagating spectrum conversion; ii) focusing properties of infinite or finite sized phase conjugating lens; iii) source reconstruction upon propagating-to-evanescent spectrum conversion. We show that the resolution that can be achieved depends critically on the separation distance between the imaged source and scattering arrangement, as well as on the topology of the scatterers used. Imaged focal widths of up to one-seventh wavelength are demonstrated. The results obtained indicate the possibility of such an arrangement as a potential practical means for realising using conventional materials devices for fine feature extraction by electromagnetic lensing at distances remotely located from the source objects under investigation

Real-valued fixed-complexity sphere decoder for high dimensional QAM-MIMO systems

The development of high performance, low computational complexity detection algorithms is a key challenge for real-time Multiple-Input Multiple-Output (MIMO) communication system design. The Fixed-Complexity Sphere Decoder (FSD) algorithm is one of the most promising approaches, enabling quasi-ML decoding accuracy and high performance implementation due to its deterministic, highly parallel structure. However, it suffers from exponential growth in computational complexity as the number of MIMO transmit antennas increases, critically limiting its scalability to larger MIMO system topologies. In this paper, we present a solution to this problem by applying a novel cutting protocol to the decoding tree of a real-valued FSD algorithm. The new Real-valued Fixed-Complexity Sphere Decoder (RFSD) algorithm derived achieves similar quasi-ML decoding performance as FSD, but with an average 70% reduction in computational complexity, as we demonstrate from both theoretical and implementation perspectives for Quadrature Amplitude Modulation (QAM)-MIMO systems.

Enhancing Frequency-Scanning Response of Leaky-Wave Antennas Using High-Impedance Surfaces

The use of high-impedance surfaces (HISs) to increase the frequency-scanning sensitivity of hollow leaky-wave antennas (LWAs) is presented. The LWA consists of a hollow rectangular waveguide with one of its narrow walls replaced by a partially reflective surface, and it is loaded with a metallodielectric HIS to increase its beam-scanning response. Theoretical results based on a simple transverse equivalent network illustrate the physical mechanism responsible for the improvement, and they are verified by experiments on a prototype working in the 11-16 GHz band.

Low-complexity iterative method of equalization for single carrier with cyclic prefix in doubly selective channels

Orthogonal frequency division multiplexing (OFDM) requires an expensive linear amplifier at the transmitter due to its high peak-to-average power ratio (PAPR). Single carrier with cyclic prefix (SC-CP) is a closely related transmission scheme that possesses most of the benefits of OFDM but does not have the PAPR problem. Although in a multipath environment, SC-CP is very robust to frequency-selective fading, it is sensitive to the time-selective fading characteristics of the wireless channel that disturbs the orthogonality of the channel matrix (CM) and increases the computational complexity of the receiver. In this paper, we propose a time-domain low-complexity iterative algorithm to compensate for the effects of time selectivity of the channel that exploits the sparsity present in the channel convolution matrix. Simulation results show the superior performance of the proposed algorithm over the standard linear minimum mean-square error (L-MMSE) equalizer for SC-CP.

Turbo-MIMO for wireless communications

This article reviews an important class of MIMO wireless communications, known collectively as turbo-MIMO systems. A distinctive property of turbo-MIMO wireless communication systems is that they can attain a channel capacity close to the Shannon limit and do so in a computationally manageable manner. The article focuses attention on a subclass of turbo-MIMO systems that use space-time coding based on bit-interleaved coded modulation. Different computationally manageable decoding (detection) strategies are briefly discussed. The article also includes computer experiments that are intended to improve the understanding of specific issues involved in the design of turbo-MIMO systems.

Turbo-BLAST: Performance evaluation in correlated Rayleigh-Fading environment

Recent theoretical investigations of spatially correlated multitransmit and multireceive (MTMR) links show that not only independently and identically distributed links, but also spatially correlated links can offer linear capacity growth with increasing number of transmit and receive antennas. In this paper, we explore the suitability of the turbo-BLAST architecture in correlated Rayleigh-fading MTMR environments. In particular, for an MTMR system with a large number of receive antennas, a near optimal performance can be achieved by the turbo-BLAST architecture in spatially and temporarily correlated Rayleigh-fading environments. The performance of turbo-BLAST, in terms of both bit-error rate and spectral efficiency, is analyzed empirically in indoors and correlated outdoor environments.

Image segmentation based on multi-scan constraint satisfaction neural network

A novel image segmentation method based on a constraint satisfaction neural network (CSNN) is presented. The new method uses CSNN-based relaxation but with a modified scanning scheme of the image. The pixels are visited with more distant intervals and wider neighborhoods in the first level of the algorithm. The intervals between pixels and their neighborhoods are reduced in the following stages of the algorithm. This method contributes to the formation of more regular segments rapidly and consistently. A cluster validity index to determine the number of segments is also added to complete the proposed method into a fully automatic unsupervised segmentation scheme. The results are compared quantitatively by means of a novel segmentation evaluation criterion. The results are promising.

Density Matrix Renormalization Group for Dummies

We describe the Density Matrix Renormalization Group algorithms for time dependent and time independent Hamiltonians. This paper is a brief but comprehensive introduction to the subject for anyone willing to enter in the field or write the program source code from scratch. An open source version of the code can be found at: http://www.dmrg.it.

Sub-mm wet etched linear to circular polarization fss based polarization converters

This communication investigates the potential for fabrication of micromachined silicon sub-millimeter wave periodic arrays of freestanding slot frequency selective surfaces (FSS) using wet etch KOH technology. The vehicle for this is an FSS for generating circularly polarized signals from an incident linearly polarized signal at normal incidence to the structure. Principal issues and fabrication processes involved from the initial design of the core FSS structures to be made and tested through to their final testing are addressed. Measured and simulated results for crossed and ring slot element shapes in single and double layer polarization convertor structures are presented for sub-mm wave operation. It is shown that 3 dB axial ratio (AR) bandwidths of 21% can be achieved with the one layer perforated screen design and that the rate of change is lower than the double layer structures. An insertion loss of 1.1 dB can be achieved for the split circular ring double layer periodic array. These results are shown to be compatible with the more specialized fabrication equipment dry reactive ion etching approach previously used for the construction of this type of structure. © 2011 IEEE.

Convergence of the iterative algorithm for a general Hammerstein system identification

The convergence of the iterative identification algorithm for a general Hammerstein system has been an open problem for a long time. In this paper, it is shown that the convergence can be achieved by incorporating a regularization procedure on the nonlinearity in addition to a normalization step on the parameters.

Distribution of the Demmel Condition Number of Wishart Matrices

This paper studies the Demmel condition number of Wishart matrices, a quantity which has numerous applications to wireless communications, such as adaptive switching between beamforming and diversity coding, link adaptation, and spectrum sensing. For complex Wishart matrices, we give an exact analytical expression for the probability density function (p.d.f.) of the Demmel condition number, and also derive simplified expressions for the high tail regime. These results indicate that the condition of complex Wishart matrices is dominantly decided by the difference between the matrix dimension and degree of freedom (DoF), i.e., the probability of drawing a highly ill conditioned matrix decreases considerably when the difference between the matrix dimension and DoF increases. We further investigate real Wishart matrices, and derive new expressions for the p.d.f. of the smallest eigenvalue, when the difference between the matrix dimension and DoF is odd. Based on these results, we succeed to obtain an exact p.d.f. expression for the Demmel condition number, and simplified expressions for the high tail regime.