SoC memory hierarchy derivation from dataflow graphs

Hardware synthesis from dataflow graphs of signal processing systems is a growing research area as focus shifts to high level design methodologies. For data intensive systems, dataflow based synthesis can lead to an inefficient usage of memory due to the restrictive nature of synchronous dataflow and its inability to easily model data reuse. This paper explores how dataflow graph changes can be used to drive both the on-chip and off-chip memory organisation and how these memory architectures can be mapped to a hardware implementation. By exploiting the data reuse inherent to many image processing algorithms and by creating memory hierarchies, off-chip memory bandwidth can be reduced by a factor of a thousand from the original dataflow graph level specification of a motion estimation algorithm, with a minimal increase in memory size. This analysis is verified using results gathered from implementation of the motion estimation algorithm on a Xilinx Virtex-4 FPGA, where the delay between the memories and processing elements drops from 14.2 ns down to 1.878 ns through the refinement of the memory architecture. Care must be taken when modeling these algorithms however, as inefficiencies in these models can be easily translated into overuse of hardware resources.

Performance Analysis of Novel Randomly Shifted Certification Authority Authentication Protocol for MANETs

The provision of security in mobile ad hoc networks is of paramount importance due to their wireless nature. However, when conducting research into security protocols for ad hoc networks it is necessary to consider these in the context of the overall system. For example, communicational delay associated with the underlying MAC layer needs to be taken into account. Nodes in mobile ad hoc networks must strictly obey the rules of the underlying MAC when transmitting security-related messages while still maintaining a certain quality of service. In this paper a novel authentication protocol, RASCAAL, is described and its performance is analysed by investigating both the communicational-related effects of the underlying IEEE 802.11 MAC and the computational-related effects of the cryptographic algorithms employed. To the best of the authors' knowledge, RASCAAL is the first authentication protocol which proposes the concept of dynamically formed short-lived random clusters with no prior knowledge of the cluster head. The performance analysis demonstrates that the communication losses outweigh the computation losses with respect to energy and delay. MAC-related communicational effects account for 99% of the total delay and total energy consumption incurred by the RASCAAL protocol. The results also show that a saving in communicational energy of up to 12.5% can be achieved by changing the status of the wireless nodes during the course of operation. Copyright (C) 2009 G. A. Safdar and M. P. O'Neill (nee McLoone).

Parametric FIR Design of Propagation Loss Filters in Digital Waveguide String Models

One of the attractive features of sound synthesis by physical modeling is the potential to build acoustic-sounding digital instruments that offer more flexibility and different options in its design and control than their real-life counterparts. In order to develop such virtual-acoustic instruments, the models they are based on need to be fully parametric, i.e., all coefficients employed in the model are functions of physical parameters that are controlled either online or at the (offline) design stage. In this letter we show how propagation losses can be parametrically incorporated in digital waveguide string models with the use of zero-phase FIR filters. Starting from the simplest possible design in the form of a three-tap FIR filter, a higher-order FIR strategy is presented and discussed within the perspective of string sound synthesis with digital waveguide models.

The Ectocarpus genome and the independent evolution of multicellularity in brown algae

Brown algae (Phaeophyceae) are complex photosynthetic organisms with a very different evolutionary history to green plants, to which they are only distantly related(1). These seaweeds are the dominant species in rocky coastal ecosystems and they exhibit many interesting adaptations to these, often harsh, environments. Brown algae are also one of only a small number of eukaryotic lineages that have evolved complex multicellularity (Fig. 1). We report the 214 million base pair (Mbp) genome sequence of the filamentous seaweed Ectocarpus siliculosus (Dillwyn) Lyngbye, a model organism for brown algae(2-5), closely related to the kelps(6,7) (Fig. 1). Genome features such as the presence of an extended set of light-harvesting and pigment biosynthesis genes and new metabolic processes such as halide metabolism help explain the ability of this organism to cope with the highly variable tidal environment. The evolution of multicellularity in this lineage is correlated with the presence of a rich array of signal transduction genes. Of particular interest is the presence of a family of receptor kinases, as the independent evolution of related molecules has been linked with the emergence of multicellularity in both the animal and green plant lineages. The Ectocarpus genome sequence represents an important step towards developing this organism as a model species, providing the possibility to combine genomic and genetic(2) approaches to explore these and other(4,5) aspects of brown algal biology further.

