Structure and Texture Filling-In of Missing Image Blocks in Wireless Transmission and Compression Applications
Abstract: An approach for filling-in blocks of missing data in wireless image transmission is presented in this paper. When compression algorithms such as JPEG are used as part of the wireless transmission process, images are first tiled into blocks of 8 x 8 pixels. When such images are transmitted over fading channels, the effects of noise can destroy entire blocks of the image. Instead of using common retransmission query protocols, ....etc

[:=Read Full Message Here=:]

i want the topic implementing digital signature with rsa encription algorithm to be discuose in a seminal form ....etc

[:=Read Full Message Here=:]

Abstract
In this paper, we review the logical effort model presented in . Based on the HSPICE simulation results using 0.18/Jm, CMOS technology as applied to logic blocks used in arithmetic circuits; we analyze the efficiency of the model and also present modifications that include modeling of wire delay. We propose a new model for logical effort that will better fit the behavior of these blocks. The results are applicable for evaluation of arithmetic units as well as for development of new arithmetic algorithms. Our ultimate objective is ....etc

[:=Read Full Message Here=:]

Variable Precision DSP Blocks in Stratix V Devices

This chapter describes how the variable precision digital signal processing (DSP)
blocks in Stratix® V devices are optimized to support higher-bit precision in
high-performance DSP applications, such as radar systems that must support higher
resolution and multi-antenna architectures, wireless-base station channel cards for
MIMO processing, medical and test applications for very high-precision filtering, and
fast Fourier transforms ....etc

[:=Read Full Message Here=:]

Hi,

I vinaykumar doing one security based project.. I need source code for international data encryption algorithm to implement in my project..
I request you to please send me the source code to this mail id: [email protected]...

Thanks in a advance.. ....etc

[:=Read Full Message Here=:]

Tran Duc Hai Du


Abstract

A complexity reduction algorithm for an H.264 encoder is proposed. This comes at the cost of the number of increased macroblock modes and the complex mode decision procedure using the rate-distortion optimization . H.264 demands a high degree of computational complexity to be able to make use of the advantages of its new techniques. Experiment results in show that the proposed algorithm can reduce the encoding time by 29.67% on average and the rate-distortion comput ....etc

[:=Read Full Message Here=:]

Abstract:

This paper presents a data clustering method named BIRCH(Balanced Iterative Reducing and Clustering using Hierarchies), and demonstrate that these especially suitable for very large data bases . BIRCH icrementally and dynamically clusters incoming multy dimensional metric data points to trie to produce the best qulity clustering with available recourses (i.e., available memory and time constraints).

BIRCH can typically find a good clustering with a single-scan of the data and improve the quality further with few additiona ....etc

[:=Read Full Message Here=:]

i want more information about wireless transmission and compression application along with documentation and PPT's. ....etc

[:=Read Full Message Here=:]

Structure and Texture Filling-In of Missing Image Blocks in Wireless Transmission and Compression Applications

Abstract: An approach for filling-in blocks of missing data in wireless image transmission is presented in this paper. When compression algorithms such as JPEG are used as part of the wireless transmission process, images are first tiled into blocks of 8 x 8 pixels. When such images are transmitted over fading channels, the effects of noise can destroy entire blocks of the image. Instead of using common retransmission query protoco ....etc

[:=Read Full Message Here=:]

DEAL


In cryptography, DEAL (Data Encryption Algorithm with Larger blocks) is a block cipher derived from the Data Encryption Standard (DES). The design was proposed in a report by Lars Knudsen in 1998, and was submitted to the AES contest by Richard Outerbridge (who notes that Knudsen had presented the design at the SAC conference in 1997). DEAL is a Feistel network which uses DES as the round function. It has a 128-bit block size and a variable key size of either 128, 192, or 256 bits. For key sizes of 128 and 192 bits, the cipher uses 6 ....etc

[:=Read Full Message Here=:]