Photoluminescence spectroscopy and lifetime measurements from self-assembled semiconductor-metal nanoparticle hybrid arrays

We present results of photoluminescence spectroscopy and lifetime measurements on thin film hybrid arrays of semiconductor quantum dots and metal nanoparticles embedded in a block copolymer template. The intensity of emission as well as the measured lifetime would be controlled by varying the volume fraction and location of gold nanoparticles in the matrix. We demonstrate the ability to both enhance and quench the luminescence in the hybrids as compared to the quantum dot array films while simultaneously engineering large reduction in luminescence lifetime with incorporation of gold nanoparticles. (C) 2010 American Institute of Physics. [doi:10.1063/1.3483162].

Optimal Receive Antenna Selection in Time-Varying Fading Channels with Practical Training Constraints

Hardware constraints, which motivate receive antenna selection, also require that various antenna elements at the receiver be sounded sequentially to obtain estimates required for selecting the `best' antenna and for coherently demodulating data thereafter. Consequently, the channel state information at different antennas is outdated by different amounts and corrupted by noise. We show that, for this reason, simply selecting the antenna with the highest estimated channel gain is not optimum. Rather, a preferable strategy is to linearly weight the channel estimates of different antennas differently, depending on the training scheme. We derive closed-form expressions for the symbol error probability (SEP) of AS for MPSK and MQAM in time-varying Rayleigh fading channels for arbitrary selection weights, and validate them with simulations. We then characterize explicitly the optimal selection weights that minimize the SEP. We also consider packet reception, in which multiple symbols of a packet are received by the same antenna. New suboptimal, but computationally efficient weighted selection schemes are proposed for reducing the packet error rate. The benefits of weighted selection are also demonstrated using a practical channel code used in third generation cellular systems. Our results show that optimal weighted selection yields a significant performance gain over conventional unweighted selection.

A Novel, Balanced, and Energy-Efficient Training Method for Receive Antenna Selection

In receive antenna selection (AS), only signals from a subset of the antennas are processed at any time by the limited number of radio frequency (RF) chains available at the receiver. Hence, the transmitter needs to send pilots multiple times to enable the receiver to estimate the channel state of all the antennas and select the best subset. Conventionally, the sensitivity of coherent reception to channel estimation errors has been tackled by boosting the energy allocated to all pilots to ensure accurate channel estimates for all antennas. Energy for pilots received by unselected antennas is mostly wasted, especially since the selection process is robust to estimation errors. In this paper, we propose a novel training method uniquely tailored for AS that transmits one extra pilot symbol that generates accurate channel estimates for the antenna subset that actually receives data. Consequently, the transmitter can selectively boost the energy allocated to the extra pilot. We derive closed-form expressions for the proposed scheme's symbol error probability for MPSK and MQAM, and optimize the energy allocated to pilot and data symbols. Through an insightful asymptotic analysis, we show that the optimal solution achieves full diversity and is better than the conventional method.

Photoluminescence enhancement and quenching in metal-semiconductor quantum dot hybrid arrays

Hybrid monolayer arrays of metal and semiconductor quantum dots have been prepared to study the exciton-plasmon interaction. We observed crossover from strong quenching to enhancement in photoluminescence of the quantum dots as a function of the emission wavelength for fixed interparticle spacings. Remarkably, the enhancement is observed even for extremely short separation at which strong quenching has been observed and predicted earlier. A significant redshift in emission maxima is also observed for quantum dots with quenched emission. The possible role of collective phenomena as well as strong interactions in such ordered hybrid arrays in controlling the emission is discussed. (C) 2011 American Institute of Physics. doi:10.1063/1.3553766]

Study Of Acoustic Source Localization Algorithm For Planar Arrays

The source localization algorithms in the earlier works, mostly used non-planar arrays. If we consider scenarios like human-computer communication, or human-television communication where the microphones need to be placed on the computer monitor or television front panel, i.e we need to use the planar arrays. The algorithm proposed in 1], is a Linear Closed Form source localization algorithm (LCF algorithm) which is based on Time Difference of Arrivals (TDOAs) that are obtained from the data collected using the microphones. It assumes non-planar arrays. The LCF algorithm is applied to planar arrays in the current work. The relationship between the error in the source location estimate and the perturbation in the TDOAs is derived using first order perturbation analysis and validated using simulations. If the TDOAs are erroneous, both the coefficient matrix and the data matrix used for obtaining source location will be perturbed. So, the Total least squares solution for source localization is proposed in the current work. The sensitivity analysis of the source localization algorithm for planar arrays and non-planar arrays is done by introducing perturbation in the TDOAs and the microphone locations. It is shown that the error in the source location estimate is less when we use planar array instead of the particular non-planar array considered for same perturbation in the TDOAs or microphone location. The location of the reference microphone is proved to be important for getting an accurate source location estimate if we are using the LCF algorithm.

Past Queue Length Based Low-Overhead Link Scheduling in Multi-beam Wireless Mesh Networks

Wireless mesh networks with multi-beam capability at each node through the use of multi-antenna beamforming are becoming practical and attracting increased research attention. Increased capacity due to spatial reuse and increased transmission range are potential benefits in using multiple directional beams in each node. In this paper, we are interested in low-complexity scheduling algorithms in such multi-beam wireless networks. In particular, we present a scheduling algorithm based on queue length information of the past slots in multi-beam networks, and prove its stability. We present a distributed implementation of this proposed algorithm. Numerical results show that significant improvement in delay performance is achieved using the proposed multi-beam scheduling compared to omni-beam scheduling. In addition, the proposed algorithm is shown to achieve a significant reduction in the signaling overhead compared to a current slot queue length approach.

Reduced ML-Decoding Complexity, Full-Rate STBCs for 4 Transmit Antenna Systems

For an n(t) transmit, n(r) receive antenna system (n(t) x nr system), a full-rate space time block code (STBC) transmits min(n(t), n(r)) complex symbols per channel use. In this paper, a scheme to obtain a full-rate STBC for 4 transmit antennas and any n(r), with reduced ML-decoding complexity is presented. The weight matrices of the proposed STBC are obtained from the unitary matrix representations of a Clifford Algebra. By puncturing the symbols of the STBC, full rate designs can be obtained for n(r) < 4. For any value of n(r), the proposed design offers the least ML-decoding complexity among known codes. The proposed design is comparable in error performance to the well known Perfect code for 4 transmit antennas while offering lower ML-decoding complexity. Further, when n(r) < 4, the proposed design has higher ergodic capacity than the punctured Perfect code. Simulation results which corroborate these claims are presented.

Non-uniform slot injection (suction) or wall enthalpy into a steady nonsimilar compressible laminar boundary layer

Steady two-dimensional and axisymmetric compressible nonsimilar laminar boundary-layer flows with non-uniform slot injection (or suction) and non-uniform wall enthalpy have been studied from the starting point of the streamwise co-ordinate to the exact point of separation. The effect of different free stream Mach number has also been considered. The finite discontinuities arising at the leading and trailing edges of the slot for the uniform slot injection (suction) or wall enthalpy are removed by choosing appropriate non-uniform slot injection (suction) or wall enthalpy. The difficulties arising at the starting point of the streamwise co-ordinate, at the edges of the slot and at the point of separation are overcome by applying the method of quasilinear implicit finite difference scheme with an appropriate selection of finer step size along the streamwise direction. It is observed that the non-uniform slot injection moves the point of separation downstream but the non-uniform slot suction has the reverse effect. The increase of Mach number shifts the point of separation upstream due to the adverse pressure gradient. The increase of total enthalpy at the wall causes the separation to occur earlier while cooling delays it. The non-uniform total enthalpy at the wall (i.e., the cooling or heating of the wall in a slot) along the streamwise co-ordinate has very little effect on the skin friction and thus on the point of separation.

Performance of a pipelined ring algorithm for Fast Fourier Transform on transputer arrays

In this paper a pipelined ring algorithm is presented for efficient computation of one and two dimensional Fast Fourier Transform (FFT) on a message passing multiprocessor. The algorithm has been implemented on a transputer based system and experiments reveal that the algorithm is very efficient. A model for analysing the performance of the algorithm is developed from its computation-communication characteristics. Expressions for execution time, speedup and efficiency are obtained and these expressions are validated with experimental results obtained on a four transputer system. The analytical model is then used to estimate the performance of the algorithm for different number of processors, and for different sizes of the input data.

Blind separation of multiple co-channel BPSK signals arriving at an antenna array

In this letter, we propose a method for blind separation of d co-channel BPSK signals arriving at an antenna array. Our method involves two steps. In the first step, the received data vectors at the output of the array is grouped into 2d clusters. In the second step, we assign the 2d d-tuples with ±1 elements to these clusters in a consistent fashion. From the knowledge of the cluster to which a data vector belongs, we estimate the bits transmitted at that instant. Computer simulations are used to study the performance of our method

Symmetrizing a Hessenberg matrix: Designs for VLSI parallel processor arrays

A symmetrizer of a nonsymmetric matrix A is the symmetric matrix X that satisfies the equation XA = A(t)X, where t indicates the transpose. A symmetrizer is useful in converting a nonsymmetric eigenvalue problem into a symmetric one which is relatively easy to solve and finds applications in stability problems in control theory and in the study of general matrices. Three designs based on VLSI parallel processor arrays are presented to compute a symmetrizer of a lower Hessenberg matrix. Their scope is discussed. The first one is the Leiserson systolic design while the remaining two, viz., the double pipe design and the fitted diagonal design are the derived versions of the first design with improved performance.

Effect of substrate on particle arrangement in arrays formed by self-assembly of polymer grafted nanoparticles

We show that the substrate affects the interparticle spacing in monolayer arrays with hexagonal order formed by self-assembly of polymer grafted nanoparticles. Remarkably, arrays with square packing were formed due to convective shearing at a liquid surface induced by miscibility of colloidal solution with the substrate.

Degradation and Failure of Field Emitting Carbon Nanotube Arrays

It has been observed experimentally that the collective field emission from an array of Carbon Nanotubes (CNTs) exhibits fluctuation and degradation, and produces thermal spikes, resulting in electro-mechanical fatigue and failure of CNTs. Based on a new coupled multiphysics model incorporating the electron-phonon transport and thermo-electrically activated breakdown, a novel method for estimating accurately the lifetime of CNT arrays has been developed in this paper. The main results are discussed for CNT arrays during the field emission process. It is shown that the time-to-failure of CNT arrays increases with the decrease in the angle of tip orientation. This observation has important ramifications for such areas as biomedical X-ray devices using patterned films of CNTs.

On Training and Training Voids for Receive Antenna Subset Selection in Time-Varying Channels

Antenna selection (AS) provides most of the benefits of multiple-antenna systems at drastically reduced hardware costs. In receive AS, the receiver connects a dynamically selected subset of N available antennas to the L available RF chains. The "best" subset to be used for data reception is determined by means of channel estimates acquired using training sequences. Due to the nature of AS, the channel estimates at different antennas are obtained from different transmissions of the pilot sequence, and are, thus, outdated by different amounts in a time-varying channel. We show that a linear weighting of the estimates is optimum for the subset selection process, where the weights are related to the temporal correlation of the channel variations. When L is not an integer divisor of N, we highlight a new issue of "training voids", in which the last pilot transmission is not fully exploited by the receiver. We present a "void-filling" method for fully exploiting these voids, which essentially provides more accurate training for some antennas, and derive the optimal subset selection rule for any void-filling method. We also derive new closed-form equations for the performance of receive AS with optimal subset selection.