Nonlinear excitations in strongly-coupled plasma lattices: envelope solitons, kinks and intrinsic localized modes

Ensembles of charged particles (plasmas) are a highly complex form of matter, most often modeled as a many-body system characterized by weak inter-particle interactions (electrostatic coupling). However, strongly-coupled plasma configurations have recently been produced in laboratory, either by creating ultra-cold plasmas confined in a trap or by manipulating dusty plasmas in discharge experiments. In this paper, the nonlinear aspects involved in the motion of charged dust grains in a one-dimensional plasma monolayer (crystal) are discussed. Different types of collective excitations are reviewed, and characteristics and conditions for their occurrence in dusty plasma crystals are discussed, in a quasi-continuum approximation. Dust crystals are shown to support nonlinear kink-shaped supersonic solitary longitudinal excitations, as well as modulated envelope localized modes associated with longitudinal and transverse vibrations. Furthermore, the possibility for intrinsic localized modes (ILMs) — Discrete Breathers (DBs) — to occur is investigated, from first principles. The effect of mode-coupling is also briefly considered. The relation to previous results on atomic chains, and also to experimental results on strongly-coupled dust layers in gas discharge plasmas, is briefly discussed.

QR decomposition-based matrix inversion for high performance embedded MIMO receivers

Real-time matrix inversion is a key enabling technology in multiple-input multiple-output (MIMO) communications systems, such as 802.11n. To date, however, no matrix inversion implementation has been devised which supports real-time operation for these standards. In this paper, we overcome this barrier by presenting a novel matrix inversion algorithm which is ideally suited to high performance floating-point implementation. We show how the resulting architecture offers fundamentally higher performance than currently published matrix inversion approaches and we use it to create the first reported architecture capable of supporting real-time 802.11n operation. Specifically, we present a matrix inversion approach based on modified squared Givens rotations (MSGR). This is a new QR decomposition algorithm which overcomes critical limitations in other QR algorithms that prohibits their application to MIMO systems. In addition, we present a novel modification that further reduces the complexity of MSGR by almost 20%. This enables real-time implementation with negligible reduction in the accuracy of the inversion operation, or the BER of a MIMO receiver based on this.

Optimal glycaemic control, pre-eclampsia and gestational hypertension in women with type 1 diabetes in the Diabetes and Pre-Eclampsia Intervention Trial

OBJECTIVE
To assess the relationship between glycemic control, pre-eclampsia, and gestational hypertension in women with type 1 diabetes.

RESEARCH DESIGN AND METHODS
Pregnancy outcome (pre-eclampsia or gestational hypertension) was assessed prospectively in 749 women from the randomized controlled Diabetes and Pre-eclampsia Intervention Trial (DAPIT). HbA1c (A1C) values were available up to 6 months before pregnancy (n = 542), at the first antenatal visit (median 9 weeks) (n = 721), at 26 weeks’ gestation (n = 592), and at 34 weeks’ gestation (n = 519) and were categorized as optimal (<6.1%: referent), good (6.1–6.9%), moderate (7.0–7.9%), and poor (=8.0%) glycemic control, respectively.

RESULTS
Pre-eclampsia and gestational hypertension developed in 17 and 11% of pregnancies, respectively. Women who developed pre-eclampsia had significantly higher A1C values before and during pregnancy compared with women who did not develop pre-eclampsia (P < 0.05, respectively). In early pregnancy, A1C =8.0% was associated with a significantly increased risk of pre-eclampsia (odds ratio 3.68 [95% CI 1.17–11.6]) compared with optimal control. At 26 weeks’ gestation, A1C values =6.1% (good: 2.09 [1.03–4.21]; moderate: 3.20 [1.47–7.00]; and poor: 3.81 [1.30–11.1]) and at 34 weeks’ gestation A1C values =7.0% (moderate: 3.27 [1.31–8.20] and poor: 8.01 [2.04–31.5]) significantly increased the risk of pre-eclampsia compared with optimal control. The adjusted odds ratios for pre-eclampsia for each 1% decrement in A1C before pregnancy, at the first antenatal visit, at 26 weeks’ gestation, and at 34 weeks’ gestation were 0.88 (0.75–1.03), 0.75 (0.64–0.88), 0.57 (0.42–0.78), and 0.47 (0.31–0.70), respectively. Glycemic control was not significantly associated with gestational hypertension.

