The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
As high-throughput sequencing technologies are generating vast amounts of data, there is urgent need to develop efficient algorithms for sequencing data compression. Existing methods usually dispatch the similar sequences into the same bucket based on their same minimizer, that is the lexicographical smallest k-mer within the sequence, for data compression. However, when the sequencing error existed...
In this work we consider the problem of a PUF-based authentication model with a generated secret key. The considered scenario is that after an enrollment phase, where for several challenge-response pairs a secret key and helper data is generated, the decoder will choose one of the challenges uniform at random for authentication, this time the PUF provides a noisy version of the original response;...
Deep neural networks (DNNs) usually demand a large amount of operations for real-time inference. Especially, fully-connected layers contain a large number of weights, thus they usually need many off-chip memory accesses for inference. We propose a weight compression method for deep neural networks, which allows values of +1 or −1 only at predetermined positions of the weights so that decoding using...
Polar coding is a low-complexity method for communication over noisy classical channels, which is capable of providing highly reliable data transmission. This paper proposes an enhanced polar codec scheme for mission critical applications in train-to-ground wireless communications. Firstly, we develop an enhanced polar coding scheme to support reliable data transmission under time-varying channel...
In recent years, numbers of non-orthogonal multiple access (NOMA) schemes have been proposed to support the great amounts of wireless connections. However, complex multi-user detection is needed in case that the user power differentiation is not available and simple successive interference cancellation cannot directly apply, which usually incurs unaffordable computational complexity. In this paper,...
In this paper, we present a nonuniform quantizer based on the condition of maximum information rate achieved over uncorrelated Rayleigh fading channel and when successive cancellation (SC) decoding algorithm of polar codes is applied. Based on symmetry condition of random variables, we start with theoretical model where uniform scaling factors are applied to correct soft messages at the absence of...
In this paper, the principle of density evolution (DE) combined with the normalized minimum-sum (NMS) decoding process is explored. It is demonstrated that with one properly chosen parameters for NMS algorithm, then almost the same behaviour of sum-product (SP) algorithm is achieved. As well, the complexity reduction is realized by calculating a linear function instead of nonlinear function. Simulation...
In this paper, we propose an algebraic approach to design extremely low rate low-density parity-check (LDPC) codes by employing the primitive polynomials. We first investigate the requirements for the polynomials to construct 4-cycle free LDPC codes and then propose an algebraic approach to design the parity check matrix. To achieve a better decoding performance in the extremely low rate region, we...
The Parity check Transformation Algorithm (PTA) is a recently developed symbol wise soft decision decoding algorithm for Reed Solomon codes. The algorithm has been shown in literature to outperform widely used Reed Solomon decoders including the Koetter and Vardy (KV) algorithm. The PTA gets its name from the fact that it transforms the parity check matrix of the Reed Solomon code after every iteration...
Plane wave methods for ultrafast ultrasound imaging suffer from a low signal to noise ratio (SNR) and a limited field of view at greater imaging depths. Imaging using multiple focused coded beams in parallel is one strategy for high speed imaging that may improve on these limitations. However, the SNR and resolution of this strategy are degraded by the interference between the beams transmitted in...
Recent work in video compression has shown that using multiple 2D transforms instead of a single transform in order to de-correlate residuals provides better compression efficiency. These transforms are tested competitively inside a video encoder and the optimal transform is selected based on the Rate Distortion Optimization (RDO) cost. However, one needs to encode a syntax to indicate the chosen...
Is there a general representation of the information content of human brain, which can be extracted from the functional magnetic resonance imaging (fMRI) data? Is it possible to learn this representation automatically from big data sets by unsupervised learning methods? Is it possible to transfer this representation to learn and decode a set of cognitive states in other fMRI data sets? This study...
Hybrid digital-analog (HDA) architectures have been widely developed for efficient digital transmission of analog speech, audio or video data. By considering the advantage of both digital and analog components, HDA systems gain better performances than purely analog and digital schemes in a wide range of channel conditions. However, HDA systems described in previous works are mostly designed for continuous-valued...
Linear index coding is generally more robust against channel variations as compared to the fixed-to-variable length coding. This paper proposes a novel multi-pass decoding approach to decode linear index coded images. In contrast to the typical one-pass decoding, the proposed scheme harnesses the information recovered in the first decoding pass with the source statistics and utilize it in the subsequent...
We study the problem of strong coordination of actions of two agents X and Y that communicate over a noisy communication channel such that the actions follow a given joint probability distribution. We propose two novel schemes for this noisy strong coordination problem, and derive inner bounds for the underlying strong coordination capacity region. The first scheme is a joint coordination-channel...
We establish the rate region of an extended Gray-Wyner system for 2-DMS (X, Y) with two additional decoders having complementary causal side information. This extension is interesting because in addition to the operationally significant extreme points of the Gray-Wyner rate region, which include Wyner's common information, Gåcs-Körner common information and information bottleneck, the rate region...
We consider insertion and deletion channels with the additional assumption that the channel input sequence is implicitly divided into segments such that at most one edit can occur within a segment. We further assume that there are no segment markers in the received sequence. We propose code constructions for the segmented deletion, segmented insertion, and segmented insertion-deletion channels based...
Absorbing sets (ASs) are combinatorially defined objects existing in the Tanner graph of a low-density parity-check (LDPC) code that have been shown to cause failures in the iterative message-passing decoder when transmission occurs over the additive white Gaussian noise channel. In this paper, we propose an edge spreading approach to construct high rate array-based spatially-coupled LDPC codes by...
As demonstrated in many recent studies, cooperation between users can greatly improve the performance of communication systems. Most of the works in the literature present models where all the users are aware of the resources available for cooperation. However, the scenario where cooperation links are sometimes unavailable or that some users cannot be updated whether the cooperation links are present...
This work addresses the construction of bit-error resilient multiple description lattice vector quantizers (MDLVQ) by proposing the design of a structured mapping γ of side lattice points to binary indexes. We assume that the first description is correct while the second description may carry bit errors. To design the mapping γ the set of side lattice points is first partitioned into Voronoi regions...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.