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 an imaging radar, synthetic aperture radar (SAR) requires the images of high-resolution. To enhance the resolution of images, SAR adopts the chirp signal [1]. The chirp signal is often referred as a linear frequency modulated (LFM) signal because the instantaneous frequency of chirp signal increases or decreases linearly with the time. To realize the chirp signal in SAR system, the chirp signal...
This paper presents energy management improvement for a Hybrid Electric Boat (HEB) using frequency approach. Diesel generator is assisted by supercapacitors and lithium-battery to satisfy energetic demand of hybrid electric boat. Supercapacitors and lithium-battery are linked to DC-bus through two bidirectional converters, and diesel generator is connected to DC-bus using three phase controlled rectifier...
In this paper, a new method for blind recognition of BCH code from an intercepted sequence of noise affected codewords is proposed. The proposed method recovers the parameters of a BCH code by finding the roots of it's generator polynomial. Firstly, the Galois Field Fourier Transform (GFFT) operation is carried out for each sequence of an estimated length. Then, find the positions of common zero spectral...
We present a new approach to constructing unconditional pseudorandom generators against classes of functions that involve computing a linear function of the inputs. We give an explicit construction of a pseudorandom generator that fools the discrete Fourier transforms of linear functions with seed-length that is nearly logarithmic (up to polyloglog factors) in the input size and the desired error...
Many regions in Russia have no centralized electricity supply because of their geographical location. Taking into account variable electricity generation, available energy storage systems, as well as stricter requirements imposed by consumers on power quality and electricity supply reliability, we can say that operating conditions of such systems and their control, including emergency control, represent...
The natural generalization of classical polynomials are the pseudo-polynomials and the pseudo-polynomials with interval coefficients too. The main topic of this paper is the g-integration of special functions, i.e. the g-integration of pseudo-polynomials.
Long Term Evolution Advanced (LTE-A) uses four different kinds of Cyclic Redundancy Check (CRC) to verify the integrity of the transmitted data, which implies using four circuits for each CRC in the transceiver system. In this paper, a novel algorithm is introduced to combine three of these CRC circuits into one in order to minimize the total area of the transceiver. This method will insure a considerable...
Using of extended finite fields for cryptographic information protection is considered. In particular, explicit construction in finite fields elements of high multiplicative order is described.
When data owners store their data on cloud servers, they may want to define the access requirements themselves, where attribute-based authentication (ABA) can be a good choice for the solution. In this paper, we propose a traceable hierarchical ABA (HABA) solution which fits two situations in the cloud. The first situation is when cloud users are organized in groups of a hierarchical structure and...
Wireless technology has become a main player in communication through its desirable mobility characteristic. However, like many technologies, there are ways that it can be exploited. One of these ways is through side-channel communication, whereby secret messages are passed along by the purposeful corruption of frames. These side channels can be established by intentionally corrupting the Frame Check...
Multidimensional linear systems that are finite-dimensional over the coefficient field admit 1D-like state space realizations. We generalize this fact to the case where the base field is replaced by an arbitrary commutative Noetherian ring. It turns out that the concept of “state spaces” has to be replaced by that of “state modules”, which are not necessarily free.
The S-Box operation in the Advanced Encryption Standard has a long history of research in tailored and optimised hardware designs. While Canright's design based on tower-field decomposition has long been a benchmark design for low area, designs based on linear-feedback structures achieve lower area and power consumption at the price of additional clock cycles. We combine both approaches to get a design...
We focus on Riesz MV-algebras, which are MV-algebras equipped with a multiplication by numbers in the real interval [0,1]. In analogy with a work in preparation for MV-algebras by the same authors, we consider for every integer n the Riesz MV-algebra of all continuous functions from the n-th power of [0,1] to [0,1] and the Riesz MV-subalgebras thereof. In particular we study the Riesz MV-subalgebras...
This paper gives a theoretical background to dynamic generation of primitive polynomials, their usage in many fields including cryptography for a mobile communication systems. Presented polynomials and their generation over a Galois field is discussed. Additionally, the basic properties and arithmetic methods over finite fields of characteristic 3 are presented. The main objective of this paper is...
Skew polynomials are elements of a noncommutative ring that, in recent years, have found applications in coding theory and cryptography. Skew polynomials have a well-defined evaluation map. This map leads to the definition of a class of codes called Generalized Skew-Evaluation codes that contains Gabidulin codes as a special case as well as other related codes with additional desirable properties...
A typical floating-point environment includes support for a small set of about 30 mathematical functions such as exponential, logarithm, trigonometric and hyperbolic functions. These functions are provided by mathematical software libraries (libm), typically in IEEE754 single, double and quad precision. This article suggests to replace this libm paradigm by a more general approach: the on-demand generation...
Stochastic Computing (SC) with random bit streams has been used to replace binary radix encoding. SC-based logic cicuits take advantage of area minimization, fast and accurate operation and inherent fault tolerance. In this paper, the stochastic characteristics inherent in Spin Torque Transfer Magnetic Tunnel Junction (STT-MTJ) bring on an innovative stochastic number generator (SNM) circuit. The...
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...
The column Hamming distance of a convolutional code determines the error correction capability when streaming over a class of packet erasure channels. We show that the column sum rank parallels column Hamming distance when streaming over a network with link failures. We prove rank analogues of several column distance properties and introduce a new family of convolutional codes that maximize the column...
We consider quantum MDS (QMDS) codes for quantum systems of dimension q with lengths up to q2 + 2 and minimum distances up to q + 1. We show how starting from QMDS codes of length q2 + 1 based on cyclic and constacyclic codes, new QMDS codes can be obtained by shortening. We provide numerical evidence for our conjecture that almost all admissible lengths, from a lower bound n0(q, d) on, are achievable...
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.