Search results for "Data_CODINGANDINFORMATIONTHEORY"
showing 10 items of 196 documents
Security of public key cryptosystems based on Chebyshev Polynomials
2004
Chebyshev polynomials have been recently proposed for designing public-key systems. Indeed, they enjoy some nice chaotic properties, which seem to be suitable for use in Cryptography. Moreover, they satisfy a semi-group property, which makes possible implementing a trapdoor mechanism. In this paper we study a public key cryptosystem based on such polynomials, which provides both encryption and digital signature. The cryptosystem works on real numbers and is quite efficient. Unfortunately, from our analysis it comes up that it is not secure. We describe an attack which permits to recover the corresponding plaintext from a given ciphertext. The same attack can be applied to produce forgeries …
Large-scale compression of genomic sequence databases with the Burrows-Wheeler transform
2012
Motivation The Burrows-Wheeler transform (BWT) is the foundation of many algorithms for compression and indexing of text data, but the cost of computing the BWT of very large string collections has prevented these techniques from being widely applied to the large sets of sequences often encountered as the outcome of DNA sequencing experiments. In previous work, we presented a novel algorithm that allows the BWT of human genome scale data to be computed on very moderate hardware, thus enabling us to investigate the BWT as a tool for the compression of such datasets. Results We first used simulated reads to explore the relationship between the level of compression and the error rate, the leng…
Binary jumbled string matching for highly run-length compressible texts
2012
The Binary Jumbled String Matching problem is defined as: Given a string $s$ over $\{a,b\}$ of length $n$ and a query $(x,y)$, with $x,y$ non-negative integers, decide whether $s$ has a substring $t$ with exactly $x$ $a$'s and $y$ $b$'s. Previous solutions created an index of size O(n) in a pre-processing step, which was then used to answer queries in constant time. The fastest algorithms for construction of this index have running time $O(n^2/\log n)$ [Burcsi et al., FUN 2010; Moosa and Rahman, IPL 2010], or $O(n^2/\log^2 n)$ in the word-RAM model [Moosa and Rahman, JDA 2012]. We propose an index constructed directly from the run-length encoding of $s$. The construction time of our index i…
A generalized method for the design of ergodic sum-of-cisoids simulators for multiple uncorrelated rayleigh fading channels
2010
In this paper, we present a new method for the design of ergodic sum-of-sinusoids (SOS) simulation models for multiple uncorrelated Rayleigh fading channels. The method, which is intended for a special class of SOS models, known as sum-of-cisoids (SOC) models, can be used to generate an arbitrary number of uncorrelated Rayleigh fading waveforms with specified Doppler power spectral characteristics. This is in contrast to the SOS simulators currently available in the open literature that have been designed under the isotropic scattering assumption, which are limited to the simulation of uncorrelated channels characterized by Clarke's U-shaped Doppler power spectral density (DPSD). The excell…
Variation in contents of main active components and antioxidant activity in leaves of different pigeon pea cultivars during growth.
2013
Pigeon pea is an important and multiuse grain legume crop, and its leaves are a very valuable natural resource. To obtain a high-quality biological resource, it is necessary to choose the excellent cultivar and determine the appropriate harvest time. In this study, the variation in contents of main active components and antioxidant activity in leaves of six pigeon pea cultivars during growth were investigated. The level of each individual active component significantly varied during growth, but with a different pattern, and this variation was different among cultivars. Flavonoid glycosides orientin, vitexin, and apigenin-6,8-di-C-α-L-arabinopyranoside showed two peak values at mid-late and …
A simple joint estimation-detection technique for OFDM systems
2005
In this work a simple approach for the joint estimation-detection in a frequency selective severe fading environment of OFDM signals adopting PSK constellations is presented. A linear predictor of suitable order is adopted for the channel estimation in the frequency domain. The predictor coefficients are estimated on the basis of a sample estimation of the autocorrelation of the channel frequency response, aided by a preliminary differential decoding, in a blockwise manner. The detection technique proposed here is based on a simple tree search where a small number of best survivor paths are maintained at each step. Despite the simplicity of above detection approach, the simulation results s…
A Trajectory-Driven 3D Non-Stationary mm-Wave MIMO Channel Model for a Single Moving Point Scatterer
2021
This paper proposes a new non-stationary three-dimensional (3D) channel model for a physical millimeter wave (mm-Wave) multiple-input multiple-output (MIMO) channel. This MIMO channel model is driven by the trajectory of a moving point scatterer, which allows us to investigate the impact of a single moving point scatterer on the propagation characteristics in an indoor environment. Starting from the time-variant (TV) channel transfer function, the temporal behavior of the proposed non-stationary channel model has been analyzed by studying the TV micro-Doppler characteristics and the TV mean Doppler shift. The proposed channel model has been validated by measurements performed in an indoor e…
Mappings of finite distortion: Sharp Orlicz-conditions
2003
We establish continuity, openness and discreteness, and the condition $(N)$ for mappings of finite distortion under minimal integrability assumptions on the distortion.
ARQ Aware Scheduling for the IEEE 802.16 Base Station
2008
The IEEE 802.16 technology defines the ARQ mechanism that enables a connection to resend data at the MAC level if an error is detected. In this paper, we analyze the ARQ aware scheduling for the 802.16 base station. In particular, we consider how the BS scheduler can account for the ARQ block size, absence of the ARQ block rearrangement, and the ARQ transmission window. We propose a set of constraints that can be applied to any base station scheduler algorithm. To test them, we run a number of simulation scenarios. The simulations results confirm that the ARQ aware scheduling can improve the overall performance.
Performance analysis of the ieee 802.16 arq mechanism
2007
The IEEE 802.16 technology defines the ARQ mechanism that enables a connection to resend data at the MAC level if an error is detected. In this paper, we analyze the key features and parameters of the 802.16 ARQ mechanism. In particular, we consider a choice for the ARQ feedback type, an algorithm to build block sequences, a scheduling of the ARQ feedbacks and retransmissions, the ARQ block rearrangement, ARQ transmission window and ARQ block size. We run a number of simulation scenarios to study these parameters and how they impact a performance of application protocols. The simulation results reveal that the ARQ mechanism and its correct configuration play an important role in transmittin…