Fast Decoding Research Articles

Spiking Neural Network Equalizer With Fast and Low Power Decoding for IM/DD Optical Communication

Spiking Neural Network Equalizer With Fast and Low Power Decoding for IM/DD Optical Communication

Fast erasure decoder for hypergraph product codes

We propose a decoder for the correction of erasures with hypergraph product codes, which form one of the most popular families of quantum LDPC codes. Our numerical simulations show that this decoder provides a close approximation of the maximum likelihood decoder that can be implemented in O(N2) bit operations where N is the length of the quantum code. A probabilistic version of this decoder can be implemented in O(N1.5) bit operations.

Modeling the Intent to Interact With VR Using Physiological Features.

Mixed-Reality (XR) technologies promise a user experience (UX) that rivals the interactive experience with the real-world. The key facilitators in the design of such a natural UX are that the interaction has zero lag and that users experience no excess mental load. This is difficult to achieve due to technical constraints such as motion-to-photon latency as well as false-positives during gesture-based interaction. In this paper, we explored the use of physiological features to model the user's intent to interact with a virtual reality (VR) environment. Accurate predictions about when users want to express an interaction intent could overcome the limitations of an interactive device that lags behind the intention of a user. We computed time-domain features from electroencephalography (EEG) and electromyography (EMG) recordings during a grab-and-drop task in VR and cross-validated a Linear Discriminant Analysis (LDA) for three different combinations of (1) EEG, (2) EMG and (3) EEG-EMG features. We found the classifiers to detect the presence of a pre-movement state from background idle activity reflecting the users' intent to interact with the virtual objects (EEG: 62 % ± 10 %, EMG: 72 % ± 9 %, EEG-EMG: 69 % ± 10 %) above simulated chance level. The features leveraged in our classification scheme have a low computational cost and are especially useful for fast decoding of users' mental states. Our work is a further step towards a useful classification of users' intent to interact, as a high temporal resolution and speed of detection is crucial. This facilitates natural experiences through zero-lag adaptive interfaces.

Implementation of turbo decoding for VDES signal data segments

Abstract The International Telecommunication Union (ITU) mandates the use of turbo coding for VDES signal data segments. Previous studies primarily focused on turbo decoding for a specific link in VDES, often neglecting its applicability to all links. This paper proposes an FPGA-based implementation method for turbo code decoding, aiming to achieve fast and accurate turbo decoding of VDES signal data segments, while also ensuring compatibility with different links. The resulting turbo decoder can adapt to the different code rates and data segment lengths specified in the VDES. A comparison of the decoding speeds between DSP and FPGA confirms that the parallel computing capability of FPGA can significantly improve the decoding speed. Finally, the main onboard resources required for FPGA implementation of turbo decoding were provided.

Fast Decoding of Polar Codes for Digital Broadcasting Services in 5G

Fast Decoding of Polar Codes for Digital Broadcasting Services in 5G

Building of Barcode and QR Code Reader Device

This study focuses on building a QR and barcode reader device to scan the barcode or QR code (1D/2D) and display the read information on the Liquid Crystal Display (LCD). With this device we can scan and read all the barcode and QR codes through an OLED display. The proposed device can work in the dark, have a stable performance as well as fast decoding speed. It can easily capture barcodes 1D, 2D on labels, paper, and mobile phone or computer displays sensitively and accurately.

Deep learning-based auditory attention decoding in listeners with hearing impairment * *This paper’s data analysis is based on a Master’s Thesis work [].

