On the Diversity-Multiplexing Tradefoff for Wireless Cooperative Multiple Access Systems

A spectrally efficient strategy is proposed for cooperative multiple access (CMA) channels in a centralized communication environment with $N$ users. By applying superposition coding, each user will transmit a mixture containing its own information as well as the other users', which means that each user shares parts of its power with the others. The use of superposition coding in cooperative networks was first proposed in , which will be generalized to a multiple-user scenario in this paper. Since the proposed CMA system can be seen as a precoded point-to-point multiple-antenna system, its performance can be best evaluated using the diversity-multiplexing tradeoff. By carefully categorizing the outage events, the diversity-multiplexing tradeoff can be obtained, which shows that the proposed cooperative strategy can achieve larger diversity/multiplexing gain than the compared transmission schemes at any diversity/multiplexing gain. Furthermore, it is demonstrated that the proposed strategy can achieve optimal tradeoff for multiplexing gains $0leq r leq 1$ whereas the compared cooperative scheme is only optimal for $0leq r leq ({1}/{N})$. As discussed in the paper, such superiority of the proposed CMA system is due to the fact that the relaying transmission does not consume extra channel use and, hence, the deteriorating effect of cooperative communication on the data rate is effectively limited.

Gene selection by cooperative competition clustering

Clustering analysis of data from DNA microarray hybridization studies is an essential task for identifying biologically relevant groups of genes. Attribute cluster algorithm (ACA) has provided an attractive way to group and select meaningful genes. However, ACA needs much prior knowledge about the genes to set the number of clusters. In practical applications, if the number of clusters is misspecified, the performance of the ACA will deteriorate rapidly. In fact, it is a very demanding to do that because of our little knowledge. We propose the Cooperative Competition Cluster Algorithm (CCCA) in this paper. In the algorithm, we assume that both cooperation and competition exist simultaneously between clusters in the process of clustering. By using this principle of Cooperative Competition, the number of clusters can be found in the process of clustering. Experimental results on a synthetic and gene expression data are demonstrated. The results show that CCCA can choose the number of clusters automatically and get excellent performance with respect to other competing methods.

Nucleation and growth in fluidised hot melt granulation

Fluidised hot melt granulation (FHMG) is a novel technology for granulation process in pharmaceutical industry, which has distinct advantages over other commercial techniques. The aim of this research was to investigate granulation and the effect of process parameters that may affect FHMG process. In this work, ballotini beads were used as the model particles and Lutrol (R) F 68 Poloxamer 188 was used as meltable solid binder. In order to determine the granulation and nucleation mechanism in this co-melt FHMG system, several parameters were investigated, such as binder content, particle size of binder and particle size and hydrophobicity of ballotini. These parameters were correlated to granule size distribution, mean granule size and granule shape. Furthermore, these experimental investigations were designed so that the coalescence model could be applied to the co-melt FHMG system. The analysis indicated that the non-inertial regime extends over a relatively short time period of

Spectrally efficient cooperative diversity protocol for uplink wireless transmission

A spectrally efficient cooperative protocol for uplink wireless transmission in a centralised communication system is proposed, where each of the N users play the relaying and source roles simultaneously by using superposition (SP) modulation. The probability density function of the mutual information between SP-modulated transmitted and received signals of the cooperative uplink channels is derived. Using the high-signal-to-noise ratio (SNR) approximation of this density function, the outage probability formula of the system as well as its easily computable tight upper and lower bounds are obtained and these formulas are evaluated numerically. Numerical results show that the proposed strategy can achieve around 3 dB performance gain over comparable schemes. Furthermore, the multiplexing and diversity tradeoff formula is derived to illustrate the optimal performance of the proposed protocol, which also confirms that the SP relaying transmission does not cause any loss of data rate. Moreover, performance characterisation in terms of ergodic and outage capacities are studied and numerical results show that the proposed scheme can achieve significantly larger outage capacity than direct transmission, which is similar to other cooperative schemes. The superiority of the proposed strategy is demonstrated by the fact that it can maintain almost the same ergodic capacity as the direct transmission, whereas the ergodic capacity of other cooperative schemes would be much worse.

Cooperative transmission protocol with full diversity and iterative detection

The authors propose a three-node full diversity cooperative protocol, which allows the retransmission of all symbols. By allowing multiple nodes to transmit simultaneously, relaying transmission only consumes limited bandwidth resource. To facilitate the performance analysis of the proposed cooperative protocol, the lower and upper bounds of the outage probability are first developed, and then the high signal-to-noise ratio behaviour is studied. Our analytical results show that the proposed strategy can achieve full diversity. To achieve the performance gain promised by the cooperative diversity, at the relays decode-and-forward strategy is adopted and an iterative soft-interference-cancellation minimum mean-squared error equaliser is developed. The simulation results compare the bit-error-rate performance of the proposed protocol with the non-cooperative scheme and the scheme presented by Azarian et al. ( 2005).