Interference cancellation schemes for MIMO MC-CDM in fading channels

A novel interference cancellation (IC) scheme for MIMO MC-CDM systems is proposed. It is shown that the existing IC schemes are suboptimum and their performance can be improved by utilising some special properties of the residual interference after interference cancellation.

Humanitarian Travels: Ethical Communication in Lonely Planet Guidebooks

Aside from the more mundane purpose of telling us where to eat, sleep and sightsee in foreign lands, guidebooks communicate an ethical vision that sees travel as the key to reducing cultural differences and inequalities. This article argues that Lonely Planet guidebooks in particular encourage a form of ‘responsible independent travel’ that both reflects and produces a powerful discourse of humanitarianism. By examining the controversy over Lonely Planet’s publication of guidebooks to Burma, this article uncovers the problematic colonial logic embedded in that ethical vision.

Communication, recognition and social work: Aligning the ethical theories of Habermas and Honneth

The modern world is replete with ethical challenges of Orwellian proportions. The violation of human rights and misrecognition of identities are two of the most pressing examples. In this paper, the ethical theories of Habermas and Honneth are aligned as a way of addressing these specific challenges within social work. It is suggested that these theories are complementary, mutually rectifying and concordant at the meta-ethical level of analysis. The alignment is also justified, pargmatically, through the construction of three hypothetical vignettes demonstrating different kinds of practice dilemmas. The need for egalitarian communication and the imperative to recognise human identity in all its dimensions subsequently emerge as the two foundation stones for ethical deliberation in social work.

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.

Low SNR Capacity for MIMO Rician and Rayleigh-Product Fading Channels with Single Co-channel Interferer and Noise

This paper studies the ergodic capacity of multiple-input multiple-output (MIMO) systems with a single co-channel interferer in the low signal-to-noise-ratio (SNR) regime. Two MIMO models namely Rician and Rayleigh-product channels are investigated. Exact analytical expressions for the minimum energy per information bit, Eb/N0min, and wideband slope, S0, are derived for both channels. Our results show that the minimum energy per information bit is the same for both channels while their wideband slopes differ significantly. Further, the impact of the numbers of transmit and receive antennas, the Rician K factor, the channel mean matrix and the interference-to-noise-ratio (INR) on the capacity, is addressed. Results indicate that interference degrades the capacity by increasing the required minimum energy per information bit and reducing the wideband slope. Simulation results validate our analytical results.

Network formation under mutual consent and costly communication

We consider two different approaches to describe the formation of social networks under mutual consent and costly communication. First, we consider a network-based approach; in particular Jackson–Wolinsky’s concept of pairwise stability. Next, we discuss a non-cooperative game-theoretic approach, through a refinement of the Nash equilibria of Myerson’s consent game. This refinement, denoted as monadic stability, describes myopically forward looking behavior of the players. We show through an equivalence that the class of monadically stable networks is a strict subset of the class of pairwise stable networks that can be characterized fully by modifications of the properties defining pairwise stability.