Objective. This study develops a deep learning (DL) method for fast auditory attention decoding (AAD) using electroencephalography (EEG) from listeners with hearing impairment (HI). It addresses three classification tasks: differentiating noise from speech-in-noise, classifying the direction of attended speech (left vs. right) and identifying the activation status of hearing aid noise reduction algorithms (OFF vs. ON). These tasks contribute to our understanding of how hearing technology influences auditory processing in the hearing-impaired population. Approach. Deep convolutional neural network (DCNN) models were designed for each task. Two training strategies were employed to clarify the impact of data splitting on AAD tasks: inter-trial, where the testing set used classification windows from trials that the training set had not seen, and intra-trial, where the testing set used unseen classification windows from trials where other segments were seen during training. The models were evaluated on EEG data from 31 participants with HI, listening to competing talkers amidst background noise. Main results. Using 1 s classification windows, DCNN models achieve accuracy (ACC) of 69.8%, 73.3% and 82.9% and area-under-curve (AUC) of 77.2%, 80.6% and 92.1% for the three tasks respectively on inter-trial strategy. In the intra-trial strategy, they achieved ACC of 87.9%, 80.1% and 97.5%, along with AUC of 94.6%, 89.1%, and 99.8%. Our DCNN models show good performance on short 1 s EEG samples, making them suitable for real-world applications. Conclusion: Our DCNN models successfully addressed three tasks with short 1 s EEG windows from participants with HI, showcasing their potential. While the inter-trial strategy demonstrated promise for assessing AAD, the intra-trial approach yielded inflated results, underscoring the important role of proper data splitting in EEG-based AAD tasks. Significance. Our findings showcase the promising potential of EEG-based tools for assessing auditory attention in clinical contexts and advancing hearing technology, while also promoting further exploration of alternative DL architectures and their potential constraints.

Fast, accurate, and interpretable decoding of electrocorticographic signals using dynamic mode decomposition

Dynamic mode (DM) decomposition decomposes spatiotemporal signals into basic oscillatory components (DMs). DMs can improve the accuracy of neural decoding when used with the nonlinear Grassmann kernel, compared to conventional power features. However, such kernel-based machine learning algorithms have three limitations: large computational time preventing real-time application, incompatibility with non-kernel algorithms, and low interpretability. Here, we propose a mapping function corresponding to the Grassmann kernel that explicitly transforms DMs into spatial DM (sDM) features, which can be used in any machine learning algorithm. Using electrocorticographic signals recorded during various movement and visual perception tasks, the sDM features were shown to improve the decoding accuracy and computational time compared to conventional methods. Furthermore, the components of the sDM features informative for decoding showed similar characteristics to the high-γ power of the signals, but with higher trial-to-trial reproducibility. The proposed sDM features enable fast, accurate, and interpretable neural decoding.

Ultrasensitive textile strain sensors redefine wearable silent speech interfaces with high machine learning efficiency

This work introduces a silent speech interface (SSI), proposing a few-layer graphene (FLG) strain sensing mechanism based on thorough cracks and AI-based self-adaptation capabilities that overcome the limitations of state-of-the-art technologies by simultaneously achieving high accuracy, high computational efficiency, and fast decoding speed while maintaining excellent user comfort. We demonstrate its application in a biocompatible textile-integrated ultrasensitive strain sensor embedded into a smart choker, which conforms to the user’s throat. Thanks to the structure of ordered through cracks in the graphene-coated textile, the proposed strain gauge achieves a gauge factor of 317 with <5% strain, corresponding to a 420% improvement over existing textile strain sensors fabricated by printing and coating technologies reported to date. Its high sensitivity allows it to capture subtle throat movements, simplifying signal processing and enabling the use of a computationally efficient neural network. The resulting neural network, based on a one-dimensional convolutional model, reduces computational load by 90% while maintaining a remarkable 95.25% accuracy in speech decoding. The synergy in sensor design and neural network optimization offers a promising solution for practical, wearable SSI systems, paving the way for seamless, natural silent communication in diverse settings.

Fast decoding of lifted interleaved linearized Reed–Solomon codes for multishot network coding

Martínez-Peñas and Kschischang (IEEE Trans. Inf. Theory 65(8):4785–4803, 2019) proposed lifted linearized Reed–Solomon codes as suitable codes for error control in multishot network coding. We show how to construct and decode lifted interleaved linearized Reed–Solomon (LILRS) codes. Compared to the construction by Martínez-Peñas–Kschischang, interleaving allows to increase the decoding region significantly and decreases the overhead due to the lifting (i.e., increases the code rate), at the cost of an increased packet size. We propose two decoding schemes for LILRS that are both capable of correcting insertions and deletions beyond half the minimum distance of the code by either allowing a list or a small decoding failure probability. We propose a probabilistic unique Loidreau–Overbeck-like decoder for LILRS codes and an efficient interpolation-based decoding scheme that can be either used as a list decoder (with exponential worst-case list size) or as a probabilistic unique decoder. We derive upper bounds on the decoding failure probability of the probabilistic-unique decoders which show that the decoding failure probability is very small for most channel realizations up to the maximal decoding radius. The tightness of the bounds is verified by Monte Carlo simulations.

