Communication channel

About: Communication channel is a research topic. Over the lifetime, 137411 publications have been published within this topic receiving 1715077 citations. The topic is also known as: communication channel & communications channel.

Tripling the capacity of wireless communications using electromagnetic polarization

Abstract: Wireless communications are a fundamental part of modern information infrastructure. But wireless bandwidth is costly, prompting a close examination of the data channels available using electromagnetic waves. Classically, radio communications have relied on one channel per frequency, although it is well understood that the two polarization states of planar waves allow two distinct information channels; techniques such as 'polarization diversity' already take advantage of this. Recent work has shown that environments with scattering, such as urban areas or indoors, also possess independent spatial channels that can be used to enhance capacity greatly. In either case, the relevant signal processing techniques come under the heading of 'multiple-input/multiple-output' communications, because multiple antennae are required to access the polarization or spatial channels. Here we show that, in a scattering environment, an extra factor of three in channel capacity can be obtained, relative to the conventional limit using dual-polarized radio signals. The extra capacity arises because there are six distinguishable electric and magnetic states of polarization at a given point, rather than two as is usually assumed.

Applications of LDPC Codes to the Wiretap Channel

Abstract: With the advent of quantum key distribution (QKD) systems, perfect (i.e., information-theoretic) security can now be achieved for distribution of a cryptographic key. QKD systems and similar protocols use classical error-correcting codes for both error correction (for the honest parties to correct errors) and privacy amplification (to make an eavesdropper fully ignorant). From a coding perspective, a good model that corresponds to such a setting is the wire tap channel introduced by Wyner in 1975. In this correspondence, we study fundamental limits and coding methods for wire tap channels. We provide an alternative view of the proof for secrecy capacity of wire tap channels and show how capacity achieving codes can be used to achieve the secrecy capacity for any wiretap channel. We also consider binary erasure channel and binary symmetric channel special cases for the wiretap channel and propose specific practical codes. In some cases our designs achieve the secrecy capacity and in others the codes provide security at rates below secrecy capacity. For the special case of a noiseless main channel and binary erasure channel, we consider encoder and decoder design for codes achieving secrecy on the wiretap channel; we show that it is possible to construct linear-time decodable secrecy codes based on low-density parity-check (LDPC) codes that achieve secrecy.

Channel Selection and Coordination in Dual-Channel Supply Chains

Abstract: This paper investigates the influence of channel structures and channel coordination on the supplier, the retailer, and the entire supply chain in the context of two single-channel and two dual-channel supply chains. We extensively study two Pareto zone concepts: channel-adding Pareto zone and contract-implementing Pareto zone. In the channel-adding Pareto zone, both the supplier and the retailer benefit from adding a new channel to the traditional single-channel supply chain. In the contract-implementing Pareto zone, it is mutually beneficial for the supplier and the retailer to utilize the proposed contract coordination policy. The analysis suggests the preference lists of the supplier and the retailer over channel structures with and without coordination are different, and depend on parameters like channel base demand, channel operational costs, and channel substitutability.

Long-range prediction of fading signals

Abstract: It was previously proposed to adapt several transmission methods, including modulation, power control, channel coding, and antenna diversity to rapidly time variant fading channel conditions. Prediction of the channel coefficients several tens-to-hundreds of symbols ahead is essential to realize these methods in practice. We describe a novel adaptive long-range fading channel prediction algorithm (LRP) and its utilization with adaptive transmission methods. The LRP is validated for standard stationary fading models and tested with measured data and with data produced by our novel realistic physical channel model. Both numerical and simulation results show that long-range prediction makes adaptive transmission techniques feasible for mobile radio channels.

Energy-Efficient Resource Allocation in OFDMA Systems with Large Numbers of Base Station Antennas

Abstract: In this paper, resource allocation for energy-efficient communication in an orthogonal frequency division multiple access (OFDMA) downlink network with a large number of transmit antennas is studied. The considered problem is modeled as a non-convex optimization problem which takes into account the circuit power consumption, imperfect channel state information at the transmitter (CSIT), and different quality of service (QoS) requirements including a minimum required data rate and a maximum tolerable channel outage probability. The power allocation, data rate adaptation, antenna allocation, and subcarrier allocation policies are optimized for maximization of the energy efficiency of data transmission (bit/Joule delivered to the users). By exploiting the properties of fractional programming, the resulting non-convex optimization problem in fractional form is transformed into an equivalent optimization problem in subtractive form, which leads to an efficient iterative resource allocation algorithm. In each iteration, the objective function is lower bounded by a concave function which can be maximized by using dual decomposition. Simulation results illustrate that the proposed iterative resource allocation algorithm converges in a small number of iterations and demonstrate the trade-off between energy efficiency and the number of transmit antennas.