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.
This work addresses the reversible circuit design using novel modularization approach by presenting architecture of a logically reversible processor based on the Von Neumann architecture that can operate with very low power consumption, protection of power analysis attack and long span of life due to less heat dissipation. The organization and architecture of the proposed processor is designed from...
Brain-machine interfaces (BMIs) are human-machine integration systems that provide an interface between the brain and a machine to sense cortical neuronal activity for the purpose of restoring impaired motor tasks. In our previous work [1], an optimal design of BMIs based on artificial sensory feedback was developed using model predictive control which relied on neuronal activity in the form of spiking...
In this paper an adaptive feedback based Reversible Watermarking (RW) algorithm using Difference Expansion (DE) is designed for gray-scale still pictures. The algorithm obtains automatically the highest payload size and the corresponding embedding threshold and also determines the best watermarked picture for an input cover picture with respect to the quality metric Peak-Signal-to-Noise Ratio (PSNR)...
This paper considers an interference-aware user selection and resource allocation for uplink multiuser multiple-input multiple-output (MU-MIMO) systems. At the base station (BS), zero-forcing (ZF) with singular value decomposition (SVD) decoupling of spatial streams is deployed. First, two algorithms are developed for mobile stations (MS)s and their corresponding antennas assignment as well as power...
The Hybrid encoder is trying to choose the better encoder between the Wavelet Difference Reduction (Type-W) and Simple Bit-plane (Type-B) to get the better results than pure Type-W or pure Type-B was proposed in previous research. In case that the most pixels are insignificant, Type-B will generate a long consecutive sequence of zero bits. By experimental results, the Modified Simple Bit-plane which...
Recent advancements in graph-based analysis and solutions of instantly decodable network coding (IDNC) trigger the interest to extend them to more complicated opportunistic network coding (ONC) scenarios, with limited increase in complexity. In this paper, we design a simple IDNC-like graph model for a specific subclass of ONC, by introducing a more generalized definition of its vertices and the notion...
Review of self-correction applied for min-sum based decoding algorithms considered. Complexity, performance, and average number of iteration for each algorithm are shown.
In this paper, we study in-order packet delivery in instantly decodable network coded systems for wireless broad- cast networks. We are interested in applications, in which the successful delivery of a packet depends on the correct reception of this packet and all its preceding packets. We formulate the problem of minimizing the number of undelivered packets to all receivers over all transmissions...
We introduce a new family of binary linear codes suitable for steganographic matrix embedding. The main characteristic of the codes is the staircase random block structure of the generator matrix. We propose an efficient list decoding algorithm for the codes that finds a close codeword to a given random word. We provide both theoretical analysis of the performance and stability of the decoding algorithm,...
This paper abstracts the unified problem of drug discovery and pathogen identification as an inhibitor-defective classification problem and learning of “association pattern” between the inhibitors and defectives. We refer to the “association graph” between the inhibitors and defectives as the Immune-Defectives Graph (IDG). Here, the expression of a defective might be inhibited by a subset of the inhibitors...
A long-standing question in coding theory is whether code ensembles having a low-density parity check (LDPC) matrix can attain capacity under belief propagation (BP) decoding. An affirmative answer to this problem was recently given by the special class of spatially-coupled LDPC code ensemble. In this work, we provide a simple derivation of a different LDPC code ensemble that approaches capacity under...
This work is motivated by a distributed compressed sensing (DCS) scenario where multiple sensors independently perform compressed sensing and the sparse signals share a common support. The heterogeneous case is considered where the numbers of measurements and the noise levels at different sensors may be different. To analyse the performance, we focus on a probability model for sparse signals and use...
Fire codes are cyclic codes generated by the product of two polynomials: a binomial that characterizes the code's guaranteed burst correcting capability and an irreducible polynomial that characterizes the code length. However, the true burst correcting capability of a Fire code may exceed its guaranteed burst correcting capability. The true burst correcting capability of primitive Fire codes, in...
Sampling from the lattice Gaussian distribution is emerging as an important problem in coding and cryptography. In this paper, a Markov chain Monte Carlo (MCMC) algorithm referred to as the independent Metropolis-Hastings-Klein (MHK) algorithm is proposed for lattice Gaussian sampling, which overcomes the restriction on the standard deviation confronted by the Klein algorithm. It is proven that the...
In this paper, we propose a predictive method to construct regular column-weight-three LDPC codes with girth g = 8 so that their Tanner graphs contain a minimum number of small trapping sets. Our construction is based on improvements of the Progressive Edge-Growth (PEG) algorithm. We first show how to detect the smallest trapping sets (5; 3) and (6; 4) in the computation tree spread from variable...
A recent result has shown connections between statistical learning theory and channel quantization. In this paper, we present a practical application of this result to the implementation of LDPC decoders. In particular, we describe a technique for designing the message-passing decoder mappings (or lookup tables) based on the ideas of channel quantization. This technique is not derived from sum-product...
An interpolation-based list decoding algorithm for ℓ-quasi-cyclic codes over finite fields is developed and its guaranteed decoding radius for ℓ-phased burst errors is proven. It is also shown that for this error model and for certain parameter ranges, this new approach is advantageous over existing schemes.
In this paper, refined recovery and repair schemes are proposed for a storage system using the XOR-based MBR regenerating storage code proposed by Hou et al. Our schemes have zero transmission overhead for both recovery and repair, i.e., the total number of transmitted bits for repair/recovery is exactly equal to the total number of bits repaired/recovered. Further, our schemes use mainly XOR operations...
Low-density parity-check (LDPC) codes which were proposed in 1962 [1] had been proved to approach the Shannon limit performance. Due to the superior performance, LDPC codes have got wide applications in information transmission and magnetic recording [2]. Meanwhile, good codes usually bear good performance, such as irregular quasi-cyclic LDPC[3], so it is valuable to study deeply the construction...
Low density parity check codes (LDPC) are appearing in an increasing number of applications which shows a performance close to the Shannon limit. The near Shannon limit error correction capability has lead LDPC codes to become the coding technique of choice in many communications and storage systems since their introduction. LDPC have good error correcting performance which enables efficient and reliable...
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.