1,032 research outputs found
Optical Time-Frequency Packing: Principles, Design, Implementation, and Experimental Demonstration
Time-frequency packing (TFP) transmission provides the highest achievable
spectral efficiency with a constrained symbol alphabet and detector complexity.
In this work, the application of the TFP technique to fiber-optic systems is
investigated and experimentally demonstrated. The main theoretical aspects,
design guidelines, and implementation issues are discussed, focusing on those
aspects which are peculiar to TFP systems. In particular, adaptive compensation
of propagation impairments, matched filtering, and maximum a posteriori
probability detection are obtained by a combination of a butterfly equalizer
and four 8-state parallel Bahl-Cocke-Jelinek-Raviv (BCJR) detectors. A novel
algorithm that ensures adaptive equalization, channel estimation, and a proper
distribution of tasks between the equalizer and BCJR detectors is proposed. A
set of irregular low-density parity-check codes with different rates is
designed to operate at low error rates and approach the spectral efficiency
limit achievable by TFP at different signal-to-noise ratios. An experimental
demonstration of the designed system is finally provided with five
dual-polarization QPSK-modulated optical carriers, densely packed in a 100 GHz
bandwidth, employing a recirculating loop to test the performance of the system
at different transmission distances.Comment: This paper has been accepted for publication in the IEEE/OSA Journal
of Lightwave Technolog
Equivalent-Capacity-Based Design of Space-Time Block-Coded Sphere-Packing-Aided Multilevel Coding
A multilevel coding (MLC) scheme invoking sphere packing (SP) modulation combined with space time block coding (STBC) is designed. The coding rates of each of the MLC component codes are determined using the so-called equivalent capacity based constituent-code rate-calculation procedure invoking a 4-dimensional (4D) sphere packing bit-to-symbol mapping scheme. Four different-rate Low-Density Parity Check (LDPC) constituent-codes are used by the MLC scheme. The performance of the resultant equivalent capacity based design is characterized using simulation results. Our results demonstrate an approximately 3.5dB gain over an identical scheme dispensing with SP modulation. Furthermore although a similar performance gain is attained by both the proposed MLC scheme and its benchmarker, which uses a single-class LDPC code, the MLC scheme is preferred, since it benefits from the new classic philosophy of using low-memory, low-complexity component codes as well as providing an unequal error protection capability
A Survey of Physical Layer Security Techniques for 5G Wireless Networks and Challenges Ahead
Physical layer security which safeguards data confidentiality based on the
information-theoretic approaches has received significant research interest
recently. The key idea behind physical layer security is to utilize the
intrinsic randomness of the transmission channel to guarantee the security in
physical layer. The evolution towards 5G wireless communications poses new
challenges for physical layer security research. This paper provides a latest
survey of the physical layer security research on various promising 5G
technologies, including physical layer security coding, massive multiple-input
multiple-output, millimeter wave communications, heterogeneous networks,
non-orthogonal multiple access, full duplex technology, etc. Technical
challenges which remain unresolved at the time of writing are summarized and
the future trends of physical layer security in 5G and beyond are discussed.Comment: To appear in IEEE Journal on Selected Areas in Communication
Low-power Secret-key Agreement over OFDM
Information-theoretic secret-key agreement is perhaps the most practically
feasible mechanism that provides unconditional security at the physical layer
to date. In this paper, we consider the problem of secret-key agreement by
sharing randomness at low power over an orthogonal frequency division
multiplexing (OFDM) link, in the presence of an eavesdropper. The low power
assumption greatly simplifies the design of the randomness sharing scheme, even
in a fading channel scenario. We assess the performance of the proposed system
in terms of secrecy key rate and show that a practical approach to key sharing
is obtained by using low-density parity check (LDPC) codes for information
reconciliation. Numerical results confirm the merits of the proposed approach
as a feasible and practical solution. Moreover, the outage formulation allows
to implement secret-key agreement even when only statistical knowledge of the
eavesdropper channel is available.Comment: 9 pages, 4 figures; this is the authors prepared version of the paper
with the same name accepted for HotWiSec 2013, the Second ACM Workshop on Hot
Topics on Wireless Network Security and Privacy, Budapest, Hungary 17-19
April 201
Protograph-Based LDPC Code Design for Probabilistic Shaping with On-Off Keying
This work investigates protograph-based LDPC codes for the AWGN channel with
OOK modulation. A non-uniform distribution of the OOK modulation symbols is
considered to improve the power efficiency especially for low SNRs. To this
end, a specific transmitter architecture based on time sharing is proposed that
allows probabilistic shaping of (some) OOK modulation symbols. Tailored
protograph-based LDPC code designs outperform standard schemes with uniform
signaling and off-the-shelf codes by 1.1 dB for a transmission rate of 0.25
bits/channel use.Comment: Invited Paper for CISS 201
Sub-Nyquist Field Trial Using Time Frequency Packed DP-QPSK Super-Channel Within Fixed ITU-T Grid
Sub-Nyquist time frequency packing technique was demonstrated for the first
time in a super channel field trial transmission over long-haul distances. The
technique allows a limited spectral occupancy even with low order modulation
formats. The transmission was successfully performed on a deployed Australian
link between Sydney and Melbourne which included 995 km of uncompensated SMF
with coexistent traffic. 40 and 100 Gb/s co-propagating channels were
transmitted together with the super-channel in a 50 GHz ITU-T grid without
additional penalty. The super-channel consisted of eight sub-channels with
low-level modulation format, i.e. DP-QPSK, guaranteeing better OSNR robustness
and reduced complexity with respect to higher order formats. At the receiver
side, coherent detection was used together with iterative maximum-a-posteriori
(MAP) detection and decoding. A 975 Gb/s DP-QPSK super-channel was successfully
transmitted between Sydney and Melbourne within four 50GHz WSS channels (200
GHz). A maximum potential SE of 5.58 bit/s/Hz was achieved with an OSNR=15.8
dB, comparable to the OSNR of the installed 100 Gb/s channels. The system
reliability was proven through long term measurements. In addition, by closing
the link in a loop back configuration, a potential SE*d product of 9254
bit/s/Hz*km was achieved
Orthogonal Multiple Access with Correlated Sources: Feasible Region and Pragmatic Schemes
In this paper, we consider orthogonal multiple access coding schemes, where
correlated sources are encoded in a distributed fashion and transmitted,
through additive white Gaussian noise (AWGN) channels, to an access point (AP).
At the AP, component decoders, associated with the source encoders, iteratively
exchange soft information by taking into account the source correlation. The
first goal of this paper is to investigate the ultimate achievable performance
limits in terms of a multi-dimensional feasible region in the space of channel
parameters, deriving insights on the impact of the number of sources. The
second goal is the design of pragmatic schemes, where the sources use
"off-the-shelf" channel codes. In order to analyze the performance of given
coding schemes, we propose an extrinsic information transfer (EXIT)-based
approach, which allows to determine the corresponding multi-dimensional
feasible regions. On the basis of the proposed analytical framework, the
performance of pragmatic coded schemes, based on serially concatenated
convolutional codes (SCCCs), is discussed
- …