Outage probability of multiple-input single-output (MISO) systems with delayed feedback

We investigate the effect of feedback delay on the outage probability of multiple-input single-output (MISO) fading channels. Channel state information at the transmitter (CSIT) is a delayed version of the channel state information available at the receiver (CSIR). We consider two cases of CSIR: (a) perfect CSIR and (b) CSI estimated at the receiver using training symbols. With perfect CSIR, under a short-term power constraint, we determine: (a) the outage probability for beamforming with imperfect CSIT (BF-IC) analytically, and (b) the optimal spatial power allocation (OSPA) scheme that minimizes outage numerically. Results show that, for delayed CSIT, BF-IC is close to optimal for low SNR and uniform spatial power allocation (USPA) is close to optimal at high SNR. Similarly, under a longterm power constraint, we show that BF-IC is better for low SNR and USPA is better at high SNR. With imperfect CSIR, we obtain an upper bound on the outage probability with USPA and BF-IC. Results show that the loss in performance due to imperfection in CSIR is not significant, if the training power is chosen appropriately.     

Effect of differential maturity of paddy grains in a panicle on their milling quality

Branches of paddy panicles were divided into four equal parts and grains collected from each part separately. Moisture content at harvest and milling breakage after shade drying of grains to 12 to 13% moisture were determined. Average moisture content of grains gradually increased while milling quality generally suffered in grains from the top first quarter to the last quarter at the bottom. The same trend was found when the grains in the “top” quarter were compared with those from the “rest” of the panicle. The proportion of sun-checked grains was highest in the “top” fractions at all stages of maturity. The grains at the “top” also had a tendency to shed easily from the panicle. At early stages of maturity milling breakage of grains in lower portions of panicles was high perhaps due to immaturity and softness.     

Time-selective signaling and reception for communication overmultipath fading channels

The mobile wireless channel affords inherent diversity to combat the effects of fading. Existing code-division multiple-access systems, by virtue of spread-spectrum signaling and RAKE reception, exploit only part of the channel diversity via multipath combination. Moreover, their performance degrades under fast fading commonly encountered in mobile scenarios. In this paper, we develop new signaling and reception techniques that maximally exploit channel diversity via joint multipath-Doppler processing. Our approach is based on a canonical representation of the wireless channel, which leads to a time-frequency generalization of the RAKE receiver for diversity processing. Our signaling scheme facilitates joint multipath-Doppler diversity by spreading the symbol waveform beyond the intersymbol duration to make the channel time-selective. A variety of detection schemes are developed to account for the intersymbol interference (ISI) due to overlapping symbols. However, our results indicate that the effects of ISI are virtually negligible due to the excellent correlation properties of the pseudorandom codes. Performance analysis also shows that relatively small Doppler spreads can yield significant diversity gains. The inherently higher level of diversity achieved by time-selective signaling brings the fading channel closer to an additive white Gaussian noise channel, thereby facilitating the use of powerful existing coding techniques for Gaussian channels     

Co-ordinate Interleaved Spatial Multiplexing with Channel State Information

Performance of spatial multiplexing multiple-input multiple-output (MIMO) wireless systems can be improved with channel state information (CSI) at both ends of the link. This paper proposes a new linear diagonal MIMO transceiver, referred to as co-ordinate interleaved spatial multiplexing (CISM). With CSI at transmitter and receiver, CISM diagonalizes the MIMO channel and interleaves the co-ordinates of the input symbols (from rotated QAM constellations) transmitted over different eigenmodes. The analytical and simulation results show that with co-ordinate interleaving across two eigenmodes, the diversity gain of the data stream transmitted over the weaker eigenmode becomes equal to that of the data transmitted on the stronger eigenmode, resulting in a significant improvement in the overall diversity. The diversity-multiplexing tradeoff (DMT) is analyzed for CISM and is shown that it achieves higher diversity gain at all positive multiplexing gains compared to existing diagonal transceivers. Over rank n MIMO channels, with input symbols from rotated n-dimensional constellations, the DMT of CISM is a straight line connecting the endpoints (0,N_tN_r) and (min{N_t,N_r}, 0), where N_t, and N_r} are the number of transmit and receive antennas, respectively.     

