Bane Vasic's research while affiliated with The University of Arizona and other places

Publications (329)

Article
Quantum error correction has recently been shown to benefit greatly from specific physical encodings of the code qubits. In particular, several researchers have considered the individual code qubits being encoded with the continuous variable GottesmanKitaev-Preskill (GKP) code, and then imposed an outer discrete-variable code such as the surface co...
Conference Paper
The estimation of multilevel phase-shift keying (MPSK) signal phase is adversely affected by the number of factors appearing in transmission channel and related to the receiver. The imperfect reference signal phase estimation causes error probability degradations. The higher the value of frequency, the stronger is the effect of imperfect reference...
Preprint
Full-text available
Quantum errors are primarily detected and corrected using the measurement of syndrome information which itself is an unreliable step in practical error correction implementations. Typically, such faulty or noisy syndrome measurements are modeled as a binary measurement outcome flipped with some probability. However, the measured syndrome is in fact...
Article
Full-text available
We propose a novel variant of the gradient descent bit-flipping (GDBF) algorithm for decoding low-density parity-check (LDPC) codes over the binary symmetric channel. The new bit-flipping rule is based on the reliability information passed from neighboring nodes in the corresponding Tanner graph. The name SuspicionDistillation reflects the main fea...
Preprint
Full-text available
Quantum error correction has recently been shown to benefit greatly from specific physical encodings of the code qubits. In particular, several researchers have considered the individual code qubits being encoded with the continuous variable GottesmanKitaev-Preskill (GKP) code, and then imposed an outer discrete-variable code such as the surface co...
Article
Full-text available
Iterative decoders for finite length quantum low-density parity-check (QLDPC) codes are attractive because their hardware complexity scales only linearly with the number of physical qubits. However, they are impacted by short cycles, detrimental graphical configurations known as trapping sets (TSs) present in a code graph as well as symmetric degen...
Article
Full-text available
Quantum processors need to improve their reliability to scale up the number of qubits and increase the number of algorithms that can execute. To reduce the logical error rate of the quantum systems, the use of error correction codes and decoders has been established as a low-cost and feasible approach, with good results from a theoretical perspecti...
Preprint
Full-text available
Entanglement distillation is a well-studied problem in quantum information, where one typically starts with $n$ noisy Bell pairs and distills $k$ Bell pairs of higher fidelity. While distilling Bell pairs is the canonical setting, it is important to study the distillation of multipartite entangled states because these can be useful for realizing di...
Preprint
Full-text available
Decoder diversity is a powerful error correction framework in which a collection of decoders collaboratively correct a set of error patterns otherwise uncorrectable by any individual decoder. In this paper, we propose a new approach to design the decoder diversity of finite alphabet iterative decoders (FAIDs) for Low-Density Parity Check (LDPC) cod...
Article
In his pioneering work on LDPC codes, Gallager dismissed codes with parity-check matrices of weight two after proving that their minimum Hamming distances grow at most logarithmically with their code lengths. In spite of their poor minimum Hamming distances, it is shown that quasi-cyclic LDPC codes with parity-check matrices of column weight two ha...
Preprint
Full-text available
Iterative decoders for finite length quantum low-density parity-check (QLDPC) codes are attractive because their hardware complexity scales only linearly with the number of physical qubits. However, they are impacted by short cycles, detrimental graphical configurations known as trapping sets (TSs) present in a code graph as well as symmetric degen...
Article
In this paper, we present a computationally efficient method for estimating error floors of low-density parity-check (LDPC) codes over the binary symmetric channel (BSC) without any prior knowledge of its trapping sets (TSs). Given the Tanner graph $G$ of a code, and the decoding algorithm $\mathcal {D}$ , the method starts from a list of short...
Article
In this paper, we propose a new approach to design finite alphabet iterative decoders (FAIDs) for Low-Density Parity Check (LDPC) codes over binary symmetric channel (BSC) via recurrent quantized neural networks (RQNN). We focus on the linear FAID class and use RQNNs to optimize the message update look-up tables by jointly training their message le...
Article
In this paper, we present a deliberate bit flipping (DBF) coding scheme for binary two-dimensional (2-D) channels, where specific patterns in channel inputs are the significant cause of errors. The idea is to eliminate a constrained encoder and, instead, embed a constraint into an error correction codeword that is arranged into a 2-D array by del...
Conference Paper
Full-text available
Best and practical watermarking schemes for copyright protection of 3D meshes are required to be blind and robust to attacks and errors. In this paper, we present the latest developments in 3D blind watermarking with a special emphasis on our Ordered Statistics Vertex Extraction and Tracing Algorithm (OSVETA) algorithm and its improvements. OSVETA...
Chapter
In this paper, we consider the problem of transmitting binary messages over data-dependent two-dimensional channels. We propose a deliberate bit flipping coding scheme that removes channel harmful configurations prior to transmission. In this method, user messages are encoded with an error correction code, and therefore the number of bit flips shou...
Article
Designs and constructions of quasi-cyclic (QC) LDPC codes for the AWGN channel are presented. The codes are constructed based on the conventional parity-check matrices of Reed-Solomon (RS) codes and are referred to as RS-QC-LDPC codes. Several classes of RS-QC-LDPC codes are given. Cycle structural properties of the Tanner graphs of codes in these...
Article
Full-text available
This paper presents a new Bit Flipping (BF) decoder, called Probabilistic Parallel Bit Flipping (PPBF) for Low-Density Parity-Check (LDPC) codes on the Binary Symmetric Channel. In PPBF, the flipping operation is proceeded with a probabilistic behavior which is shown to improve significantly the error correction performance. The advantage of PPBF c...
Article
The Gallager B (GaB), among the hard-decision class of Low-Density-Parity-Check (LDPC) algorithms, is an ideal candidate for designing a high-throughput decoder hardware. However, GaB suffers from poor error-correction performance. We introduce a Probabilistic GaB (PGaB) algorithm that disturbs the decisions made during the decoding iterations rand...
Article
Two-dimensional magnetic recording (TDMR) is an emerging storage technology that aims to achieve areal densities on the order of 10 Tb/in <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> , mainly driven by innovative channels engineering with minimal changes to existing head/media designs within...
Conference Paper
Abstract—This paper presents the performance evaluation of the Probabilistic Gallager B (PGaB), a hard decision message passing Low Density Parity Check (LDPC) Decoder, with respect to the soft decision based decoders MinSum (MS) and Offset-MinSum (OMS). PGaB algorithm relies on introducing deliberate and controlled randomness to some of the exchan...
Article
Two-dimensional magnetic recording (TDMR) is a promising technology for boosting areal densities (ADs) using sophisticated signal processing algorithms within a systems framework. The read/write channel architectures have to effectively tackle 2-D intersymbol interference (ISI), 2-D synchronization errors, media and electronic noise sources, as wel...
Article
In a circuit, timing errors occur when a logic gate output does not switch before the clock rising edge. In this paper, we consider Gallager B decoders under timing errors, following the error model derived in [1] from SPICE measurements. For this model, we provide a theoretical analysis of the performance of LDPC decoders. Our study is based on th...
Article
Full-text available
This paper deals with the hardware implementation of the recently introduced Probabilistic Gradient-Descent Bit-Flipping (PGDBF) decoder. The PGDBF is a new type of hard decision decoder for Low-Density Parity-Check (LDPC), with improved error correction performance thanks to the introduction of deliberate random perturbation in the computing units...
Conference Paper
In the recent literature, the study of iterative LDPC decoders implemented on faulty-hardware has led to the counter-intuitive conclusion that noisy decoders could perform better than their noiseless version. This peculiar behavior has been observed in the finite codeword length regime, where the noise perturbating the decoder dynamics help to esca...
Article
We give an architecture of a storage system consisting of a storage medium made of unreliable memory elements and an error correction circuit made of a combination of noisy and noiseless logic gates that is capable of retaining the stored information with the lower probability of error than a storage system with a correction circuit made completely...
Article
The digital universe is doubling every two years and expected to reach an unwieldy 44 zettabytes into the next decade. To cope with the ever increasing need for storing, transmitting and retrieving huge amounts of data, cloud storage, data centers and other massively distributed storage networks have emerged. These rely on efficient memory technolo...
Data
RT-PCR analysis of gene expression. Total RNA from indicated tissues—dry pollen, 0.5 h PT, 4 h PT, 8- and 21-day-old seedlings (DS)—was used as templates to perform oligo-dT primed reverse transcription reactions followed by cDNA synthesis. RT-PCR was performed with cDNAs from indicated tissues and gel images of PCR products amplified are shown. (A...
Presentation
Full-text available
In this presentation, we introduce a new and original method for the random generation of bits in the Probabilistic Gradient-Descent Bit-Flipping (PGDBF) decoder, which provides a highly efficient hardware implementation compared to others conventional methods while preserving the outstanding decoding performance of PGDBF. This new random generator...
Article
In this paper, we propose a new approach to construct a class of check-hybrid generalized low-density parity-check (CH-GLDPC) codes which are free of small trapping sets. The approach is based on converting some selected check nodes involving a trapping set into super checks corresponding to a 2-error correcting component code. Specifically, we fol...
Article
Two-dimensional magnetic recording 2-D (TDMR) is a promising technology for next generation magnetic storage systems based on a systems-level framework involving sophisticated signal processing at the core. The TDMR channel suffers from severe jitter noise along with electronic noise that needs to be mitigated during signal detection and recovery....
Article
In this letter, we investigate fault-tolerance of memories built from unreliable cells. In order to increase the memory reliability, information is encoded by a low-density parity-check (LDPC) code, and then stored. The memory content is updated periodically by the bit-flipping decoder, built also from unreliable logic gates, whose failures are tra...
Article
This paper proposes a sequence detector designed to retrieve data bits from compressively sampled frequency-hopping spread spectrum (FHSS) Gaussian frequency-shift keying (GFSK) signals. The received signal waveform is not reconstructed from the compressive measurements, nor are received bits detected on a symbol-by-symbol basis. Rather, the entire...
Article
In this paper we characterize the effect of datadependent gate failures on the performance of the Gallager B decoder of low density parity check codes. We show that this type of failures makes the decoder dependent on a transmitted codeword, thus rendering inapplicable the traditional analysis tools such as density evolution and trapping sets. By u...
Article
Full-text available
A majority logic decoder made of unreliable logic gates, whose failures are transient and datadependent, is analyzed. Based on a combinatorial representation of fault configurations a closed-form expression for the average bit error rate for an one-step majority logic decoder is derived, for a regular low-density parity-check (LDPC) code ensemble a...
Article
In this paper we characterize the effect of data-dependent gate failures on the performance of the Gallager B decoder of low density parity check codes. We show that this type of failures makes the decoder dependent on a transmitted codeword, thus rendering inapplicable the traditional analysis tools such as density evolution and trapping sets. By...
Conference Paper
We propose an improved version of probabilistic gradient descent bit flipping algorithm for decoding low density parity check codes, based on MUltiple Decoding attempts and Random re-Initializations (MUDRI). The proposed algorithm significantly increases the probability of correcting error patterns uncorrectable by the existing variants of bit-flip...
Conference Paper
Full-text available
In this paper, several implementations of the recently introduced PGDBF decoder for LDPC codes are proposed. In [2], the authors show that using randomness in bit-flipping decoders can greatly improve the error correction performance. In this paper, two models of random generators are proposed and compared through hardware implementation and perfor...
Article
We present a finite alphabet iterative decoders (FAIDs), a new type of decoders for low-density parity check (LDPC) codes, which outperform much more complex belief-propagation-based counterparts in the error floor region. The FAID variable node update is a simple Boolean map, and we show that by varying this map one can achieve a class of decoders...
Article
This paper presents the results of a comprehensive study of the shingled writing process and various signal processing and data detection approaches applied to the readback waveforms. The recording simulations include realistic head fields, a random granular media, magnetostatic and exchange interactions, and a READ head sensitivity function. Readb...
Article
In this paper we propose a uniformly reweighted a posteriori probability (APP) decoder. The APP decoder is well-known to be suboptimal compared to the BP decoder. Here, we derive the APP decoder as an algorithm of approximate Bayesian inference on the LDPC code graph and introduce a correction parameter to overcome the suboptimaly of the APP decode...
Article
The move from traditional single-track magnetic recording to two-dimensional magnetic recording (TDMR) with squeezed tracks and multiple readers opens up new design degrees of freedom beyond the track pitch and bit-aspect ratio, including the widths, spacing, and crosstrack positions of the readers. In this paper, we present a systematic method for...