Additively manufactured device for dynamic culture of large arrays of 3D tissue engineered constructs

The ability to test large arrays of cell and biomaterial combinations in 3D environments is still rather limited in the context of tissue engineering and regenerative medicine. This limitation can be generally addressed by employing highly automated and reproducible methodologies. This study reports on the development of a highly versatile and upscalable method based on additive manufacturing for the fabrication of arrays of scaffolds, which are enclosed into individualized perfusion chambers. Devices containing eight scaffolds and their corresponding bioreactor chambers are simultaneously fabricated utilizing a dual extrusion additive manufacturing system. To demonstrate the versatility of the concept, the scaffolds, while enclosed into the device, are subsequently surface-coated with a biomimetic calcium phosphate layer by perfusion with simulated body fluid solution. 96 scaffolds are simultaneously seeded and cultured with human osteoblasts under highly controlled bidirectional perfusion dynamic conditions over 4 weeks. Both coated and noncoated resulting scaffolds show homogeneous cell distribution and high cell viability throughout the 4 weeks culture period and CaP-coated scaffolds result in a significantly increased cell number. The methodology developed in this work exemplifies the applicability of additive manufacturing as a tool for further automation of studies in the field of tissue engineering and regenerative medicine.

DMT of Multi-hop Cooperative Networks-Part II: Layered and Multi-Antenna Networks

We consider single-source, single-sink (ss-ss) multi-hop relay networks, with slow-fading Rayleigh links. This two part paper aims at giving explicit protocols and codes to achieve the optimal diversity-multiplexing tradeoff (DMT) of two classes of multi-hop networks: K-parallel-path (KPP) networks and Layered networks. While single-antenna KPP networks were the focus of the first part, we consider layered and multi-antenna networks in this second part. We prove that a linear DMT between the maximum diversity d(max). and the maximum multiplexing gain of 1 is achievable for single-antenna fully-connected layered networks under the half-duplex constraint. This is shown to be equal to the optimal DMT if the number of relaying layers is less than 4. For the multiple-antenna case, we provide an achievable DMT, which is significantly better than known lower bounds for half duplex networks. Along the way, we compute the DMT of parallel MIMO channels in terms of the DMT of the component channel. For arbitrary ss-ss single-antenna directed acyclic networks with full-duplex relays, we prove that a linear tradeoff between maximum diversity and maximum multiplexing gain is achievable using an amplify-and-forward (AF) protocol. Explicit short-block-length codes are provided for all the proposed protocols. Two key implications of the results in the two-part paper are that the half-duplex constraint does not necessarily entail rate loss by a factor of two as previously believed and that simple AN protocols are often sufficient to attain the best possible DMT.

Inverted slot-mode slow-wave structures for traveling-wave tubes

The dispersion and impedance characteristics of an inverted slot-mode (ISM) slow-wave structure computed by three different techniques, i.e., an analytical model based on a periodic quasi-TEM approach, an equivalent-circuit model, and 3-D electromagnetic simulation are obtained and compared. The comparison was carried out for three different slot-mode structures at S-, C-, and X-bands. The approach was also validated with experimental measurements on a practical X-band ISM traveling-wave tube. The design of ferruleless ISM slow-wave structures, both in circular and rectangular formats, has also been proposed and the predicted dispersion characteristics for these two geometries are compared with 3-D simulation and cold-test measurements. The impedance characteristics for all three designs are also compared.

Switchable-feed reconfigurable ultra-wide band planar antenna

Reconfigurable antennas capable of radiating in only specific desired directions increase system functionality in applications like direction finding and beam steering. This paper presents the design simulation, fabrication and measurement of a horizontally polarized, direction reconfigurable Vivaldi antenna, designed for the lower-band UWB (2-6 GHz). This design employs eight circularly distributed independent Vivaldi antennas with a common port, electronically controlled by PIN diodes acting as RF switches. Experimental results show that the reconfigurable antenna has a bandwidth of 4 GHz (2-6 GHz), with 5 dB gain in the desired direction and capable of steering over the 360° range.

Electronically-reconfigurable horizontally polarized wide-band planar antenna

Antennas are a necessary and critical component of communications and radar systems, but their inability to adjust to new operating scenarios can sometimes limit the system performance. Reconfigurable antennas capable of radiating in only specific desired directions can ameliorate these restrictions and help to achieve increased functionality in applications like direction finding and beam steering. This paper presents the design simulation, fabrication and measurement of a wide-band, horizontally polarized, direction reconfigurable microstrip antenna operating at 2.45 GHz. The design employs a central horizontally polarized omnidirectional active element surrounded by electronically reconfigurable parasitic microstrip elements, controlled by PIN diodes acting as RF switches. Experimental results show that the reconfigurable antenna has a bandwidth of 40% (2-3 GHz), with 3 dB gain in the desired direction and capable of steering over the 360° range.

Hexagonally ordered arrays of metallic nanodots from thin films of functional block copolymers

We demonstrate a new and simple route to fabricate highly dense arrays of hexagonally close packed inorganic nanodots using functional diblock copolymer (PS-b-P4VP) thin films. The deposition of pre-synthesized inorganic nanoparticles selectively into the P4VP domains of PS-b-P4VP thin films, followed by removal of the polymer, led to highly ordered metallic patterns identical to the order of the starting thin film. Examples of Au, Pt and Pd nanodot arrays are presented. The affinity of the different metal nanoparticles towards P4VP chains is also understood by extending this approach to PS-b-P4VP micellar thin films. The procedure used here is simple, eco-friendly, and compatible with the existing silicon-based technology. Also the method could be applied to various other block copolymer morphologies for generating 1-dimensional (1D) and 2-dimensional (2D) structures. (c) 2010 Elsevier Ltd. All rights reserved.

Optimal Weighted Antenna Selection For Imperfect Channel Knowledge From Training

Receive antenna selection (AS) reduces the hardware complexity of multi-antenna receivers by dynamically connecting an instantaneously best antenna element to the available radio frequency (RF) chain. Due to the hardware constraints, the channels at various antenna elements have to be sounded sequentially to obtain estimates that are required for selecting the ``best'' antenna and for coherently demodulating data. Consequently, the channel state information at different antennas is outdated by different amounts. We show that, for this reason, simply selecting the antenna with the highest estimated channel gain is not optimum. Rather, the channel estimates of different antennas should be weighted 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 derive an explicit formula for the optimal selection weights that minimize the SEP. We find that when selection weights are not used, the SEP need not improve as the number of antenna elements increases, which is in contrast to the ideal channel estimation case. However, the optimal selection weights remedy this situation and significantly improve performance.

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.