CONCLUSIONS
Women who developed pre-eclampsia had significantly higher A1C values before and during pregnancy. These data suggest that optimal glycemic control both early and throughout pregnancy may reduce the risk of pre-eclampsia in women with type 1 diabetes.

Real-valued fixed-complexity sphere decoder for high dimensional QAM-MIMO systems

The development of high performance, low computational complexity detection algorithms is a key challenge for real-time Multiple-Input Multiple-Output (MIMO) communication system design. The Fixed-Complexity Sphere Decoder (FSD) algorithm is one of the most promising approaches, enabling quasi-ML decoding accuracy and high performance implementation due to its deterministic, highly parallel structure. However, it suffers from exponential growth in computational complexity as the number of MIMO transmit antennas increases, critically limiting its scalability to larger MIMO system topologies. In this paper, we present a solution to this problem by applying a novel cutting protocol to the decoding tree of a real-valued FSD algorithm. The new Real-valued Fixed-Complexity Sphere Decoder (RFSD) algorithm derived achieves similar quasi-ML decoding performance as FSD, but with an average 70% reduction in computational complexity, as we demonstrate from both theoretical and implementation perspectives for Quadrature Amplitude Modulation (QAM)-MIMO systems.

Low-complexity iterative method of equalization for single carrier with cyclic prefix in doubly selective channels

Orthogonal frequency division multiplexing (OFDM) requires an expensive linear amplifier at the transmitter due to its high peak-to-average power ratio (PAPR). Single carrier with cyclic prefix (SC-CP) is a closely related transmission scheme that possesses most of the benefits of OFDM but does not have the PAPR problem. Although in a multipath environment, SC-CP is very robust to frequency-selective fading, it is sensitive to the time-selective fading characteristics of the wireless channel that disturbs the orthogonality of the channel matrix (CM) and increases the computational complexity of the receiver. In this paper, we propose a time-domain low-complexity iterative algorithm to compensate for the effects of time selectivity of the channel that exploits the sparsity present in the channel convolution matrix. Simulation results show the superior performance of the proposed algorithm over the standard linear minimum mean-square error (L-MMSE) equalizer for SC-CP.

Image segmentation based on multi-scan constraint satisfaction neural network

A novel image segmentation method based on a constraint satisfaction neural network (CSNN) is presented. The new method uses CSNN-based relaxation but with a modified scanning scheme of the image. The pixels are visited with more distant intervals and wider neighborhoods in the first level of the algorithm. The intervals between pixels and their neighborhoods are reduced in the following stages of the algorithm. This method contributes to the formation of more regular segments rapidly and consistently. A cluster validity index to determine the number of segments is also added to complete the proposed method into a fully automatic unsupervised segmentation scheme. The results are compared quantitatively by means of a novel segmentation evaluation criterion. The results are promising.

On the Performance of Eigenvalue-Based Cooperative Spectrum Sensing for Cognitive Radio

In this paper, the distribution of the ratio of extreme eigenvalues of a complex Wishart matrix is studied in order to calculate the exact decision threshold as a function of the desired probability of false alarm for the maximum-minimum eigenvalue (MME) detector. In contrast to the asymptotic analysis reported in the literature, we consider a finite number of cooperative receivers and a finite number of samples and derive the exact decision threshold for the probability of false alarm. The proposed exact formulation is further reduced to the case of two receiver-based cooperative spectrum sensing. In addition, an approximate closed-form formula of the exact threshold is derived in terms of a desired probability of false alarm for a special case having equal number of receive antennas and signal samples. Finally, the derived analytical exact decision thresholds are verified with Monte-Carlo simulations. We show that the probability of detection performance using the proposed exact decision thresholds achieves significant performance gains compared to the performance of the asymptotic decision threshold.

Nonrigid Structure-From-Motion From 2-D Images Using Markov Chain Monte Carlo

In this paper we present a new method for simultaneously determining three dimensional (3-D) shape and motion of a non-rigid object from uncalibrated two dimensional (2- D) images without assuming the distribution characteristics. A non-rigid motion can be treated as a combination of a rigid rotation and a non-rigid deformation. To seek accurate recovery of deformable structures, we estimate the probability distribution function of the corresponding features through random sampling, incorporating an established probabilistic model. The fitting between the observation and the projection of the estimated 3-D structure will be evaluated using a Markov chain Monte Carlo based expectation maximisation algorithm. Applications of the proposed method to both synthetic and real image sequences are demonstrated with promising results.