International Journal of Computer Networks and Communications Security

Volume 5, Issue 11, November 2016

 

 

Performance Measurement in OFDM System by Using Combination of Partial Transmit Sequence (PTS) & Clipping and Filtering PAPR Reduction Technique
 

Performance Measurement in OFDM System by Using Combination of Partial Transmit Sequence (PTS) & Clipping and Filtering PAPR Reduction Technique
Pages: 238-242 (5) | [Full Text] PDF (562 KB)
KK DAS, S HASAN, M RAHMAN, S SARKER
Department of Telecommunication and Electronic Engineering, Hajee Mohammad Danesh Science and Technology University Dinajpur-5200, Bangladesh

Abstract - The Orthogonal Frequency Division Multiplexing (OFDM) is a proficient way of data transmission for high speedy communication systems. Moreover, the major disadvantage of OFDM system is the high Peak to Average Power Ratio (PAPR) of the transmitted signals. Coding, Phase rotation, tone rejection, Partial transmit sequence, clipping & filtering are many PAPR reduction technique which had been proposed to overcome this problem. However, this proposed way could not solve this problem properly. Here I suggested two different PAPR reduction method that is partial transmit sequence (PTS) & clipping and filtering to solve this problem. Using this combined method we get a significant result comparing than previous techniques. In addition this is our main concern to find out better way.
 
Index Terms - OFDM, Partial transmit sequence, clipping, PAPR, CCDF

Citation - KK DAS, S HASAN, M RAHMAN, S SARKER. "Performance Measurement in OFDM System by Using Combination of Partial Transmit Sequence (PTS) & Clipping and Filtering PAPR Reduction Technique." International Journal of Computer Science and Software Engineering 5, no. 11 (2016): 238-242.
Analysis Compression Digital Image Compression Used Block Truncation Algorithm Coding (BTC) In Matlab 7.11
 

Analysis Compression Digital Image Compression Used Block Truncation Algorithm Coding (BTC) In Matlab 7.11
Pages: 243-247 (5) | [Full Text] PDF (874 KB)
T Daryanto, Q Zhao, Y Chen
Computer Science Faculty, Universitas Mercu Buana Jakarta, Jakarta, Indonesia
School of Computer Science, Beijing Institute of Technology, Beijing 100081, China

Abstract - Image compression always need for many applications. Especially for the speed of accessing a send and image in various media, the sample is Internet data. If we want good quality picture we need more capacity memory to store. One way to reduce waste of memory is Used compression algorithm for the image, many compression they are created, One of the compression can be used is a Block Truncation Code (BTC). BTC algorithm has good ability to compress an image and the complexity the algorithm is not really difficult to implementation.This paper we modified reconstruction block for recorder high mean is average High and low block. We would be comparative study Modify MoBTC quality imageis better than BTC, compression ratio in the corresponds 85% for both of them methods and image quality measurement for BTC and MoBTC.
 
Index Terms - BTC, MoBTC, Compression, Images and Algorithm

Citation - T Daryanto, Q Zhao, Y Chen. "Analysis Compression Digital Image Compression Used Block Truncation Algorithm Coding (BTC) In Matlab 7.11." International Journal of Computer Science and Software Engineering 5, no. 11 (2016): 243-247.
Short and Secure CLS Pattern Using Simple Crypto Analysis Hash Technique
 

Short and Secure CLS Pattern Using Simple Crypto Analysis Hash Technique
Pages: 248-252 (5) | [Full Text] PDF (298 KB)
A Kumar, K Dasari
M-Tech (CNIS), Department of IT, VNRVJIET, Hyderabad
Assistant Professor, Department of IT, VNRVJIET, Hyderabad

Abstract - In the irregular oracle miniature under the hardness presumptions of K-CAA and Inv-CDHP we introduce a CLS (Certificateless Signature) which proved to be a much secured in traditional public key cryptosystem (PKC). We overcome the incompetent MaptoPoint hash technique by replacing a simple cryptoanalysis hash technique by indulging most common properties of CLS conspires. The extent of signatures generated in this paper is nearly 160 bits, which strength our assumption towards less calculation cost and essentially more productive than every single known CLS plans. In this way it can be utilized generally and particularly in low-data transmission correspondence situations.
 
Index Terms - Crypto Analysis, CLS Pattern, Hash Technique

Citation - A Kumar, K Dasari. "Short and Secure CLS Pattern Using Simple Crypto Analysis Hash Technique." International Journal of Computer Science and Software Engineering 5, no. 11 (2016): 248-252.