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 paper presents a low-power adaptive edge decision feedback equalizer (DFE) for 10 giga-bits-per-second (Gbps) serial links with 4 PAM (pulse-amplitude-modulation) signaling. Optimal tap coefficients are obtained adaptively using a sign-sign least-mean-square (SS-LMS) algorithm that minimizes the jitter of equalized data. Low-voltage-differential-signaling (LVDS) tap generators that double DFE...
Current methods for video description are based on encoder-decoder sentence generation using recurrent neural networks (RNNs). Recent work has demonstrated the advantages of integrating temporal attention mechanisms into these models, in which the decoder network predicts each word in the description by selectively giving more weight to encoded features from specific time frames. Such methods typically...
Since physical unclonable functions (PUFs) are considered for various security applications such as authentication and key generation, the robustness of PUFs is vital. In prior works, various error correction codes, such as Bose-Chaudhuri-Hocquenghem (BCH) codes, were used to improve the robustness of PUFs. In this paper, we use polar codes, a new family of error correction codes, to improve the robustness...
In this paper, we investigate the cryptanalysis of stream ciphers, and evaluate the enhancement to security that can be gained when the ciphertext is error prone by analyzing specific attack algorithm. The stream ciphers that we investigate here have a keystream generator that is based on linear-feedback shift registers (LFSRs). In particular, we characterize the security of these ciphers when the...
The paper is focused on use of Pulse Coupled Neural Network (PCNN) in the image steganography based on the research in the field of invariant image recognition. In general, steganography deals with data concealing in the cover mediums which can be freely accessible or transmitted by various communication channels without any restriction. A suitable position of hidden message is crucial for a successful...
Reed-Solomon code or RS code is widely used for error corrections of data in transmission and storages. However, it is thought of as insecure for direct implementation in code-based cryptography due to plaintext-known attacks. In recent years, McEliece cryptosystem with enhanced public key security by generalized RS code and Goppa code are discussed for hardware implementation. In this work, from...
For practical applications in forward error correction, the importance of a systematic codeword cannot be overemphasized. Thus, this paper proposes the construction of a systematic quasi-cyclic (QC) LDPC code. This systematic structure is achieved by a row reduction technique different from the conventional Gaussian elimination method. This row reduction technique has the advantage of being easier...
In this paper, we propose an effective face completion algorithm using a deep generative model. Different from well-studied background completion, the face completion task is more challenging as it often requires to generate semantically new pixels for the missing key components (e.g., eyes and mouths) that contain large appearance variations. Unlike existing nonparametric algorithms that search for...
The large pose discrepancy between two face images is one of the key challenges in face recognition. Conventional approaches for pose-invariant face recognition either perform face frontalization on, or learn a pose-invariant representation from, a non-frontal face image. We argue that it is more desirable to perform both tasks jointly to allow them to leverage each other. To this end, this paper...
Image recolorization enhances the visual perception of an image for design and artistic purposes. In this work, we present a deep neural network, referred to as PaletteNet, which recolors an image according to a given target color palette that is useful to express the color concept of an image. PaletteNet takes two inputs: a source image to be recolored and a target palette. PaletteNet is then designed...
Variable-length codes with incremental redundancy controlled by feedback allow a system to approach capacity with short average blocklengths and thus relatively low-complexity decoders. This paper shows how to use those same variable-length codes with incremental redundancy to approach capacity without feedback. The general principle is to provide a common pool of redundancy that can be accessed by...
In this work, we adapt the notion of generalized Hamming weight of block codes to introduce the novel concept of generalized column distances for convolutional codes. This can be considered as an extension of the work done in [18] on the generalized Hamming weights for free distance of convolutional codes. We also introduce the concept of Almost-MDP and Near-MDP convolutional code. The problem of...
We define multi-block interleaved codes as codes that allow reading information from either a small sub-block or from a larger full block. The former offers faster access, while the latter provides better reliability. We specify the correction capability of the sub-block code through its gap t from optimal minimum distance, and look to have full-block minimum distance that grows with the parameter...
Concatenation of polar codes with cyclic redundancy check (CRC) codes, together with successive cancellation list (SCL) decoding, is known to be an effective approach that can significantly enhance the performance of the original polar codes. Most of the studies on the concatenation of CRC and polar codes, however, pay little attention to the structure of CRC codes themselves, even though the longer...
Low Density Lattice Code (LDLC) uses a lattice with a sparse inverse matrix, which allows a linear complexity decoding. Spatially Coupled Low Density Lattice Code (SC-LDLC) is built by coupling several LDLCs which leads to a smaller Symbol Error Rate (SER) than the LDLC scheme for every tested block length n. In this paper, new constructions of the spatially coupled low density lattice codes are introduced,...
Space-time trellis codes (STTCs) combine channel coding and multiple-input multiple-output (MIMO) techniques to provide coding and diversity gains for wireless communication systems. The decoding complexity is extremely high because of the high density of branch metric calculations. Thus, this study presents a state-purging mechanism based on the T-algorithm to reduce the computational complexity...
5-th generation mobile networks aim the peak data rates in excess of few Gbs, which may appear to be challenging to achieve due to the existence of some blocks such as the turbo decoder. In fact, the interleaver is known to be a major challenging part of the turbo decoder due to its need to the parallel interleaved memory access. LTE uses Quadratic Permutation Polynomial (QPP) interleaver, which makes...
In this paper, we present a designed single Magnetic Tunnel Junction (MTJ) cell and a single switching transistor (1T-1MTJ) bitcell based 8Mb 64 I/O Spin-Transfer-Torque Magnetic RAM (STT-MRAM). Novel 3-Section Symmetric Reference Structure and high-gain Single-stage cross-coupled Sense Amplifier (SA) are implemented. The developed chip has about 40% decreased area and power consumption when compared...
In this paper, we consider channel coding scheme for single carrier Internet of Things (SC-IoT). We propose new Raptor codes for SC-IoT devices with new degree distributions suitable for single carrier transmission to provide long term battery life services. In the proposed Raptor codes, Low Density Generator Matrix (LDGM) codes are used as the precode, called LDGM-Raptor codes. The codes are optimally...
This paper introduces a class of specific puncturing patterns, called symmetric puncturing patterns, which can be characterized and generated from the rows of the generator matrix GN. They are first shown to be non-equivalent, then a low-complexity method to generate symmetric puncturing patterns is proposed, which performs a search tree algorithm with limited depth, over the rows of GN. Symmetric...
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.