1,880 research outputs found
Spatially-Coupled Random Access on Graphs
In this paper we investigate the effect of spatial coupling applied to the
recently-proposed coded slotted ALOHA (CSA) random access protocol. Thanks to
the bridge between the graphical model describing the iterative interference
cancelation process of CSA over the random access frame and the erasure
recovery process of low-density parity-check (LDPC) codes over the binary
erasure channel (BEC), we propose an access protocol which is inspired by the
convolutional LDPC code construction. The proposed protocol exploits the
terminations of its graphical model to achieve the spatial coupling effect,
attaining performance close to the theoretical limits of CSA. As for the
convolutional LDPC code case, large iterative decoding thresholds are obtained
by simply increasing the density of the graph. We show that the threshold
saturation effect takes place by defining a suitable counterpart of the
maximum-a-posteriori decoding threshold of spatially-coupled LDPC code
ensembles. In the asymptotic setting, the proposed scheme allows sustaining a
traffic close to 1 [packets/slot].Comment: To be presented at IEEE ISIT 2012, Bosto
Tiny Codes for Guaranteeable Delay
Future 5G systems will need to support ultra-reliable low-latency
communications scenarios. From a latency-reliability viewpoint, it is
inefficient to rely on average utility-based system design. Therefore, we
introduce the notion of guaranteeable delay which is the average delay plus
three standard deviations of the mean. We investigate the trade-off between
guaranteeable delay and throughput for point-to-point wireless erasure links
with unreliable and delayed feedback, by bringing together signal flow
techniques to the area of coding. We use tiny codes, i.e. sliding window by
coding with just 2 packets, and design three variations of selective-repeat ARQ
protocols, by building on the baseline scheme, i.e. uncoded ARQ, developed by
Ausavapattanakun and Nosratinia: (i) Hybrid ARQ with soft combining at the
receiver; (ii) cumulative feedback-based ARQ without rate adaptation; and (iii)
Coded ARQ with rate adaptation based on the cumulative feedback. Contrasting
the performance of these protocols with uncoded ARQ, we demonstrate that HARQ
performs only slightly better, cumulative feedback-based ARQ does not provide
significant throughput while it has better average delay, and Coded ARQ can
provide gains up to about 40% in terms of throughput. Coded ARQ also provides
delay guarantees, and is robust to various challenges such as imperfect and
delayed feedback, burst erasures, and round-trip time fluctuations. This
feature may be preferable for meeting the strict end-to-end latency and
reliability requirements of future use cases of ultra-reliable low-latency
communications in 5G, such as mission-critical communications and industrial
control for critical control messaging.Comment: to appear in IEEE JSAC Special Issue on URLLC in Wireless Network
Streaming Codes for Channels with Burst and Isolated Erasures
We study low-delay error correction codes for streaming recovery over a class
of packet-erasure channels that introduce both burst-erasures and isolated
erasures. We propose a simple, yet effective class of codes whose parameters
can be tuned to obtain a tradeoff between the capability to correct burst and
isolated erasures. Our construction generalizes previously proposed low-delay
codes which are effective only against burst erasures. We establish an
information theoretic upper bound on the capability of any code to
simultaneously correct burst and isolated erasures and show that our proposed
constructions meet the upper bound in some special cases. We discuss the
operational significance of column-distance and column-span metrics and
establish that the rate 1/2 codes discovered by Martinian and Sundberg [IT
Trans.\, 2004] through a computer search indeed attain the optimal
column-distance and column-span tradeoff. Numerical simulations over a
Gilbert-Elliott channel model and a Fritchman model show significant
performance gains over previously proposed low-delay codes and random linear
codes for certain range of channel parameters
Coded Slotted ALOHA: A Graph-Based Method for Uncoordinated Multiple Access
In this paper, a random access scheme is introduced which relies on the
combination of packet erasure correcting codes and successive interference
cancellation (SIC). The scheme is named coded slotted ALOHA. A bipartite graph
representation of the SIC process, resembling iterative decoding of generalized
low-density parity-check codes over the erasure channel, is exploited to
optimize the selection probabilities of the component erasure correcting codes
via density evolution analysis. The capacity (in packets per slot) of the
scheme is then analyzed in the context of the collision channel without
feedback. Moreover, a capacity bound is developed and component code
distributions tightly approaching the bound are derived.Comment: The final version to appear in IEEE Trans. Inf. Theory. 18 pages, 10
figure
Enhancement of Secrecy of Block Ciphered Systems by Deliberate Noise
This paper considers the problem of end-end security enhancement by resorting
to deliberate noise injected in ciphertexts. The main goal is to generate a
degraded wiretap channel in application layer over which Wyner-type secrecy
encoding is invoked to deliver additional secure information. More
specifically, we study secrecy enhancement of DES block cipher working in
cipher feedback model (CFB) when adjustable and intentional noise is introduced
into encrypted data in application layer. A verification strategy in exhaustive
search step of linear attack is designed to allow Eve to mount a successful
attack in the noisy environment. Thus, a controllable wiretap channel is
created over multiple frames by taking advantage of errors in Eve's
cryptanalysis, whose secrecy capacity is found for the case of known channel
states at receivers. As a result, additional secure information can be
delivered by performing Wyner type secrecy encoding over super-frames ahead of
encryption, namely, our proposed secrecy encoding-then-encryption scheme. These
secrecy bits could be taken as symmetric keys for upcoming frames. Numerical
results indicate that a sufficiently large secrecy rate can be achieved by
selective noise addition.Comment: 11 pages, 8 figures, journa
- …