Turbo channel estimation and equalisation for a superposition-based cooperative system

This study investigates the superposition-based cooperative transmission system. In this system, a key point is for the relay node to detect data transmitted from the source node. This issued was less considered in the existing literature as the channel is usually assumed to be flat fading and a priori known. In practice, however, the channel is not only a priori unknown but subject to frequency selective fading. Channel estimation is thus necessary. Of particular interest is the channel estimation at the relay node which imposes extra requirement for the system resources. The authors propose a novel turbo least-square channel estimator by exploring the superposition structure of the transmission data. The proposed channel estimator not only requires no pilot symbols but also has significantly better performance than the classic approach. The soft-in-soft-out minimum mean square error (MMSE) equaliser is also re-derived to match the superimposed data structure. Finally computer simulation results are shown to verify the proposed algorithm.

An oblivious shortest-path routing algorithm for fully connected cubic networks

Fully connected cubic networks (FCCNs) are a class of newly proposed hierarchical interconnection networks for multicomputer systems, which enjoy the strengths of constant node degree and good expandability. The shortest path routing in FCCNs is an open problem. In this paper, we present an oblivious routing algorithm for n-level FCCN with N = 8(n) nodes, and prove that this algorithm creates a shortest path from the source to the destination. At the costs of both an O(N)-parallel-step off-line preprocessing phase and a list of size N stored at each node, the proposed algorithm is carried out at each related node in O(n) time. In some cases the proposed algorithm is superior to the one proposed by Chang and Wang in terms of the length of the routing path. This justifies the utility of our routing strategy. (C) 2006 Elsevier Inc. All rights reserved.

Nonlinear channel equalizer design using directional evolutionary multi-objective optimization

In this paper, a new equalizer learning scheme is introduced based on the algorithm of the directional evolutionary multi-objective optimization (EMOO). Whilst nonlinear channel equalizers such as the radial basis function (RBF) equalizers have been widely studied to combat the linear and nonlinear distortions in the modern communication systems, most of them do not take into account the equalizers' generalization capabilities. In this paper, equalizers are designed aiming at improving their generalization capabilities. It is proposed that this objective can be achieved by treating the equalizer design problem as a multi-objective optimization (MOO) problem, with each objective based on one of several training sets, followed by deriving equalizers with good capabilities of recovering the signals for all the training sets. Conventional EMOO which is widely applied in the MOO problems suffers from disadvantages such as slow convergence speed. Directional EMOO improves the computational efficiency of the conventional EMOO by explicitly making use of the directional information. The new equalizer learning scheme based on the directional EMOO is applied to the RBF equalizer design. Computer simulation demonstrates that the new scheme can be used to derive RBF equalizers with good generalization capabilities, i.e., good performance on predicting the unseen samples.

Flux difference splitting for open channel flows

A finite difference scheme based on flux difference splitting is presented for the solution of the one-dimensional shallow-water equations in open channels, together with an extension to two-dimensional flows. A linearized problem, analogous to that of Riemann for gas dynamics, is defined and a scheme, based on numerical characteristic decomposition, is presented for obtaining approximate solutions to the linearized problem. The method of upwind differencing is used for the resulting scalar problems, together with a flux limiter for obtaining a second-order scheme which avoids non-physical, spurious oscillations. The scheme is applied to a one-dimensional dam-break problem, and to a problem of flow in a river whose geometry induces a region of supercritical flow. The scheme is also applied to a two-dimensional dam-break problem. The numerical results are compared with the exact solution, or other numerical results, where available.

A numerical scheme for two-dimensional, open channel flows with non-rectangular geometries

An algorithm based on flux difference splitting is presented for the solution of two-dimensional, open channel flows. A transformation maps a non-rectangular, physical domain into a rectangular one. The governing equations are then the shallow water equations, including terms of slope and friction, in a generalized coordinate system. A regular mesh on a rectangular computational domain can then be employed. The resulting scheme has good jump capturing properties and the advantage of using boundary/body-fitted meshes. The scheme is applied to a problem of flow in a river whose geometry induces a region of supercritical flow.

Pseudogene rescue: an adaptive mechanism of codon reassignment

Alterations to the genetic code – codon reassignments – have occurred many times in life’s history, despite the fact that genomes are coadapted to their genetic codes and therefore alterations are likely to be maladaptive. A potential mechanism for adaptive codon reassignment, which could trigger either a temporary period of codon ambiguity or a permanent genetic code change, is the reactivation of a pseudogene by a nonsense suppressor mutant transfer RNA. I examine the population genetics of each stage of this process and find that pseudogene rescue is plausible and also readily explains some features of extant variability in genetic codes.