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.
A large class of real-time circuits and systems can be expressed in linear state variable form. Of particular interest are systems with sensors and actuators that can degrade over time or circuits that can suffer from parametric deviations due to electrical degradation. In the past, multiple checksum codes have been used for error detection and correction in linear systems. In this research, it is...
The construction of a channel code by using a source code with decoder side information is introduced. For the construction, any pair of encoder and decoder is available for a source code with decoder side information. A constrained-random-number generator, which generates random numbers satisfying a condition specified by a function and its value, is used to construct a stochastic channel encoder...
Stochastic computing (SC) allows for extremely low cost and low power implementations of common arithmetic operations. However inherent random fluctuation error and long latency of SC lead to the degradation of accuracy and energy efficiency when applied to convolutional neural networks (CNNs). In this paper we address the two critical problems of SC-based CNNs, by proposing a novel SC multiply algorithm...
A code construction based on generalized concatenated codes is proposed for protection against device and block failures in storage systems. Low-complexity encoding and repair algorithms for the proposed codes are presented. This construction improves upon recently proposed STAIR codes in terms of performance and achievable code parameters.
This paper investigates the performance of the BCH encoder and decoder for different error-correcting capabilities. The focus is on BCH codes of length 255. The motivation for this research is a project where data symbols of this length are transmitted over an error-prone wireless channel. The paper presents a mathematical introduction into encoding for cyclic codes and decoding of the BCH code. The...
The Multidimensional Parity Check codes (MDPC) are one of the possible FEC methods of the short information messages. Especially the MDPCs with reduced generator matrix results in codes with block length from few to tens of bits with indispensable code-gain. This paper presents two methods of generation of the MDPC and describe the algorithm for iterative decoding of these codes. The MDPC with short...
Communication technologies are key and standard parts of most of today's integrated as well as field systems. Such technologies have experienced an explosive development during the last decades. More recently, short-distance communication systems have also been discussed as a way to connect embedded electronic systems in industrial applications. As industrial robots are assumed to be real-time and...
In wireless networks, determining the error bit positions within a packet at the receiver can improve the wireless retransmission efficiency in wireless communications. In this paper, we propose an Error Position Estimating Coding (EPEC) scheme based on Error Estimating Coding (EEC). Specifically, we divide data bits into several groups and indicate the group number individually to implement error...
The negative secrecy capacity case is an important problem for secure wiretap channel polar coding, however former polar coding schemes have not considered this negative case because physical layer channel coding cannot achieve a positive secrecy rate under this condition. In this paper, a chaos embedded polar coding scheme is proposed which can achieve a positive secrecy rate for wiretap channel...
Priority encoders and arbiters usually drive multiplexers (muxes). Latency optimization of priority encoders and multiplexer trees has usually been handled separately in the literature. However, in some applications with circular data dependencies, the combined latency of the arbiter and muxing needs to be optimized. Moreover, there is an ever growing need for throughput. This requires switches that...
Shift registers with linear feedback are frequently used. They owe their popularity to very well developed theoretical base. Registers with feedback of prime polynomials are of particular practical importance. They are willingly applied as test sequence generators and test response compactors. The article presents an attempt to extend the class of registers with linear feedback. Basing on the formal...
Live coding is a performance discipline that considers code as an interface. The act of writing, deleting and modifying code allows a performer to directly interact with their context through the creation of computational side effects such as sounds and visuals. A commonly used tool for many kinds of expression is randomness which enables the introduction of automated variation into performances....
This paper discuses the performance of two different Evolutionary Algorithms (EAs) in a problem of Optimal Placement of Distributed Power Generation (OPDPG) in Micro-Grids (MGs). Specifically, the problem consists of choosing the node/nodes to locate a number of different distributed generators with different technologies (such as micro wind turbines, photovoltaic panels, etc.), in such a way that...
Decoding of Raptor codes consists of decoding of both the LT part and the precode part of the codes. When LT decoding is performed, a scenario may arise where the message passing-based decoding process is unable to provide non-zero log-likelihood ratio (LLR) updates to a fraction of input symbols even if it is mathematically possible to do so. The problem is even more critical for codes with short...
This paper proposes a cyclic steganographic scheme based on cyclic codes for embedding secret message. This scheme is capable of achieving low complexity and fast embedding time. These are two attractive reasons for this method: first, embedding and secret message extraction can be implemented easily by employing shift registers with feedback connections, and second, because they are rich in coding...
In this paper, a new method for the construction of a quantum stabilizer code from circulant permutation matrices is discussed. First, we choose a finite-length vector randomly, and we can construct circulant permutation matrices from the vectors. Then, the parity-check matrix can be produce from the circulant permutation matrices. Hence, the generators of stabilizer code are determined according...
This paper proposes an area-efficient partial-sum generator (PSG) architecture for polar decoder implementation. High-throughput PSG designs mainly consist of an encoding matrix generator and a partial-sum update circuit. The matrix generator conventionally is built by cascading a series of D flip-flops and XOR gates. By decomposing the target matrix into the Kronecker product of smaller matrices,...
For the designing of high performance multipliers, the redundant binary representation can be used because of its high modularity and carry free addition. In this paper, a multiplier using redundant binary modified partial product generator (RBMPPG) is designed. A redundant binary modified partial product generator eliminates the extra error correcting word generated due to Modified Booth Encoding...
Distributed storage systems need to guarantee reliable access to stored data. Resilience to node failures can be increased by using erasure encoding. A variety of erasure codes are discussed in literature and implemented in practice. This multiplicity of codes puts a heavy burden on existing systems. In scenarios such as multi-cloud file delivery or migration of data to a new erasure code, the ability...
Semi-supervised learning is a topic of practical importance because of the difficulty of obtaining numerous labeled data. In this paper, we apply an extension of adversarial autoencoder to semi-supervised learning tasks. In attempt to separate style and content, we divide the latent representation of the autoencoder into two parts. We regularize the autoencoder by imposing a prior distribution on...
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.