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.
In this paper, a new family of one-dimensional (1-D) spreading codes is proposed and constructed by utilizing a one-to-one correspondence algorithm, which can convert the existing two-dimensional (2-D) codes into 1-D codes systematically. The coding method not only improves the encoding efficiency and complexity but also lessens the disadvantage of not generating 1-D spreading codes easily. In addition...
Human being normally uses natural language in form of written or spoken in their daily life. It is an entirely concept based on Artificial Intelligence, Computer Science and Linguistic resources. In Indian languages, Gujarati is an Indo — Aryan language with rich and high inflection. In these languages, several words have common root that's need to be reduced by using stemmer. Stemmer is used to reduce...
Transferring confidential data is a real challenge and is the need of the hour. Steganography deals with concealing secret message in the image whereas cryptography is about altering the message into a distorted form, so that it is prevented from unauthorized access. Combining both the steganographic and cryptographic techniques will yield a secure and sophisticated system for exchanging the secret...
Differential Evolution (DE), an optimization algorithm under the roof of Evolutionary Algorithms (EAs), is well known for its efficiency in solving optimization problems which are non-linear and non-differentiable. DE has many good qualities such as algorithmic simplicity, robustness and reliability. DE also has the quality of solving the given problem with few control parameters (NP — population...
For implementation of a fast arithmetic algorithm and efficient hardware realization, signed digit representation is crucial. Redundant binary (RB) and 2's complement number representation is the most widely used technique for representation signed digit number. The drawbacks of RB technique include multi valued logic as well as need of unconventional hardware blocks. Though 2's complement notation...
A method for constructing LDPC codes is presented based on a (14, 8) extended Hamming code which is formed via column splitting of the (7, 4) Hamming code. With this code and hybrid construction, it is effortless to generate an LDPC code by mapping the (14, 8) extended Hamming code to components of the parity-check matrix of the LDPC code. Simulation results show that the capacity of hybrid construction...
Conditional replenishment algorithm (CRA) was proposed to improve the quality of a hybrid 3DTV system with mixed resolution. Since CRA generates additional information which includes inter-view vectors, it is needed to efficiently encode the information. This paper proposes a method to apply differential pulse code modulation (DPCM) to the inter-view vectors so as to improve the coding efficiency...
To represent very large or small values, large range is required as the integer representation is no longer appropriate. These values can be represented using the IEEE-754 standard based floating point representation. This paper presents high speed ASIC implementation of a floating point arithmetic unit which can perform addition, subtraction, multiplication, division functions on 32-bit operands...
In this paper, we study the effect of packet feedback loss events on the broadcast completion delay performance of instantly decodable network coding. These feedback loss events result in a continuous lack of knowledge about the reception status at different subsets of receivers. This lack of knowledge creates a challenge in selecting efficient packet combinations in subsequent transmissions. To solve...
In this paper, we consider the problem of minimizing the broadcast completion delay for instantly decodable network coding with limited feedback. We first extend the stochastic shortest path formulation of the full feedback scenario in [1] to the limited feedback scenario. We then show that the resulting formulation is more complicated to solve than the original one but has its same properties and...
To modify the security of Plus-Minus 1 algorithm used in JPEG steganography (J-PM1), a new method is proposed based on adaptive flipping probability estimation. First, the least square matching(LSM) method is introduced to calculate the flipping probability of each coefficient by minimizing the difference between the original distribution (i.e. the histogram) and that of the stego image. Second, a...
Radio frequency identification (RFID) suffers from collisions when multiple tags respond in the same time. This paper presents Query Tree ALOHA (QTA) anti collision algorithm, improved by using a new tag estimation technique based on signal strength. In addition, by using this technique it is possible to detect when two tags remain in the identification tree and hence acknowledge these tags without...
Radio frequency identification (RFID) is a wireless communication technology that provides automatic identification and data collection. In RFID systems with a large number of tags, many tags respond to the reader at the same time. Thus, enhanced anti-collision algorithms are required to have a fast multiple tag identification process. Anti-collision algorithms can be classified as probabilistic (eg...
This paper proposes a method that applies series coding technique to polygon clipping algorithm against rectangular window, which can abandon most polygon edges outside the window, keep those inside the window easily and quickly, and avoid many unnecessary computing the point of intersection. Besides, this clipping algorithm adopts the single circular linked list to represent the polygon and intersection...
In this paper, we consider the problem of minimizing the mean completion delay in wireless broadcast for instantly decodable network coding. We first formulate the problem as a stochastic shortest path (SSP) problem. Although finding the packet selection policy using SSP is intractable, we use this formulation to draw the theoretical properties of efficient selection algorithms. Based on these properties,...
Computer vision involves image edge detection which is crucial in outline capturing systems for decomposing and describing an object. This paper presents a scalable parallel algorithm skeleton for outline capturing and object recognition based on first order difference chain encoding. UNIX based Intel Xeon 2-Quadra-Core system is used for the implementation of the parallel algorithm. The algorithm...
An English text steganographic algorithm is presented that can be applied to plain text as information is embedded by modifying the orders of adjacent character pairs within the words. Matrix encoding is applied for higher embedding efficiency, and the algorithm is proposed to be used in online chat for better concealment. Experiments demonstrated the proposed method has favorable imperceptibility...
RFID is core technology in the area of ubiquitous computing. Identify the objects begin with the reader's query to the tag attached to the subject. When multiple tags exist in the reader's interrogation zone, these tags simultaneously respond to the reader's query, resulting in collision. In RFID system, the reader needs the anti-collision algorithm which can quickly identify all the tags in the interrogation...
We consider the two-user broadcast erasure channel where feedback in the form of ack messages is fed back to the transmitter. We provide an upper bound to the capacity region of this system. We then present two algorithms whose rate region (information bits per transmitted bit) becomes arbitrarily close to the upper bound for large packet sizes. The first algorithm relies on random coding techniques...
The framework for evaluation and adjustment workshop layout has been designed in the paper. The evaluation system according to the characters in the manufacturing process of aero-engine production has been constructed. The fuzzy-AHP method is put forward to evaluate workshop layout. In order to adjust workshop layout according to the schema optimized, the generic algorithm has been designed. At the...
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.