Beamspace Aware Adaptive Channel Estimation for Single-Carrier Time-varying Massive MIMO Channels

In this paper, the problem of sequential beam construction and adaptive channel estimation based on reduced rank (RR) Kalman filtering for frequency-selective massive multiple-input multiple-output (MIMO) systems employing single-carrier (SC) in time division duplex (TDD) mode are considered. In two-stage beamforming, a new algorithm for statistical pre-beamformer design is proposed for spatially correlated time-varying wideband MIMO channels under the assumption that the channel is a stationary Gauss-Markov random process. The proposed algorithm yields a nearly optimal pre-beamformer whose beam pattern is designed sequentially with low complexity by taking the user-grouping into account, and exploiting the properties of Kalman filtering and associated prediction error covariance matrices. The resulting design, based on the second order statistical properties of the channel, generates beamspace on which the RR Kalman estimator can be realized as accurately as possible. It is observed that the adaptive channel estimation technique together with the proposed sequential beamspace construction shows remarkable robustness to the pilot interference. This comes with significant reduction in both pilot overhead and dimension of the pre-beamformer lowering both hardware complexity and power consumption.Comment: 7 pages, 3 figures, accepted by IEEE ICC 2017 Wireless Communications Symposiu

Reliable and Fault-Resilient Schemes for Efficient Radix-4 Complex Division

Complex division is commonly used in various applications in signal processing and control theory including astronomy and nonlinear RF measurements. Nevertheless, unless reliability and assurance are embedded into the architectures of such structures, the suboptimal (and thus erroneous) results could undermine the objectives of such applications. As such, in this thesis, we present schemes to provide complex number division architectures based on (Sweeney, Robertson, and Tocher) SRT-division with fault diagnosis mechanisms. Different fault resilient architectures are proposed in this thesis which can be tailored based on the eventual objectives of the designs in terms of area and time requirements, among which we pinpoint carefully the schemes based on recomputing with shifted operands (RESO) to be able to detect both natural and malicious faults and with proper modification achieve high throughputs. The design also implements a minimized look up table approach which favors in error detection based designs and provides high fault coverage with relatively-low overhead. Additionally, to benchmark the effectiveness of the proposed schemes, extensive fault diagnosis assessments are performed for the proposed designs through fault simulations and FPGA implementations; the design is implemented on Xilinx Spartan-VI and Xilinx Virtex-VI FPGA families

A multi-radix approach to asynchronous division

The speed of high-radix digit-recurrence dividers is mainly determined by the hardware complexity of the quotient-digit selection function. In this paper we present a scheme that combines the area efficiency of bundled data with data-dependent computation time. In this scheme the selection function is very simple and may be implemented using a fast adder This function speculates the result digit and, when the speculation is incorrect, a correction of the quotient and of the residual must be performed. When the residual satisfies some constraints it is also possible to switch to a higher radix, computing a fraction of the next digit in advance. This results in a division scheme with a variable iteration time and a variable number of iterations and hence with an asynchronous behaviour Several designs were realized and compared both in terms of execution time and area. The fastest unit considered is a radix-64 divider that may switch to radix 128 or 256. Our evaluations show that area /spl times/ delay savings from 25% to 65%, compared to equivalent synchronous designs, may be achieved.Peer ReviewedPostprint (published version