—We study the information rates of non-coherent, stationary, Gaussian, multiple-input multiple-output (MIMO) at-fading channels that are achievable with nearest neighbour de...
A. Taufiq Asyhari, Tobias Koch, Albert Guillen i F...
This paper addresses cooperative Time Division Duplex (TDD) relaying in the multiple-antenna case with full Channel State Information (CSI), i.e. assuming perfect knowledge of all ...
In this paper, the achievable rates of the so called "multiple-input multiple-output interference channel", exploited by a couple of single antenna primary terminals and...
—In a wireless network, the use of cooperation among nodes can significantly improve capacity and robustness to fading. Node cooperation can take many forms, including relaying ...
— In this paper we present several strategies for multiple relay networks which are constrained by a half-duplex operation, i. e., each node either transmits or receives on a par...
—This paper proposes a relaying strategy for the multiple-relay network in which each relay decodes a selection of transmitted messages by other transmitting terminals, and forwa...
— We present an achievable rate for general deterministic relay networks, with broadcasting at the transmitters and interference at the receivers. In particular we show that if t...
Amir Salman Avestimehr, Suhas N. Diggavi, David N....
—The optimal decoder achieving the outage capacity under imperfect channel estimation is investigated. First, by searching into the family of nearest neighbor decoders, which can...
—We consider two-way wire-tap channels, where two users are communicating with each other in the presence of an eavesdropper, who has access to the communications through a multi...
Abstract -We investigate the achievable rate of data transmission from sources to sinks through a multiple-relay network. We study achievable rates for omniscient coding, in which ...