1,252 research outputs found
Low Complexity Opportunistic Decoder for Network Coding
In this paper, we propose a novel opportunistic
decoding scheme for network coding decoder which significantly
reduces the decoder complexity and increases the throughput.
Network coding was proposed to improve the network
throughput and reliability, especially for multicast transmissions.
Although network coding increases the network performance,
the complexity of the network coding decoder algorithm is still
high, especially for higher dimensional finite fields or larger
network codes. Different software and hardware approaches were
proposed to accelerate the decoding algorithm, but the decoder
remains to be the bottleneck for high speed data transmission.
We propose a novel decoding scheme which exploits the structure
of the network coding matrix to reduce the network decoder
complexity and improve throughput. We also implemented the
proposed scheme on Virtex 7 FPGA and compared our implementation
to the widely used Gaussian elimination.Renesas MobileNational Science Foundation (NSF
Fulcrum: Flexible Network Coding for Heterogeneous Devices
Producción CientíficaWe introduce Fulcrum, a network coding framework that achieves three seemingly conflicting objectives: 1) to reduce the coding coefficient overhead down to nearly n bits per packet in a generation of n packets; 2) to conduct the network coding using only Galois field GF(2) operations at intermediate nodes if necessary, dramatically reducing computing complexity in the network; and 3) to deliver an end-to-end performance that is close to that of a high-field network coding system for high-end receivers, while simultaneously catering to low-end receivers that decode in GF(2). As a consequence of 1) and 3), Fulcrum has a unique trait missing so far in the network coding literature: providing the network with the flexibility to distribute computational complexity over different devices depending on their current load, network conditions, or energy constraints. At the core of our framework lies the idea of precoding at the sources using an expansion field GF(2 h ), h > 1, to increase the number of dimensions seen by the network. Fulcrum can use any high-field linear code for precoding, e.g., Reed-Solomon or Random Linear Network Coding (RLNC). Our analysis shows that the number of additional dimensions created during precoding controls the trade-off between delay, overhead, and computing complexity. Our implementation and measurements show that Fulcrum achieves similar decoding probabilities as high field RLNC but with encoders and decoders that are an order of magnitude faster.Green Mobile Cloud project (grant DFF-0602-01372B)Colorcast project (grant DFF-0602-02661B)TuneSCode project (grant DFF - 1335-00125)Danish Council for Independent Research (grant DFF-4002-00367)Ministerio de Economía, Industria y Competitividad - Fondo Europeo de Desarrollo Regional (grants MTM2012-36917-C03-03 / MTM2015-65764-C3-2-P / MTM2015-69138-REDT)Agencia Estatal de Investigación - Fondo Social Europeo (grant RYC-2016-20208)Aarhus Universitets Forskningsfond Starting (grant AUFF-2017-FLS-7-1
On the Design of a Novel Joint Network-Channel Coding Scheme for the Multiple Access Relay Channel
This paper proposes a novel joint non-binary network-channel code for the
Time-Division Decode-and-Forward Multiple Access Relay Channel (TD-DF-MARC),
where the relay linearly combines -- over a non-binary finite field -- the
coded sequences from the source nodes. A method based on an EXIT chart analysis
is derived for selecting the best coefficients of the linear combination.
Moreover, it is shown that for different setups of the system, different
coefficients should be chosen in order to improve the performance. This
conclusion contrasts with previous works where a random selection was
considered. Monte Carlo simulations show that the proposed scheme outperforms,
in terms of its gap to the outage probabilities, the previously published joint
network-channel coding approaches. Besides, this gain is achieved by using very
short-length codewords, which makes the scheme particularly attractive for
low-latency applications.Comment: 28 pages, 9 figures; Submitted to IEEE Journal on Selected Areas in
Communications - Special Issue on Theories and Methods for Advanced Wireless
Relays, 201
An Opportunistic Error Correction Layer for OFDM Systems
In this paper, we propose a novel cross layer scheme to lower power\ud
consumption of ADCs in OFDM systems, which is based on resolution\ud
adaptive ADCs and Fountain codes. The key part in the new proposed\ud
system is that the dynamic range of ADCs can be reduced by\ud
discarding the packets which are transmitted over 'bad' sub\ud
carriers. Correspondingly, the power consumption in ADCs can be\ud
reduced. Also, the new system does not process all the packets but\ud
only processes surviving packets. This new error correction layer\ud
does not require perfect channel knowledge, so it can be used in a\ud
realistic system where the channel is estimated. With this new\ud
approach, more than 70% of the energy consumption in the ADC can be\ud
saved compared with the conventional IEEE 802.11a WLAN system under\ud
the same channel conditions and throughput. The ADC in a receiver\ud
can consume up to 50% of the total baseband energy. Moreover, to\ud
reduce the overhead of Fountain codes, we apply message passing and\ud
Gaussian elimination in the decoder. In this way, the overhead is\ud
3% for a small block size (i.e. 500 packets). Using both methods\ud
results in an efficient system with low delay
- …