43,716 research outputs found
Polar Codes for Arbitrary DMCs and Arbitrary MACs
Polar codes are constructed for arbitrary channels by imposing an arbitrary
quasigroup structure on the input alphabet. Just as with "usual" polar codes,
the block error probability under successive cancellation decoding is
, where is the block length. Encoding and
decoding for these codes can be implemented with a complexity of .
It is shown that the same technique can be used to construct polar codes for
arbitrary multiple access channels (MAC) by using an appropriate Abelian group
structure. Although the symmetric sum capacity is achieved by this coding
scheme, some points in the symmetric capacity region may not be achieved. In
the case where the channel is a combination of linear channels, we provide a
necessary and sufficient condition characterizing the channels whose symmetric
capacity region is preserved by the polarization process. We also provide a
sufficient condition for having a maximal loss in the dominant face.Comment: 32 pages, 1 figure. arXiv admin note: text overlap with
arXiv:1112.177
Principles of Physical Layer Security in Multiuser Wireless Networks: A Survey
This paper provides a comprehensive review of the domain of physical layer
security in multiuser wireless networks. The essential premise of
physical-layer security is to enable the exchange of confidential messages over
a wireless medium in the presence of unauthorized eavesdroppers without relying
on higher-layer encryption. This can be achieved primarily in two ways: without
the need for a secret key by intelligently designing transmit coding
strategies, or by exploiting the wireless communication medium to develop
secret keys over public channels. The survey begins with an overview of the
foundations dating back to the pioneering work of Shannon and Wyner on
information-theoretic security. We then describe the evolution of secure
transmission strategies from point-to-point channels to multiple-antenna
systems, followed by generalizations to multiuser broadcast, multiple-access,
interference, and relay networks. Secret-key generation and establishment
protocols based on physical layer mechanisms are subsequently covered.
Approaches for secrecy based on channel coding design are then examined, along
with a description of inter-disciplinary approaches based on game theory and
stochastic geometry. The associated problem of physical-layer message
authentication is also introduced briefly. The survey concludes with
observations on potential research directions in this area.Comment: 23 pages, 10 figures, 303 refs. arXiv admin note: text overlap with
arXiv:1303.1609 by other authors. IEEE Communications Surveys and Tutorials,
201
Layered Steered SpaceāTime-Spreading-Aided Generalized MC DS-CDMA
AbstractāWe present a novel trifunctional multiple-inputā multiple-output (MIMO) scheme that intrinsically amalgamates spaceātime spreading (STS) to achieve a diversity gain and a Vertical Bell Labs layered spaceātime (V-BLAST) scheme to attain a multiplexing gain in the context of generalized multicarrier direct-sequence code-division multiple access (MC DS-CDMA), as well as beamforming. Furthermore, the proposed system employs both time- and frequency-domain spreading to increase the number of users, which is also combined with a user-grouping technique to reduce the effects of multiuser interference
Performance of the Smart Antenna Aided Generalized Multicarrier DS-CDMA Downlink using both Time-Domain Spreading and Steered Space-Time Spreading
In this contribution a generalized MC DS-CDMA system invoking smart antennas for improving the achievable performance in the downlink of the system is studied, which is capable of minimizing the downlink interference inflicted upon co-channel mobiles, while achieving frequency, time and spatial diversity. In the MC DS-CDMA system considered the transmitter employs multiple antenna arrays and each of the antenna arrays consists of several antenna elements. More specifically, the space-time transmitter processing scheme considered is based on the principles of Steered Space-Time Spreading (SSTS). Furthermore, the generalized MC DS-CDMA system employs time and frequency (TF)-domain spreading, where a user-grouping technique is employed for reducing the effects of multiuser interference
An improved rate region for the classical-quantum broadcast channel
We present a new achievable rate region for the two-user binary-input
classical-quantum broadcast channel. The result is a generalization of the
classical Marton-Gelfand-Pinsker region and is provably larger than the best
previously known rate region for classical-quantum broadcast channels. The
proof of achievability is based on the recently introduced polar coding scheme
and its generalization to quantum network information theory.Comment: 5 pages, double column, 1 figure, based on a result presented in the
Master's thesis arXiv:1501.0373
Joint Coding and Scheduling Optimization in Wireless Systems with Varying Delay Sensitivities
Throughput and per-packet delay can present strong trade-offs that are
important in the cases of delay sensitive applications.We investigate such
trade-offs using a random linear network coding scheme for one or more
receivers in single hop wireless packet erasure broadcast channels. We capture
the delay sensitivities across different types of network applications using a
class of delay metrics based on the norms of packet arrival times. With these
delay metrics, we establish a unified framework to characterize the rate and
delay requirements of applications and optimize system parameters. In the
single receiver case, we demonstrate the trade-off between average packet
delay, which we view as the inverse of throughput, and maximum ordered
inter-arrival delay for various system parameters. For a single broadcast
channel with multiple receivers having different delay constraints and feedback
delays, we jointly optimize the coding parameters and time-division scheduling
parameters at the transmitters. We formulate the optimization problem as a
Generalized Geometric Program (GGP). This approach allows the transmitters to
adjust adaptively the coding and scheduling parameters for efficient allocation
of network resources under varying delay constraints. In the case where the
receivers are served by multiple non-interfering wireless broadcast channels,
the same optimization problem is formulated as a Signomial Program, which is
NP-hard in general. We provide approximation methods using successive
formulation of geometric programs and show the convergence of approximations.Comment: 9 pages, 10 figure
- ā¦