• Title/Summary/Keyword: Most significant bit

Search Result 102, Processing Time 0.031 seconds

An Analysis on Multiplexing Gain vs. Variable Input Bit Rate Relation for Designing the ATM Multiplexer (ATM 멀티플렉서의 설계를 위한 다중화이득과 가변입력비트율과의 관계 해석)

  • 여재흥;임인칠
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.29A no.8
    • /
    • pp.34-40
    • /
    • 1992
  • This paper shows a new relational formula of multiplexing gain versus variable input bit rates useful for designing Nx1 ATM(Asynchronous Transfer Mode) multiplexer which mixes several asynchronous bit streams with different transmission rates. The relation between multiplexing gain and input bit stream speeds is derived from the occupied mean lenght(the width per unit time) of cells and the occupation probability of the number of cells at an arbitrary instant when the rates of the periodic cell strams change randomly. And the relation between multiplexing gain and variable bit rates from different number of input bit streams is analyzed accordingly. Under the condition of unlimited multiplexing speed, the more number of input bit streams increases, the bigger the multiplexing gain becomes. While for the case which restricts the multiplexing speed to a limited value, the multiplexing gain becomes smaller contrarily as the number of input bit streams continues too invrease beyond a boundary value. It is shown that for designing an ATM multiplexer according to the latter case, the combination of input bit streams should be determined such as its total bit rate is lower thean, but most apprpaximate to, the multiplexed output speed. Also the general formula evaluating the most significant parameters which should be needed to design the multiplexer is derived.

  • PDF

The properties Analysis of IDEA algorithm (IDEA 알고리즘의 특성 분석)

  • 김지홍;장영달;윤석창
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.3A
    • /
    • pp.399-405
    • /
    • 2000
  • In this paper, we deal with block cipher algorithm IDEA(international data encryption algorithm), previously known as typical block cipher system. first of all, analysing key scheduler we classify the key sequences with the used key bit and the unused key bits in each round. with this properties we propose the two method, which are differential analysis using differences of plaintext pairs and linear analysis using LSB bit of plaintexts and key sequences.

  • PDF

The Improved-Scheme of Audio Steganography using LSB Techniques (LSB 기법을 이용하는 개선된 오디오 스테가노그래피)

  • Ji, Seon-Su
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.17 no.5
    • /
    • pp.37-42
    • /
    • 2012
  • Audio steganography is quite similar to the procedure of modifying the least significant bit(LSB) of image media files. The most widely used technique today is hiding of secret messages into a digitized audio signal. In this paper, I propose a new method for hiding messages from attackers, high data inserting rate is achieved. In other words, based on the LSB hiding method and digitized to change the bit position of a secret message, an encrypted stego medium sent to the destination in safe way.

Connectivity properties of real BitTorrent swarms

  • Ruben, Cuevas;Michal, Kryczka;Angel, Cuevas;Carmen, Guerrero;Arturo, Azcorra
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.9
    • /
    • pp.2246-2267
    • /
    • 2013
  • BitTorrent is one of the most important applications in the current Internet. Despite of its interest, we still have little knowledge regarding the connectivity properties of real BitTorrent swarms. In this paper we leverage a dataset including the connectivity information of 250 real torrents and more than 150k peers to carefully study the connectivity properties of peers. The main topology parameters of the studied swarms suggest that they are significantly less resilient than random graphs. The analysis of the peer level connectivity properties reveals that peers continuously change more than half of their neighbours. Furthermore, we also find that a leecher typically keeps stable connections with a handful of neighbours with which it exchanges most of its traffic whereas seeders do not establish long-term connections with any peer so that they can homogeneously distribute chunks among leechers. Finally, we have discovered that a significant portion of the studied peers (45%) have an important locality-biased neighbourhood composition.

An Adaptive Steganography of Optical Image using Bit-Planes and Multi-channel Characteristics

  • Kang, Jin-Suk;Jeong, Taik-Yeong T.
    • Journal of the Optical Society of Korea
    • /
    • v.12 no.3
    • /
    • pp.136-146
    • /
    • 2008
  • We proposed an adaptive steganography of an optical image using bit-planes and multichannel characteristics. The experiment's purpose was to compare the most popular methods used in optical steganography and to examine their advantages and disadvantages. In this paper we describe two digital methods: the first uses less significant bits(LSB) to encode hidden data, and in the other all blocks of $n{\times}n$ pixels are coded by using DCT(Digital Cosine Transformation), and two optical methods: double phase encoding and digital hologram watermarking with double binary phase encoding by using IFTA(Iterative Fourier Transform Algorithm) with phase quantization. Therefore, we investigated the complexity on bit plane and data, similarity insert information into bit planes. As a result, the proposed method increased the insertion capacity and improved the optical image quality as compared to fixing threshold and variable length method.

