Results 81 to 90 of about 2,636,497 (234)
Timely Updates over an Erasure Channel [PDF]
, 2017 Using an age of information (AoI) metric, we examine the transmission of coded updates through a binary erasure channel to a monitor/receiver. We start by deriving the average status update age of an infinite incremental redundancy (IIR) system in which ...
Najm, Elie +3 more
core +2 more sources
Spinal code based on lightweight hash function
Archives of Electrical Engineering, 2023 : A spinal code is the type of rateless code, which has been proved to be capacity-achieving over both a binary symmetric channel (BSC) and an additive white Gaussian noise (AWGN) channel.
Lina Wang, Xinran Li
semanticscholar +1 more source
Efficient Symbol Sorting for High Intermediate Recovery Rate of LT Codes
, 2010 LT codes are modern and efficient rateless forward error correction (FEC) codes with close to channel capacity performance. Nevertheless, in intermediate range where the number of received encoded symbols is less than the number of source symbols, LT ...
Rahnavard, Nazanin +2 more
core +1 more source
Adaptive demodulation using rateless erasure codes [PDF]
IEEE Transactions on Communications, 2006 We introduce a rate-adaptive system in which the receiver demodulates only those bits that have a high probability of being correct, treating nondemodulated bits as erasures. Several sets of decision regions, derived using composite hypothesis testing, are proposed for 16-QAM and 16-phase-shift keying, which allow for the simple implementation of this ...
J.D. Brown +2 more
openaire +1 more source
EURASIP Journal on Wireless Communications and Networking, 2011 A network reprogramming protocol is made for updating the firmware of a wireless sensor network (WSN) in situ. For security reasons, every firmware update must be authenticated to prevent an attacker from installing its code in the network.
Zhang Yu +4 more
doaj
Whether and Where to Code in the Wireless Relay Channel
, 2012 The throughput benefits of random linear network codes have been studied extensively for wirelined and wireless erasure networks. It is often assumed that all nodes within a network perform coding operations.
Lucani, Daniel E. +2 more
core +1 more source
A Rateless Code Transmission Strategy Based on Real Time Service
Dianxin kexue, 2013 Rateless codes has the advantage of good channel adaptivity with a low amount of feedback data.However,the data transmission delay caused by its own coding characteristics and its sensitivity of the feedback link quality directly affects its application ...
Shaohua Zhao +4 more
doaj +2 more sources
Scheduling of Multicast and Unicast Services under Limited Feedback by using Rateless Codes
, 2014 Many opportunistic scheduling techniques are impractical because they require accurate channel state information (CSI) at the transmitter. In this paper, we investigate the scheduling of unicast and multicast services in a downlink network with a very ...
Kim, Kyu-Han +3 more
core +1 more source
Adaptive Demodulation in Differentially Coherent Phase Systems: Design and Performance Analysis
, 2010 Adaptive Demodulation (ADM) is a newly proposed rate-adaptive system which operates without requiring Channel State Information (CSI) at the transmitter (unlike adaptive modulation) by using adaptive decision region boundaries at the receiver and ...
Abouei, Jamshid +3 more
core +1 more source
Multiple Access Analog Fountain Codes
, 2014 In this paper, we propose a novel rateless multiple access scheme based on the recently proposed capacity-approaching analog fountain code (AFC). We show that the multiple access process will create an equivalent analog fountain code, referred to as the ...
Li, Yonghui +2 more
core +1 more source