Lossless text compression by means of binary-coded ternary number representation

A lossless data compression code based on a binary-coded ternary number representation is investigated. The code is complete, universal, synchronizable, and supports a direct search in a compressed file. A simple monotonous encoding and very fast decoding algorithms are constructed owing to code properties. Experiments show that in natural language text compression, the new code outperforms byte-aligned codes SCDC and RPBC either in compression ratio or in decoding speed.

Fast Successive-Cancellation Decoding of Polar Codes With Sequence Nodes

Fast Successive-Cancellation Decoding of Polar Codes With Sequence Nodes

Fast List Decoding of PAC Codes With New Nodes

Fast List Decoding of PAC Codes With New Nodes

Prime-Factor GFFT Architecture for Fast Frequency Domain Decoding of Cyclic Codes

Prime-Factor GFFT Architecture for Fast Frequency Domain Decoding of Cyclic Codes

Fast Successive Cancellation Decoding of Polar Codes with Large Kernels

Fast Successive Cancellation Decoding of Polar Codes with Large Kernels

Fast Polar Decoding With Successive Cancellation List Creeper Algorithm

Fast Polar Decoding With Successive Cancellation List Creeper Algorithm

Fast Successive-Cancellation Decoding of 2×2 Kernel Non-Binary Polar Codes

Fast Successive-Cancellation Decoding of 2×2 Kernel Non-Binary Polar Codes

FACT-Net: a Frequency Adapter CNN with Temporal-periodicity Inception for Fast and Accurate MI-EEG Decoding

FACT-Net: a Frequency Adapter CNN with Temporal-periodicity Inception for Fast and Accurate MI-EEG Decoding

QARV: Quantization-Aware ResNet VAE for Lossy Image Compression.

This paper addresses the problem of lossy image compression, a fundamental problem in image processing and information theory that is involved in many real-world applications. We start by reviewing the framework of variational autoencoders (VAEs), a powerful class of generative probabilistic models that has a deep connection to lossy compression. Based on VAEs, we develop a new scheme for lossy image compression, which we name quantization-aware ResNet VAE (QARV). Our method incorporates a hierarchical VAE architecture integrated with test-time quantization and quantization-aware training, without which efficient entropy coding would not be possible. In addition, we design the neural network architecture of QARV specifically for fast decoding and propose an adaptive normalization operation for variable-rate compression. Extensive experiments are conducted, and results show that QARV achieves variable-rate compression, high-speed decoding, and better rate-distortion performance than existing baseline methods.

A Fast Attention-Guided Hierarchical Decoding Network for Real-Time Semantic Segmentation.

Semantic segmentation provides accurate scene understanding and decision support for many applications. However, many models strive for high accuracy by adopting complex structures, decreasing the inference speed, and making it challenging to meet real-time requirements. Therefore, a fast attention-guided hierarchical decoding network for real-time semantic segmentation (FAHDNet), which is an asymmetric U-shaped structure, is proposed to address this issue. In the encoder, we design a multi-scale bottleneck residual unit (MBRU), which combines the attention mechanism and decomposition convolution to design a parallel structure for aggregating multi-scale information, making the network perform better at processing information at different scales. In addition, we propose a spatial information compensation (SIC) module that effectively uses the original input to make up for the spatial texture information lost during downsampling. In the decoder, the global attention (GA) module is used to process the feature map of the encoder, enhance the feature interaction in the channel and spatial dimensions, and enhance the ability to mine feature information. At the same time, the lightweight hierarchical decoder integrates multi-scale features to better adapt to different scale targets and accurately segment objects of different sizes. Through experiments, FAHDNet performs outstandingly on two public datasets, Cityscapes and Camvid. Specifically, the network achieves 70.6% mean intersection over union (mIoU) at 135 frames per second (FPS) on Cityscapes and 67.2% mIoU at 335 FPS on Camvid. Compared to the existing networks, our model maintains accuracy while achieving faster inference speeds, thus enhancing its practical usability.