A Single-Bit Redundancy Framework for Multi-Dimensional Parametric Constraints
Daniella Bar-Lev, Michael Shlizerman

TL;DR
This paper introduces a unified, iterative encoding framework for multidimensional parametric constraints, enhancing storage system performance by efficiently handling array constraints that depend on sequence length.
Contribution
It extends existing parametric constrained coding methods to multidimensional arrays, providing a versatile and efficient encoding framework for complex storage and communication applications.
Findings
Successfully applied to various existing constraints
Demonstrated efficiency in multidimensional array encoding
Highlights potential for improved storage system reliability
Abstract
Constrained coding plays a key role in optimizing performance and mitigating errors in applications such as storage and communication, where specific constraints on codewords are required. While non-parametric constraints have been well-studied, parametric constraints, which depend on sequence length, have traditionally been tackled with ad hoc solutions. Recent advances have introduced unified methods for parametric constrained coding. This paper extends these approaches to multidimensional settings, generalizing an iterative framework to efficiently encode arrays subject to parametric constraints. We demonstrate the application of the method to existing and new constraints, highlighting its versatility and potential for advanced storage systems.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsEmbedded Systems Design Techniques · Parallel Computing and Optimization Techniques · VLSI and FPGA Design Techniques
