Reverse Channel Training For Reciprocal Mimo Systems With Spatial Multiplexing

This paper investigates the problem of designing reverse channel training sequences for a TDD-MIMO spatial-multiplexing system. Assuming perfect channel state information at the receiver and spatial multiplexing at the transmitter with equal power allocation to them dominant modes of the estimated channel, the pilot is designed to ensure an stimate of the channel which improves the forward link capacity. Using perturbation techniques, a lower bound on the forward link capacity is derived with respect to which the training sequence is optimized. Thus, the reverse channel training sequence makes use of the channel knowledge at the receiver. The performance of orthogonal training sequence with MMSE estimation at the transmitter and the proposed training sequence are compared. Simulation results show a significant improvement in performance.

Analytical models for capacity estimation of IEEE 802.11 WLANs using DCF for internet applications

We provide analytical models for capacity evaluation of an infrastructure IEEE 802.11 based network carrying TCP controlled file downloads or full-duplex packet telephone calls. In each case the analytical models utilize the attempt probabilities from a well known fixed-point based saturation analysis. For TCP controlled file downloads, following Bruno et al. (In Networking '04, LNCS 2042, pp. 626-637), we model the number of wireless stations (STAs) with ACKs as a Markov renewal process embedded at packet success instants. In our work, analysis of the evolution between the embedded instants is done by using saturation analysis to provide state dependent attempt probabilities. We show that in spite of its simplicity, our model works well, by comparing various simulated quantities, such as collision probability, with values predicted from our model. Next we consider N constant bit rate VoIP calls terminating at N STAs. We model the number of STAs that have an up-link voice packet as a Markov renewal process embedded at so called channel slot boundaries. Analysis of the evolution over a channel slot is done using saturation analysis as before. We find that again the AP is the bottleneck, and the system can support (in the sense of a bound on the probability of delay exceeding a given value) a number of calls less than that at which the arrival rate into the AP exceeds the average service rate applied to the AP. Finally, we extend the analytical model for VoIP calls to determine the call capacity of an 802.11b WLAN in a situation where VoIP calls originate from two different types of coders. We consider N-1 calls originating from Type 1 codecs and N-2 calls originating from Type 2 codecs. For G711 and G729 voice coders, we show that the analytical model again provides accurate results in comparison with simulations.

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.

Mutual inhibition and capacity sharing during parallel preparation of serial eye movements

Many common activities, like reading, scanning scenes, or searching for an inconspicuous item in a cluttered environment, entail serial movements of the eyes that shift the gaze from one object to another. Previous studies have shown that the primate brain is capable of programming sequential saccadic eye movements in parallel. Given that the onset of saccades directed to a target are unpredictable in individual trials, what prevents a saccade during parallel programming from being executed in the direction of the second target before execution of another saccade in the direction of the first target remains unclear. Using a computational model, here we demonstrate that sequential saccades inhibit each other and share the brain's limited processing resources (capacity) so that the planning of a saccade in the direction of the first target always finishes first. In this framework, the latency of a saccade increases linearly with the fraction of capacity allocated to the other saccade in the sequence, and exponentially with the duration of capacity sharing. Our study establishes a link between the dual-task paradigm and the ramp-to-threshold model of response time to identify a physiologically viable mechanism that preserves the serial order of saccades without compromising the speed of performance.

High Oxygen Storage Capacity and High Rates of CO Oxidation and NO Reduction Catalytic Properties of Ce1-xSnxO2 and Ce0.78Sn0.2Pd0.02O2-delta

Ce1-xSnxO2 (x = 0.1-0.5) solid solution and its Pd substituted analogue have been prepared by a single step solution combustion method using tin oxalate precursor. The compounds were characterized by X-ray diffraction (XRD), X-ray photoelectron spectroscopy (XPS), transmission electron microscopy (TEM), and H-2/temperature programmed redution (TPR) studies. The cubic fluorite structure remained intact up to 50% of Sri substitution in CeO2, and the compounds were stable up to 700 C. Oxygen storage capacity of Ce1-xSnxO2 was found to be much higher than that of Ce1-xZrxO2 due to accessible Ce4+/Ce3+ and Sn4+/Sn2+ redox couples at temperatures between 200 and 400 C. Pd 21 ions in Ce0.78Sn0.2Pd0.02O2-delta are highly ionic, and the lattice oxygen of this catalyst is highly labile, leading to low temperature CO to CO2 conversion. The rate of CO oxidation was 2 mu mol g(-1) s(-1) at 50 degrees C. NO reduction by CO with 70% N-2 selectivity was observed at similar to 200 degrees C and 100% N-2 selectivity below 260 degrees C with 1000-5000 ppm NO. Thus, Pd2+ ion substituted Ce1-xSnxO2 is a superior catalyst compared to Pd2+ ions in CeO2, Ce1-xZrxO2, and Ce1-xTixO2 for low temperature exhaust applications due to the involvement of the Sn2+/Sn4+ redox couple along with Pd2+/Pd-0 and Ce4+/Ce3+ couples.

Bearing capacity of circular footing on geocell-sand mattress overlying clay bed with void

The potential benefits of providing geocell reinforced sand mattress over clay subgrade with void have been investigated through a series of laboratory scale model tests. The parameters varied in the test programme include, thickness of unreinforced sand layer above clay bed, width and height of geocell mattress, relative density of the sand fill in the geocells, and influence of an additional layer of planar geogrid placed at the base of the geocell mattress. The test results indicate that substantial improvement in performance can be obtained with the provision of geocell mattress, of adequate size, over the clay subgrade with void. In order to have beneficial effect, the geocell mattress must spread beyond the void at least a distance equal to the diameter of the void. The influence of the void over the performance of the footing reduces for height of geocell mattress greater than 1.8 times the diameter of the footing. Better improvement in performance is obtained for geocells filled with dense soil. (C) 2008 Elsevier Ltd. All rights reserved.

Dynamic analysis and simulation of a VSC based Back-to-Back HVDC link

This paper presents the modeling and analysis of a voltage source converter (VSC) based back-to-back (BTB) HVDC link. The case study considers the response to changes in the active and reactive power and disturbance caused by single line to ground (SLG) fault. The controllers at each terminal are designed to inject a variable (magnitude and phase angle) sinusoidal, balanced set of voltages to regulate/control the active and reactive power. It is also possible to regulate the converter bus (AC) voltage by controlling the injected reactive power. The analysis is carried out using both d-q model (neglecting the harmonics in the output voltages of VSC) and three phase detailed model of VSC. While the eigenvalue analysis and controller design is based on the d-q model, the transient simulation considers both models.

Remarkable Capacity Retention of Nanostructured Manganese Oxide upon Cycling as an Electrode Material for Supercapacitor

Electrochemical capacity retention of nearly X-ray amorphous nanostructured manganese oxide (nanoMnO2) synthesized by mixing directly KMnO4 with ethylene glycol under ambient conditions for supercapacitor studies is enhanced significantly. Although X-ray diffraction (XRD) pattern of nanoMnO2 shows poor crystallinity, it is found that by Mn K-edge X-ray absorption near edge structure (XANES) measurement that the nanoMnO2 obtained is locally arranged in a δ-MnO2-type layered structure composed of edge-shared network of MnO6 octahedra. Field emission scanning electron microscopy and XANES measurements show that nanoMnO2 contains nearly spherical shaped morphology with δ-MnO2 structure, and 1D nanorods of α-MnO2 type structure (powder XRD) in the annealed (600 °C) sample. Volumetric nitrogen adsorption−desorption isotherms, inductively coupled plasma analysis, and thermal analysis are carried out to obtain physicochemical properties such as surface area (230 m2 g−1), porosity of nanoMnO2 (secondary mesopores of diameter 14.5 nm), water content, composition, etc., which lead to the promising electrochemical properties as an electrode for supercapacitor. The nanoMnO2 shows a very high stability even after 1200 cycles with capacity retention of about 250 F g−1.

Latency, Power and Performance Trade-offs in Network-on-Chips by Link Microarchitecture Exploration

This paper presents a power, latency and throughput trade-off study on NoCs by varying microarchitectural (e.g. pipelining) and circuit level (e.g. frequency and voltage) parameters. We change pipelining depth, operating frequency and supply voltage for 3 example NoCs - 16 node 2D Torus, Tree network and Reduced 2D Torus. We use an in-house NoC exploration framework capable of topology generation and comparison using parameterized models of Routers and links developed in SystemC. The framework utilizes interconnect power and delay models from a low-level modelling tool called Intacte[1]1. We find that increased pipelining can actually reduce latency. We also find that there exists an optimal degree of pipelining which is the most energy efficient in terms of minimizing energy-delay product.

Prediction of Ultimate Capacity of Laterally Loaded Piles in Clay: A Relevance Vector Machine Approach

This study investigates the potential of Relevance Vector Machine (RVM)-based approach to predict the ultimate capacity of laterally loaded pile in clay. RVM is a sparse approximate Bayesian kernel method. It can be seen as a probabilistic version of support vector machine. It provides much sparser regressors without compromising performance, and kernel bases give a small but worthwhile improvement in performance. RVM model outperforms the two other models based on root-mean-square-error (RMSE) and mean-absolute-error (MAE) performance criteria. It also stimates the prediction variance. The results presented in this paper clearly highlight that the RVM is a robust tool for prediction Of ultimate capacity of laterally loaded piles in clay.

Improved Algorithms for Reservoir Capacity Calculation Incorporating Storage-Dependent Losses and Reliability Norm

Two algorithms that improve upon the sequent-peak procedure for reservoir capacity calculation are presented. The first incorporates storage-dependent losses (like evaporation losses) exactly as the standard linear programming formulation does. The second extends the first so as to enable designing with less than maximum reliability even when allowable shortfall in any failure year is also specified. Together, the algorithms provide a more accurate, flexible and yet fast method of calculating the storage capacity requirement in preliminary screening and optimization models.

A DC-link Capacitor Voltage Balancing with CMV Elimination using only the Switching State Redundancies for a Reduced Switch Count Multi-Level Inverter fed IM Drive

Common mode voltage (CMV) variations in PWM inverter-fed drives generate unwanted shaft and bearing current resulting in early motor failure. Multilevel inverters reduce this problem to some extent, with higher number of levels. But the complexity of the power circuit increases with an increase in the number of inverter voltage levels. In this paper a five-level inverter structure is proposed for open-end winding induction motor (IM) drives, by cascading only two conventional two-level and three-level inverters, with the elimination of the common mode voltage over the entire modulation range. The DC link power supply requirement is also optimized by means of DC link capacitor voltage balancing, with PWM control., using only inverter switching state redundancies. The proposed power circuit gives a simple power bits structure.

A computerized methodology for structural synthesis of kinematic chains: Part 3 - application to the new case of 10-link, three- freedom chains

The unified computer program for structural synthesis and analysis developed in Part 1 has been employed to derive the new and complete collection of 97 10-link, three-freedom simple-jointed kinematic chains. The program shows that of these chains, 3 have total freedom, 70 have partial freedom and the remaining 24 have fractionated freedom and that the 97 chains yield a total of 676 distinct mechanisms.

Case study of a microcomputer-minicomputer link

A microcomputer-minicomputer link, useful in the implementation of network configurations involving microcomputers and minicomputers, is described. The link, between a PDP-11 minicomputer and an 8080 microcomputer is over a serial line between the DZ11 module of the minicomputer and the UART interface of the microcomputer. The details of the essential hardware and software aspects of the link are presented.