Analysis of Receiver Algorithms for LTE SC-FDMA Based Uplink MIMO Systems

This letter derives mathematical expressions for the received signal-to-interference-plus-noise ratio (SINR) of uplink Single Carrier (SC) Frequency Division Multiple Access (FDMA) multiuser MIMO systems. An improved frequency domain receiver algorithm is derived for the studied systems, and is shown to be significantly superior to the conventional linear MMSE based receiver in terms of SINR and bit error rate (BER) performance.

Iterative Multiuser Detection and Decoding for DS-CDMA System With Space-Time Linear Dispersion

This paper considers a Q-ary orthogonal direct-sequence code-division multiple-access (DS-CDMA) system with high-rate space-time linear dispersion codes (LDCs) in time-varying Rayleigh fading multiple-input-multiple-output (MIMO) channels. We propose a joint multiuser detection, LDC decoding, Q-ary demodulation, and channel-decoding algorithm and apply the turbo processing principle to improve system performance in an iterative fashion. The proposed iterative scheme demonstrates faster convergence and superior performance compared with the V-BLAST-based DS-CDMA system and is shown to approach the single-user performance bound. We also show that the CDMA system is able to exploit the time diversity offered by the LDCS in rapid-fading channels.

Revealing differences in gene network inference algorithms on the network level by ensemble methods

Motivation: The inference of regulatory networks from large-scale expression data holds great promise because of the potentially causal interpretation of these networks. However, due to the difficulty to establish reliable methods based on observational data there is so far only incomplete knowledge about possibilities and limitations of such inference methods in this context.

Results: In this article, we conduct a statistical analysis investigating differences and similarities of four network inference algorithms, ARACNE, CLR, MRNET and RN, with respect to local network-based measures. We employ ensemble methods allowing to assess the inferability down to the level of individual edges. Our analysis reveals the bias of these inference methods with respect to the inference of various network components and, hence, provides guidance in the interpretation of inferred regulatory networks from expression data. Further, as application we predict the total number of regulatory interactions in human B cells and hypothesize about the role of Myc and its targets regarding molecular information processing.

Iterative Receiver Design for MIMO Systems with Improper Signal Constellations

In this paper, we propose a novel iterative receiver
strategy for uncoded multiple-input, multiple-output (MIMO)
systems employing improper signal constellations. The proposed
scheme is shown to achieve superior performance and faster
convergence without the loss of spectrum efficiency compared
to the conventional iterative receivers. The superiority of this
novel approach over conventional solutions is verified by both
simulation and analytical results.

A finite element solution scheme for an elastic–viscoplastic soil model

A Newton–Raphson solution scheme with a stress point algorithm is presented for the implementation of an elastic–viscoplastic soilmodel in a finite element program. Viscoplastic strain rates are calculated using the stress and volumetric states of the soil. Sub-incrementsof time are defined for each iterative calculation of elastic–viscoplastic stress changes so that their sum adds up to the time incrementfor the load step. This carefully defined ‘iterative time’ ensures that the correct amount of viscoplastic straining is accumulated overthe applied load step. The algorithms and assumptions required to implement the solution scheme are provided. Verification of the solutionscheme is achieved by using it to analyze typical boundary value problems.

Low power field programmable gate array implementation of fast digital signal processing algorithms: characterisation and manipulation of data locality

Dynamic power consumption is very dependent on interconnect, so clever mapping of digital signal processing algorithms to parallelised realisations with data locality is vital. This is a particular problem for fast algorithm implementations where typically, designers will have sacrificed circuit structure for efficiency in software implementation. This study outlines an approach for reducing the dynamic power consumption of a class of fast algorithms by minimising the index space separation; this allows the generation of field programmable gate array (FPGA) implementations with reduced power consumption. It is shown how a 50% reduction in relative index space separation results in a measured power gain of 36 and 37% over a Cooley-Tukey Fast Fourier Transform (FFT)-based solution for both actual power measurements for a Xilinx Virtex-II FPGA implementation and circuit measurements for a Xilinx Virtex-5 implementation. The authors show the generality of the approach by applying it to a number of other fast algorithms namely the discrete cosine, the discrete Hartley and the Walsh-Hadamard transforms.