GRADE-AO: Towards Near-Optimal Spatially-Coupled Codes with High Memories

Download

index.pdf

Date

2021-07-12

Author

Yang, Siyi
Hareedy, Ahmed
Venkatasubramanian, Shyam
Calderbank, Robert
Dolecek, Lara

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

112
views

41
downloads

Spatially-coupled (SC) codes, known for their threshold saturation phenomenon and low-latency windowed decoding algorithms, are ideal for streaming applications and data storage systems. SC codes are constructed by partitioning an underlying block code, followed by rearranging and concatenating the partitioned components in a 'convolutional' manner. The number of partitioned components determines the 'memory' of SC codes. While adopting higher memories results in improved SC code performance, obtaining optimal SC codes with high memory is known to be hard. In this paper, we investigate the relation between the performance of SC codes and the density distribution of partitioning matrices. We propose a probabilistic framework that obtains (locally) optimal density distributions via gradient descent. Starting from random partitioning matrices abiding by the obtained distribution, we perform low complexity optimization algorithms over the cycle properties to construct high memory, high performance quasi-cyclic SC codes. Simulation results show that codes obtained through our proposed method notably outperform state-of-the-art SC codes with the same constraint length and codes with uniform partitioning.

Subject Keywords

Simulation, Memory management, Performance gain, Probabilistic logic, Partitioning algorithms, Decoding, Complexity theory

URI

https://hdl.handle.net/11511/98513

DOI

https://doi.org/10.1109/isit45174.2021.9517931

Conference Name

2021 IEEE International Symposium on Information Theory, ISIT 2021

Collections

Department of Electrical and Electronics Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Breaking the Computational Bottleneck: Probabilistic Optimization of High-Memory Spatially-Coupled Codes Yang, Siyi; Hareedy, Ahmed; Calderbank, Robert; Dolecek, Lara (2022-01-01) IEEESpatially-coupled (SC) codes, known for their threshold saturation phenomenon and low-latency windowed decoding algorithms, are ideal for streaming applications and data storage systems. SC codes are constructed by partitioning an underlying block code, followed by rearranging and concatenating the partitioned components in a convolutional manner. The number of partitioned components determines the memory of SC codes. In this paper, we investigate the relation between the performance of SC codes and the...
Optimizing age of information on real-life TCP/IP connections through reinforcement learning Sert, Egemen; Sonmez, Canberk; Baghaee, Sajjad; Uysal, Elif (2018-07-05) Age of Information (AoI) has emerged as a performance metric capturing the freshness of data for status-update based applications ( e.g. , remote monitoring) as a more suitable alternative to classical network performance indicators such as throughput or delay. Optimizing AoI often requires distinctly novel and sometimes counter-intuitive networking policies that adapt the rate of update transmissions to the randomness in network resources. However, almost all previous work on AoI to data has been theoretic...
DDS based MIL-STD-1553B data bus interface simulation Deniz, Ertan; Oğuztüzün, Mehmet Halit S.; Durak, Umut; Department of Computer Engineering (2012) This thesis describes distributed simulation of MIL-STD-1553B Serial Data Bus interface and protocol based on the Data Distribution Service (DDS) middleware standard. The data bus connects avionics system components and transports information among them in an aircraft. It is important for system designers to be able to evaluate and verify their component interfaces at the design phase. The 1553 serial data bus requires specialized hardware and wiring to operate, thus it is expensive and complex to verify co...
Image segmentation with unified region and boundary characteristics within recursive shortest spanning tree Esen, E.; Alp, Y. K. (2007-06-13) The lack of boundary information in region based image segmentation algorithms resulted in many hybrid methods that integrate the complementary information sources of region and boundary, in order to increase the segmentation performance. In compliance with this trend, we propose a novel method to unify the region and boundary characteristics within the canonical Recursive Shortest Spanning Tree algorithm. The main idea is to incorporate the boundary information in the distance metric of RSST with minor cha...
Distributed Connectivity Restoration in Underwater Acoustic Sensor Networks via Depth Adjustment Uzun, Erkay; ŞENEL, FATİH; Akkaya, Kemal; Yazıcı, Adnan (2015-06-12) In most applications of Underwater Acoustic Sensor Networks, network connectivity is required for data exchange, data aggregation and relaying the data to a surface station. However, such connectivity can be lost due to failure of some sensor nodes which creates disruptions to the network operations. In this paper, we present two algorithms, namely BMR and DURA, which can detect network partitioning due to such node failures and re-establish network connectivity through controlled depth adjustment of nodes ...

Citation Formats

S. Yang, A. Hareedy, S. Venkatasubramanian, R. Calderbank, and L. Dolecek, “GRADE-AO: Towards Near-Optimal Spatially-Coupled Codes with High Memories,” Virtual, Melbourne, Avustralya, 2021, vol. 2021-July, Accessed: 00, 2022. [Online]. Available: https://hdl.handle.net/11511/98513.