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 parallel point-multiplication on conic curves based on standard NAF algorithm and Chinese Remainder Theorem. All analysis of parallel methodologies should take advantage of the basic parallel algorithms of conic curves cryptosystem in our previous works. We employ standard NAF algorithm to parallel the point-multiplication over finite field Fp by adopting the pipeline technique...
We propose a new algorithm based on PEG algorithm to construct high-girth quasi-cyclic low-density parity check (QC-LDPC) codes. Before our improved algorithm in introduction, we depict the general algorithm based on PEG algorithm to construct QC - LDPC code, if necessary to eliminate the short cycles, that would bring in cycles-search. When code length of basic matrix is not too long, the algorithm...
This paper presents the digital signal processor design for constant-false-alarm-rate (CFAR) signal detection in a frequency-modulated-continuous-waveform (FMCW) radar system. It is capable of identifying the beat signal from the spectrum so as to calculate the distance between the radar and the ground. The proposed CFAR signal detection design is an enhancement of the basic AND-CFAR architecture,...
We show that sub linear-space bounded real-time, deterministic or nondeterministic Turing machines are equivalent to finite automata. Non-regular real-time definable languages (and also quasi-real-time languages, their nondeterministic extension) can thus only be accepted with linear or super linear work space.
The omnipresence of e-services running on various instances of pervasive e-infrastructures that are fundamental to the contemporary information society generates an abundance of digital evidence. The evidence in a digital form stems from a myriad of sources ranging from stand alone computers and their volatile and non-volatile storages, to mobile small scale digital devices, network traffic, ever-present...
Fine Granular Scalable (FGS) video coding is a key technology in MPEG-4 streaming video profile. With the Internet developing rapidly, it comes into being and adapts magnificently to Internet's highly heterogeneity, providing with favorable robustness. However, FGS coding efficiency is low, which brings some Improving Algorithms of FGS. Progressive Fine Granular Scalable (PFGS) Coding is the significant...
The min-min problem of finding a disjoint-path pair with the length of the shorter path minimized is known to be NP-complete and admits no K-approximation for any K >; 1 in the general case [1]. In this paper, we show that Bhatia et al [2]'s NP-complete proof, a claim of correction to Xu et al's proof [1], for the edge-disjoint min-min problem in undirected graphs is incorrect by giving a counter...
Design of eXtensible Markup Language schema document (XSD) plays an extremely important role in software development process and needs to be quantified for ease of reusability and flexibility. In this paper, Entropy Measure of Complexity (EMC) metric is proposed. The EMC metric measures how element and attribute types of XSD are inheritance to one another. More EMC value leads to greater design complexity...
In this article, a new method to design the flexible-length S-random interleaver is proposed for storage optimization in a turbo coding system. In this method, the high-spread property s-random interleaver is constructed by selecting appropriate position and element that can improve spread property of interleaver in each iteration in which length of interleaver is increased. Using this method, interleavers...
Cryptography plays an important role in the security of data transmission. The Advanced Encryption Standard (AES) is the newly accepted symmetric cryptography standard for transferring block of data securely. However, the faults that accidently or maliciously occur in the hardware implementation of this standard may cause erroneous encrypted/decrypted output that results in losing the original message...
The complexity of technology and structure of equipments increasing significantly raise challenges in equipment diagnosis. Extensive researches make us recognize that Design for Testability (DFT) must be carried out concurrently with functional design of equipments in order to fundamentally solve these problems. Diagnostic strategy design, as an important aspect during DFT, is crucial for reducing...
In usual computers - that use binary representation of real numbers - an irrational real number (and even a rational number like 1.3 or 1.2) can only be computed with a finite accuracy. The more accuracy we need, the larger the computation time. It is therefore reasonable to characterize the complexity of computing a real number a by the accuracy Δa(t) that we can achieve in time t. Once we know this...
Summary form only given. In this paper, we propose an optimized in painting-based macro block(MB) prediction mode (IP-mode) in the state-of-the-art H.264/AVC video compression engine, and belief propagation (BP) is applied to achieve the global spatio-temporal consistency between the predicted content and the co-located known region. To decrease the computing complexity of the iterative BP algorithm,...
In this paper, we revisit the Property Matching problem and present a better indexing scheme for the problem. Let T be a text of length n with property p, and P be a pattern of length m, both strings are over a fixed finite alphabet. In particular, the existing data structures all require O(n log n)-bit space, where n is the length of the text. By using compressed suffix array and other supporting...
In this paper, we consider user selection algorithms for Multi-user MIMO systems with perfect or partial channel state information at the transmitter (CSIT). A novel user selection algorithm based on chordal distance is proposed. The basic principle is to serve the user subset in which one is approximately orthogonal to the others. Since the chordal distance relies only on the channel direction information,...
This work addresses the rate-distortion (R-D) optimal packetization (OP) of embedded bitstreams into independent source packets, in order to limit error propagation in transmission over packet lossy channels. The input embedded stream is assumed to be an interleaving of K independently decodable basic streams. To form N independent source packets, each of L symbols, the set of basic streams is partitioned...
With an aim to master the development regulations of modern naval warfare, the author divides the complexity of modern naval warfare into the structure complexity and the behavior complexity for further measuring through analyzing the concept of naval warfare complexity. Firstly, the “distribution entropy of node strength” is brought forward to measure the complexity of static structure of naval warfare...
A minimum connected dominating set (MCDS) offers an optimized way of sending messages in wireless networks. However, constructing a MCDS is a NP-complete problem. Many heuristics based approximation algorithms for MCDS problems have been previously reported. In this paper, we propose a new degree-based multiple leaders initiated greedy approximation algorithm (PSCASTS) based on the selection of a...
In this paper, we present a low-complexity joint estimation algorithm of the direction of arrival (DOA) and time of arrival (TOA) for mobile location system, which is based on a multiple signal classification (MUSIC) algorithm. To reduce the computational overhead of conventional joint DOA/TOA estimation algorithms, the proposed approach employs two complexity reduction schemes: separation of the...
Random testing represents a simple and tractable way for software assessment. This paper presents the Seed tool that can be used for the uniform random generation of recursive data structures such as labelled trees and logical formulas. We show how Seed can be used in several testing contexts, from model based testing to performance testing. Generated data structures are defined by grammar-like rules,...
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.