This paper presents a high-speed, low-power and low area encoder for implementation of flash ADCs. Key technique for design of this encoder is performed by convert the conventional 1-of-N thermometer code to 2-of-M codes (M = ¾ N). The proposed encoder is composed from two-stage; in the first stage, thermometer code are converted to 2-of-M codes by used 2-input AND and 4-i...

Deep Learning approaches have brought solutions, with impressive performance, to general classification problems where wealthy of annotated data are provided for training. In contrast, less progress has been made in continual learning a set non-stationary classes, mainly when applied unsupervised streaming data. Here, we propose novel incremental approach which combines deep features encoder an...

Communication in the presence of a priori known interference at the encoder has gained great interest because of its many practical applications. In this paper, additive exponential noise channel with additive exponential interference (AENC-AEI) known non-causally at the transmitter is introduced as a new variant of such communication scenarios‎. First, it is shown that the additive Gaussian ch...

The capacity of the multiple-access channel with any distribution of messages among the transmitting nodes was determined by Han in 1979 and the expression of the capacity region contains a number of rate bounds and that grows exponentially with the number of messages. We derive a more compact expression for the capacity region of this channel in which the number of rate bounds depends on the d...

In data-hiding the issue of the achievable rate maximization is closely related to the problem of host interference cancellation. The optimal host interference cancellation relies on the knowledge of the host realization and the channel statistics (the additive white Gaussian noise (AWGN) variance) available at the encoder a priori to the transmission. The latter assumption can be rarely met in...

Elementary information about convolutional codes over finite fields is introduced, and various motivations for extension to convolutional codes over finite rings are discussed. The recent primary motivation is found to be for use over phase modulation signals. Such ring codes enjoy the special property of phase weight equal to phase distance equal to the squared Euclidean distance between phase...

Unit memory convolutional codes with generator matrices, which are composed of circulant suhmatrices, are introduced. This structure facilitates the analysis as well as an efficient search for good codes. Equivalences among such codes and consider some of the basic structural properties are discussed. In particular, catastrophic encoders and minimal encoders are characterized and dual codes tre...

In this paper we provide an achievable rate region for the discrete memoryless multiple access channel with correlated state information known non-causally at the encoders using a random binning technique. This result is a generalization of the random binning technique used by Gel’fand and Pinsker for the problem with non-causal channel state information at the encoder in point to point communi...