Adaptive Smoothing Based on Bit-Plane and Entropy for Robust Face Recognition (환경에 강인한 얼굴인식을 위한 CMSB-plane과 Entropy 기반의 적응 평활화 기법)

  • Lee, Su-Young;Park, Seok-Lai;Park, Young-Kyung;Kim, Joong-Kyu
    • Proceedings of the IEEK Conference
    • /
    • 2008.06a
    • /
    • pp.869-870
    • /
    • 2008
  • Illumination variation is the most significant factor affecting face recognition rate. In this paper, we propose adaptive smoothing based on combined most significant bit (CMSB) - plane and local entropy for robust face recognition in varying illumination. Illumination normalization is achieved based on Retinex method. The proposed method has been evaluated based on the CMU PIE database by using Principle Component Analysis (PCA).

  • PDF

Wear assessment of the WC/Co cemented carbidetricone drillbits in an open pit mine

  • Saeidi, Omid;Elyasi, Ayub;Torabi, Seyed Rahman
    • Geomechanics and Engineering
    • /
    • v.8 no.4
    • /
    • pp.477-493
    • /
    • 2015
  • In rock drilling, the most important characteristic to clarify is the wear of the drill bits. The reason that the rock drill bits fail with time is wear. In dry sliding contact adhesive wear deteriorates the materials in contact, quickly, and is the result of shear fracture in the momentary contact joins between the surfaces. This paper aims at presenting an overview of the assessment of WC/Co cemented carbide (CC) tricone bit in rotary drilling. To study wear of these bits, two approaches have been used in this research. Firstly, the new bits were weighted before they mounted on the drill rigs and also after completion their useful life to obtain bit weight loss percentage. The characteristics of the rock types drilled by using such this bit were measured, simultaneously. Alternatively, to measure contact wear, namely, matrix wear a micrometer has been used with a resolution of 0.02 mm at different direction on the tricone bits. Equivalent quartz content (EQC), net quartz content (QC), muscovite content (Mu), coarseness index (CI) of drill cuttings and compressive strength of rocks (UCS) were obtained along with thin sections to investigate mineralogical properties in detail. The correlation between effective parameters and bit wear were obtained as result of this study. It was observed that UCS shows no significant correlation with bit wear. By increasing CI and cutting size of rocks wear of bit increases.

Low Complexity Digit-Parallel/Bit-Serial Polynomial Basis Multiplier (저복잡도 디지트병렬/비트직렬 다항식기저 곱셈기)

  • Cho, Yong-Suk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.4C
    • /
    • pp.337-342
    • /
    • 2010
  • In this paper, a new architecture for digit-parallel/bit-serial GF($2^m$) multiplier with low complexity is proposed. The proposed multiplier operates in polynomial basis of GF($2^m$) and produces multiplication results at a rate of one per D clock cycles, where D is the selected digit size. The digit-parallel/bit-serial multiplier is faster than bit-serial ones but with lower area complexity than bit-parallel ones. The most significant feature of the digit-parallel/bit-serial architecture is that a trade-off between hardware complexity and delay time can be achieved. But the traditional digit-parallel/bit-serial multiplier needs extra hardware for high speed. In this paper a new low complexity efficient digit-parallel/bit-serial multiplier is presented.

Audio Steganography Method Using Least Significant Bit (LSB) Encoding Technique

  • Alarood, Alaa Abdulsalm;Alghamdi, Ahmed Mohammed;Alzahrani, Ahmed Omar;Alzahrani, Abdulrahman;Alsolami, Eesa
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.7
    • /
    • pp.427-442
    • /
    • 2022
  • MP3 is one of the most widely used file formats for encoding and representing audio data. One of the reasons for this popularity is their significant ability to reduce audio file sizes in comparison to other encoding techniques. Additionally, other reasons also include ease of implementation, its availability and good technical support. Steganography is the art of shielding the communication between two parties from the eyes of attackers. In steganography, a secret message in the form of a copyright mark, concealed communication, or serial number can be embedded in an innocuous file (e.g., computer code, video film, or audio recording), making it impossible for the wrong party to access the hidden message during the exchange of data. This paper describes a new steganography algorithm for encoding secret messages in MP3 audio files using an improved least significant bit (LSB) technique with high embedding capacity. Test results obtained shows that the efficiency of this technique is higher compared to other LSB techniques.

A Multiplier with Leading 0/1 Detector (Leading 0/1 검출 기능을 부가한 곱셈기)

  • 김영수;차영호;조경연;최혁환
    • Proceedings of the IEEK Conference
    • /
    • 2000.06c
    • /
    • pp.85-88
    • /
    • 2000
  • This paper describes the design of multiplier that receives two N-bit number and produces an N-bit product, with leading 0/l detector logic for an overflow prediction. A leading 0/l detector for two's input predict a scope of output. The part of partial products sum of N most-significant bits is exchanged for an overflow prediction. Therefore this multiplier requires less gates for the implementation about 45% than general multipliers.

  • PDF