Real-time algorithms and architectures for multiuser channelestimation and detection in wireless base-station receivers

This paper presents algorithms and architecture designs that can meet real-time requirements of multiuser channel estimation and detection in future code-division multiple-access-based wireless base-station receivers. Sophisticated algorithms proposed to implement multiuser channel estimation and detection make their real-time implementation difficult on current digital signal processor-based receivers. A maximum-likelihood based multiuser channel estimation scheme requiring matrix inversions is redesigned from an implementation perspective for a reduced complexity, iterative scheme with a simple fixed-point very large scale integration (VLSI) architecture. A reduced-complexity, bit-streaming multiuser detection algorithm that avoids the need for multishot detection is also developed for a simple, pipelined VLSI architecture. Thus, we develop real-time solutions for multiuser channel estimation and detection for third-generation wireless systems by: (1) designing the algorithms from a fixed-point implementation perspective, without significant loss in error rate performance; (2) task partitioning; and (3) designing bit-streaming fixed-point VLSI architectures that explore pipelining, parallelism, and bit-level computations to achieve real-time with minimum area overhead     

Efficient VLSI Architectures for Multiuser Channel Estimation in Wireless Base-Station Receivers

This paper presents a reduced-complexity, fixed-point algorithm and efficient real-time VLSI architectures for multiuser channel estimation, one of the core baseband processing operations in wireless base-station receivers for CDMA. Future wireless base-station receivers will need to use sophisticated algorithms to support extremely high data rates and multimedia. Current DSP implementations of these algorithms are unable to meet real-time requirements. However, there exists massive parallelism and bit level arithmetic present in these algorithms than can be revealed and efficiently implemented in a VLSI architecture. We re-design an existing channel estimation algorithm from an implementation perspective for a reduced complexity, fixed-point hardware implementation. Fixed point simulations are presented to evaluate the precision requirements of the algorithm. A dependence graph of the algorithm is presented and area-time trade-offs are developed. An area-constrained architecture achieves low data rates with minimum hardware, which may be used in pico-cell base-stations. A time-constrained solution exploits the entire available parallelism and determines the maximum theoretical data processing rates. An area-time efficient architecture meets real-time requirements with minimum area overhead.     

Reduced integration and the shear-flexible beam element

A clearer insight into the ‘shear locking’ phenomenon, which appears in the development of C₀ continuous element using shear-flexible or penalty type formulations, is obtained by a careful study of the Timoshenko beam element. When a penalty type argument is used to degenerate thick elements to thin elements, the various approximations of the shear related energy terms act as different types of constraints and, depending on the formulation, two types of constraints which are classified as true or spurious may emerge. The spurious constraints, where they exist, are responsible for the ‘shear locking’ phenomenon, and its manifestation and elimination is demonstrated in a very simple example. The source of difficulty is shown to be the mathematical operations involved in the various shape function definitions and subsequent integration of functionals. It is seen that formulations that ensure only true constraints in the extreme penalty limit cases display far superior performance in the thick element situation as well, and thus guidelines for the development of efficient elements are drawn. A similar type of behaviour is observed in a shallow curved beam element and here ‘inplane locking’ can be eliminated by selective integration to obtain an improved curved beam element. However, ‘inplane locking’ does not cause a spurious constraint as the error quickly vanishes with the reduction of element size for a reasonable radius of curvature conforming with shallow shell theory.     

A sub-optimal joint subcarrier and power allocation algorithm for multiuser OFDM

This paper investigates subcarrier and power allocation in multiuser OFDM. The aim is to maximize the overall rate while achieving proportional fairness amongst users under a total power constraint. Achieving the optimal solution is computationally demanding thereby necessitating the use of sub-optimal techniques. Existing sub-optimal techniques either use fixed power allocation and perform only subcarrier allocation or handle subcarrier and power allocation separately. In this paper, we propose an algorithm that performs joint subcarrier and power allocation. Simulation results are shown to compare the performance of the proposed algorithm with that of existing algorithms.