A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Filters
Multiplicative repetition-based spinal codes with low computational complexity
2017
IET Communications
Preserved Fulltext
Hash function is the core of a spinal encoder to generate infinite coded symbols, which has higher hardware complexity. ...
In this study, the authors propose a multiplicative repetition-based method instead of the hash function to generate innumerable symbols with low encoding complexity. ...
Min Zhu for their insightful discussion and helpful comments. ...
doi:10.1049/iet-com.2016.1401
fatcat:crqz5qzhhfc2fksyonda2nmz6q
Joint equalization and decoding scheme using modified spinal codes for underwater communications
2016
OCEANS 2016 MTS/IEEE Monterey
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose a small block length coding scheme and its associate joint equalization and decoding algorithm based on Spinal codes. ...
Hence, for time-varying UAC with a low coherence time, small interleaver block length have to be used. ...
The M-algorithm is simple but very efficient in decoding Spinal codes. ...
doi:10.1109/oceans.2016.7761418
fatcat:aogy3l6cnvf23ofkb7bcb5vkvq
Design of segmented CRC-aided spinal codes for IoT applications
2020
IET Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
We design the segmented CRC-aided (SCA) spinal codes and propose a novel hybrid decoding algorithm. ...
. • We propose the SCA-spinal codes with a tail-biting coding structure. ...
Another decoding method for the spinal codes with efficiently distributed symbols is proposed in [8] , where the decoder uses a grouping method to reduce the decoding complexity and has a throughput gain ...
doi:10.1049/iet-com.2019.0907
fatcat:zarxqaaxljbtlekc5m3lpddl3y
New Upper Bounds on the Error Probability under ML Decoding for Spinal Codes and the Joint Transmission-Decoding System Design
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Moreover, we also develop a dynamic TITT-matching decoding algorithm, called the bubble decoding with memory (BD-M) algorithm, to reduce the decoding time complexity. ...
The TITT scheme at the transmitter and the BD-M algorithm at the receiver jointly constitute a dynamic transmission-decoding system for Spinal code, improving its rate performance and decoding throughput ...
One of the most popular and open challenges in facilitating Spinal codes from theory to practice is to design a practical low-complexity decoding algorithm for Spinal codes. ...
arXiv:2101.07953v2
fatcat:dt3limorivg5zp4qexkvrg4wuy
SPIRAP Wireless Uplink Random Access Protocol Using Spinal Code
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper we present SPIRAP, SPinal Random Access Protocol, a new method for multiuser detection over wireless fading channel. SPIRAP combines sequential decoding with rateless Spinal code. ...
The algorithm applies equivalently to any other rateless code, we chose Spinal for its good performance. ...
They both have efficient decoding algorithms. hence, they are efficiently implemented in a variety of communication standards. ...
arXiv:2012.03100v1
fatcat:ac3kkjeecbcghguuruhuhhz5de
Novel Reconciliation Protocol Based on Spinal Code for Continuous-variable Quantum Key Distribution
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper, a novel rateless reconciliation protocol based on spinal code is proposed, which can achieve a high-efficiency and adaptive reconciliation in a larger range of SNRs. ...
Experiment results show that the reconciliation efficiency maintains around 95% for ranging SNRs in a larger range (0,0.5), even exceeds 96.5% at extremely low SNR (<= 0.03) by using this novel scheme. ...
Therefore, decoder of spinal codes is very suitable for using parallel algorithms to achieve competitive throughput. ...
arXiv:1909.12496v1
fatcat:uxn74mgghfaahpdvcl7k7qrtp4
No symbol left behind
2012
Proceedings of the 18th annual international conference on Mobile computing and networking - Mobicom '12
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper develops RateMore, a protocol that learns the probability distribution of the number of symbols required to decode a packet (the decoding CDF), and uses the learned distribution in a dynamic ...
Rateless codes like Raptor [26, 22], Strider [9], and spinal codes [23, 24] naturally process all the information available at the receiver corresponding to a packet, whether from one or many frame transmissions ...
ACKNOWLEDGMENTS We thank the reviewers and Bob Iannucci for helpful comments. ...
doi:10.1145/2348543.2348549
dblp:conf/mobicom/IannucciPBS12
fatcat:snbktgzdfbb7tchmj4lx4jv7hi
Information reconciliation of continuous-variables quantum key distribution: principles, implementations and applications
2023
EPJ Quantum Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2023; you can also visit the original URL.
The file type is application/pdf.
AbstractQuantum key distribution (QKD) can provide information-theoretically secure keys for two parties of legitimate communication, and information reconciliation, as an indispensable component of QKD ...
Next, we introduce the rate-compatible codes, the hardware acceleration of the reconciliation algorithm, the research progress of information reconciliation, and its application in continuous variable ...
LDPC codes LDPC codes [66] are a good performance ECC with low decoding complexity and can be used to achieve high-efficiency IR very close to the Shannon limit. ...
doi:10.1140/epjqt/s40507-023-00197-8
fatcat:tmsxiufxnjdcpawbju32mfa3ai
Spinal codes
2012
Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication - SIGCOMM '12
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
The key idea in the code is the sequential application of a pseudo-random hash function to the message bits to produce a sequence of coded symbols for transmission. ...
Spinal codes are a new class of rateless codes that enable wireless networks to cope with time-varying channel conditions in a natural way, without requiring any explicit bit rate selection. ...
ACKNOWLEDGMENTS We thank Joseph Lynch for helping us collect hardware results and Aditya Gudipati for support in implementing Strider. ...
doi:10.1145/2342356.2342363
dblp:conf/sigcomm/PerryIFBS12
fatcat:x5hyfgo5nbeirfsfiwprgkxgji
Spinal codes
2012
Computer communication review
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
The key idea in the code is the sequential application of a pseudo-random hash function to the message bits to produce a sequence of coded symbols for transmission. ...
Spinal codes are a new class of rateless codes that enable wireless networks to cope with time-varying channel conditions in a natural way, without requiring any explicit bit rate selection. ...
ACKNOWLEDGMENTS We thank Joseph Lynch for helping us collect hardware results and Aditya Gudipati for support in implementing Strider. ...
doi:10.1145/2377677.2377684
fatcat:5rg2n3o3jba33j74ra57ipuhka
A hardware spinal decoder
2012
Proceedings of the eighth ACM/IEEE symposium on Architectures for networking and communications systems - ANCS '12
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
By relaxing data dependencies inherent in the classic M-algorithm decoder, we obtain area and throughput competitive with 3GPP turbo codes as well as greatly reduced latency and complexity. ...
While hardware encoding of spinal codes is straightforward, the design of an efficient, high-speed hardware decoder poses significant challenges. We present the first such decoder. ...
ACKNOWLEDGMENTS We thank Lixin Shi for helpful comments. Support for P. Iannucci and J. Perry came from Irwin and Joan Jacobs Presidential Fellowships. An Intel Fellowship supported K. Fleming. ...
doi:10.1145/2396556.2396593
dblp:conf/ancs/IannucciFPBS12
fatcat:ugdf55rhdvezhb7iibdp5jxlwm
Research and Implementation of Rateless Spinal Codes Based Massive MIMO System
2018
Wireless Communications and Mobile Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
More explicitly, a recently proposed family of rateless codes, called spinal codes, are applied to massive MIMO systems, where the spinal codes bring the benefit of approximately achieving the MAR with ...
decoding the messages, which further enhances the system retransmission efficiency. ...
Once the encoding block sizes for spinal codes are allowed to be sufficiently large, users will gradually approach their MAR with maximum-likelihood (ML) decoding algorithm [10] . ...
doi:10.1155/2018/6101853
fatcat:ljjckvbcdrc5jphbatkkyfri34
Rateless spinal codes
2011
Proceedings of the 10th ACM Workshop on Hot Topics in Networks - HotNets '11
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we present a novel rateless code, the spinal code, which uses a hash function over the message bits to produce pseudo-random bits that in turn can be mapped directly to a dense constellation ...
for transmission. ...
ACKNOWLEDGMENTS We thank Peter Iannucci for several insightful remarks, and Tom Richardson and Lizhong Zheng for helpful comments. ...
doi:10.1145/2070562.2070568
dblp:conf/hotnets/PerryBS11
fatcat:6py2yop2x5hgjcxhl7ks7x2ope
A Novel LT Scheme without Feedback Messages for IoT of Smart City Scenarios
2021
Wireless Communications and Mobile Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
For IoTs of smart city scenarios always with the low cost, low power consumption, and high transmission delay properties, the traditional protocols based on feedback messages, e.g., the Automatic Repeat ...
By presenting the definitions of optimal decoding overhead and recovery ratio per symbol, the optimal decoding overhead of LT codes can be found directly, then the encoding overhead of the encoder can ...
For a given LT code with k input symbols, the output degree distribution is ΩðxÞ. For a given decoding overhead γ, the related decoding overhead is yðγÞ. ...
doi:10.1155/2021/5546154
fatcat:ckr3bwf2w5hajowldmbqqg3hnm
SimCast: Efficient video delivery in MU-MIMO WLANs
2014
IEEE INFOCOM 2014 - IEEE Conference on Computer Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
To address this issue, this paper presents SimCast (Simultaneous), a cross-layer design for achieving efficient concurrent video uploading/downloading in MU-MIMO WLANs. ...
In concurrent video transmission, achieving efficiency over varied link condition is the main issue. ...
Since ML algorithm is known with exponential complexity, here we also leverage bubble decoding method in spinal codes [21] to achieve polynomial complexity. ...
doi:10.1109/infocom.2014.6848191
dblp:conf/infocom/WangWZN14
fatcat:mz2r4alnzjge5oyjlobnxoqjq4
« Previous
Showing results 1 — 15 out of 603 results