The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The computation of mutual informations of large scale systems with finite input alphabet and Gaussian noise has often prohibitive complexities. In this paper, we propose a novel approach exploiting the sphere decoding concept to bound and approximate such mutual information term with reduced complexity and good accuracy. Using Monte-Carlo simulations, the method is numerically demonstrated for the...
Mobile devices or sensor nodes are usually energy-constrained, and in some scenarios it is inconvenient or impractical to charge or replace batteries. To tackle this problem, the idea of transferring power to mobile devices wirelessly via radio frequency signals has recently gained much attention. In this paper, we consider a point-to-point communication system in which the transferred power is used...
Recent advances in microwave technology and signal processing have unveiled the potential of the so-called wireless power transfer (WPT) from one device to the other. This has resulted in reducing the need of a local power source at the wireless devices. In this paper, we target a popular physical layer technology, namely the orthogonal frequency division multiplexing (OFDM) and propose a novel approach...
We consider compressive sensing as a source coding method for signal transmission. We concatenate a convolutional coding system with 1-bit compressive sensing to obtain a serial concatenated system model for sparse signal transmission over an AWGN channel. The proposed source/channel decoder, which we refer to as turbo CS, is robust against channel noise and its signal reconstruction performance at...
There is an increasing demand for broadcasting information of common interest to a large number of users. The unreliable nature of wireless links and the difficulty of acknowledging the correct reception of every broadcast packet by every user when the number of users becomes large are two major challenges for wireless network broadcasting. In this paper we investigate the problem that a base station...
This paper considers the coded OFDM system and instead of discarding the cyclic prefix (CP) at the receiver, we utilize the CP observation for joint detection, decoding and channel estimation. In particular, detection and decoding are performed iteratively between an equalizer and a soft-input soft-output (SISO) decoder based on the turbo principle, and the expectation-maximization (EM) algorithm...
In the cooperative data exchange problem, a group of wireless clients use a shared broadcast channel to exchange packets from a given set X. Each of the clients has a subset of packets in X available to it as a side information. The clients transmit linear combinations of the packets one after the other, until all clients are able to recover all packets in X. This problem arises naturally in many...
In this paper, we propose a new hardware-efficient ML decoding algorithm for a spatial modulation scheme which is basically constructed by serially concatenating maximum-ratio receive combiners with traditional slicers. With respect to complex multiplications, the new algorithm has a greatly reduced decoding complexity compared to the conventional one, especially, for higher-order modulation. This...
A realistic Recursive Spatial Multiplexing (RSM) scheme for the case of a wireless feedback channel with limited capacity is considered where the identifier for the critical subspaces are encoded using either Grassmannian or vector quantizers. Optimum and suboptimum encoding schemes are proposed and analyzed. The threshold for the eigenvalues of the channel matrix required in the receiver for determining...
In this paper, we propose a practical transmission scheme using polar coding for the half-duplex degraded relay-eavesdropper channel. We prove that the proposed scheme can achieve the maximum perfect secrecy rate under the decode-and-forward (DF) strategy. Our proposed scheme provides an approach for ensuring both reliable and secure transmission over the relay-eavesdropper channel while enjoying...
Vector Symbolic Architectures (VSA) are methods designed to enable distributed representation and manipulation of semantically-structured information, such as natural languages. Recently, a new VSA based on multiplication of distributed vectors by random matrices was proposed, this is known as Matrix-Binding-of-Additive-Terms (MBAT). We propose an enhancement that introduces an important additional...
A K-user repeat-accumulate interleave-division (RAID) system is considered for a Gaussian multiple access channel (GMAC) with binary inputs, equal-power, and symbol synchronization. In this system, a regular repeat accumulate (RA) code serially concatenated with spreading, where the rate of RA code and spreading length both can be changed, is employed for each user. K users are divided into M groups...
This work investigates the broadcast channel with the knowledge of noncausal interference at the transmitter and side information at the receivers. The system studied involves one transmitter sending private information to two receivers. We first obtain an achievable rate region of this system by extending Gelfand and Pinsker's (GP's) random binning method, originally designed for point-to-point communications...
A K-user nonbinary parallel concatenated code (PCC) is proposed for a Gaussian MAC with symbol synchronization, equal-power, and equal-rate users. In a K-user q-ary PCC over finite field GF(q), each user employs a parallel concatenated code, with a rate-(1/r) q-ary repetition component code and M rate-1 q-ary accumulation component codes. Employing q-ary repetition code is to overcome the multi-user...
Recent advances in information theory (IT) have shown great promises of interference alignment (IA) for cellular networks. However, due to a number of assumptions, these IT results cannot be directly applied to address practical problems. The goal of this paper is to fill in this gap by studying IA for cellular networks with more practical settings. We propose an IA scheme that includes constraints...
We consider the problem of noncoherent error correction in multiple-source multicast networks. We show that a distributed network error-correcting code can be designed as a subcode of a Gabidulin code. This allows the destination nodes to utilize any decoder designed using rank-metric. We show that this achieves the full capacity region of any network with up to three messages, with optimal scaling...
The article addresses the problem of constructing a multiple access system for a multi-user vector adder channel (the channel with intensity information or the B-channel). To solve the problem we propose an asynchronous1 coding scheme employing a single-user detection. For the resulting multiple access system we estimate the probability of wrong decoding. Based on this result an asymptotic lower estimate...
In the paper the problem of metric description of processes defined by two-state Markov models is considered. The class of special metrics is presented, the approach of matching the metrics from this class with the Markov models is proposed. In the special case of simple Markov chain the metric matched with Markov chain for large set of its parameters is given. The metric may be used in decision-making...
In this paper we propose new coded modulation for multiple-input and multiple-output (MIMO) communication systems. This coded modulation is a genralised concatenated code. Its inner code is embedded Golden code which we introduce in this paper with a decoding algorithm. Its outer code is a product code with component Reed-Solomon code. We use iterative decoding algorithm for this product code. The...
In what follows signal-code constructions employing block and convolutional nonbinary inner codes that can perform under severe jamming are proposed. Robustness of the proposed signal-code constructions to jamming is verified by means of simulation.
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.