• Title/Summary/Keyword: bit data

Search Result 2,279, Processing Time 0.028 seconds

Performance Analysis of a Bit Mapper of the Dual-Polarized MIMO DVB-T2 System (이중 편파 MIMO를 쓰는 DVB-T2 시스템의 비트 매퍼 성능 분석)

  • Kang, In-Woong;Kim, Youngmin;Seo, Jae Hyun;Kim, Heung Mook;Kim, Hyoung-Nam
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38A no.9
    • /
    • pp.817-825
    • /
    • 2013
  • The UHDTV system, which provides realistic service with ultra-high definite video and multi-channel audio, has been studied as a next generation broadcasting service. Since the conventional digital terrestrial transmission system is not capable to cover the increased transmission data rate of the UHDTV service, there are great necessity of researches about increase of data rate. Accordingly, the researches has been studied to increase the transmission data rate of the DVB-T2 system using dual-polarized MIMO technique and high order modulation. In order to optimize the MIMO DVB-T2 system where irregular LDPC codes are used, it is necessary to study the design of the bit mapper that matches the LDPC code and QAM symbols in MIMO channel. However, the research related to the design of the bit mapper has been limited to the SISO system. Therefore, this paper defines a new parameter that indicates the VND distribution of MIMO DVB-T2 system and performs the performance analysis according to the parameter which will be helpful for designing a MIMO bit mapper.

Simulation of YUV-Aware Instructions for High-Performance, Low-Power Embedded Video Processors (고성능, 저전력 임베디드 비디오 프로세서를 위한 YUV 인식 명령어의 시뮬레이션)

  • Kim, Cheol-Hong;Kim, Jong-Myon
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.13 no.5
    • /
    • pp.252-259
    • /
    • 2007
  • With the rapid development of multimedia applications and wireless communication networks, consumer demand for video-over-wireless capability on mobile computing systems is growing rapidly. In this regard, this paper introduces YUV-aware instructions that enhance the performance and efficiency in the processing of color image and video. Traditional multimedia extensions (e.g., MMX, SSE, VIS, and AltiVec) depend solely on generic subword parallelism whereas the proposed YUV-aware instructions support parallel operations on two-packed 16-bit YUV (6-bit Y, 5-bits U, V) values in a 32-bit datapath architecture, providing greater concurrency and efficiency for color image and video processing. Moreover, the ability to reduce data format size reduces system cost. Experiment results on a representative dynamically scheduled embedded superscalar processor show that YUV-aware instructions achieve an average speedup of 3.9x over the baseline superscalar performance. This is in contrast to MMX (a representative Intel#s multimedia extension), which achieves a speedup of only 2.1x over the same baseline superscalar processor. In addition, YUV-aware instructions outperform MMX instructions in energy reduction (75.8% reduction with YUV-aware instructions, but only 54.8% reduction with MMX instructions over the baseline).

DEVELOPMENT AND TESTS OF THE ALGORITHM FOR DIRECT DATA TRANSMISSION BETWEEN RVDB AND HUGE CAPACITY DATA SERVER (RVDB와 대용량 서버 간의 직접 데이터 전송 알고리즘 개발과 시험에 관한 연구)

  • Roh, Duk-Gyoo;Oh, Se-Jin;Yeom, Jae-Hwan;Jung, Dong-Kyu;Oh, Chung-Sik;Yun, Young-Joo;Kim, Hyo-Ryoung;Ozeki, Kensuke
    • Publications of The Korean Astronomical Society
    • /
    • v.29 no.3
    • /
    • pp.45-52
    • /
    • 2014
  • This paper describes the development of algorithm for direct data transmission between Raw VLBI Data Buffer (RVDB) and Huge Capacity Data Server (HCDS) operated in Korea-Japan Correlation Center (KJCC). The transmitted data is the VLBI observation data, which is recorded at each radio telescope site, and the data transmitting rate is varying from 1 Gbps, in usual case, upto 8 Gbps. The developed algorithm for data transmission enables the direct data transmission between RVDB and HCDS through 10 Gbps optical network using VLBI Data Interchange Format (VDIF). Proposed method adopts the conventional UDP/IP protocol, but in order to prevent the loss of data during data transmission, the packet error monitoring and data re-transmission functions are newly designed. The VDIF specification and VDIFCP (VDIF Control Protocol) are used for the direct data transmission between RVDB and HCDS. To validate the developed algorithm for data transmission, we conducted the data transmission from RVDB to HCDS, and compared to the transmitted data with the original data bit by bit. We confirmed that the transmitted data is identical to the original data without any loss and it has been recovered well even if there were some packet losses.

A Simple One-pass Variable Rate Control Method for Fixed-Size Storage Systems

  • Kyungheon Noh;Jeong, Seh-Woong;Park, Jeahong;Byeungwoo Jeon
    • Proceedings of the IEEK Conference
    • /
    • 2002.07a
    • /
    • pp.289-292
    • /
    • 2002
  • This paper provides a frame-layer method for controlling bit rate of compressed video data in real time. Our approach is easy to operate and can store encoded video data in real time without deteriorating the quality of an image. To provide ameliorated and consistent visual quality, a new concept named SOP (Set Of Pictures) and a new quantization parameter variation control algorithm based on a second-order rate-distortion model 〔2〕 are introduced. The total bit-budget is allocated efficiently to cope with unpredictable recording time by using the proposed algorithm and it is distributed to each frame. In the end, we show improved and consistent video quality with experimental results obtained from C-model of a MPEG-4 (simple-profile) encoder.

  • PDF

A Low Bit Rate Speech Coder Based on the Inflection Point Detection

  • Iem, Byeong-Gwan
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.15 no.4
    • /
    • pp.300-304
    • /
    • 2015
  • A low bit rate speech coder based on the non-uniform sampling technique is proposed. The non-uniform sampling technique is based on the detection of inflection points (IP). A speech block is processed by the IP detector, and the detected IP pattern is compared with entries of the IP database. The address of the closest member of the database is transmitted with the energy of the speech block. In the receiver, the decoder reconstructs the speech block using the received address and the energy information of the block. As results, the coder shows fixed data rate contrary to the existing speech coders based on the non-uniform sampling. Through computer simulation, the usefulness of the proposed technique is shown. The SNR performance of the proposed method is approximately 5.27 dB with the data rate of 1.5 kbps.

Enhancement of SCTP Throughput using Chunk Checksum

  • Lin Cui;Koh Seok J.;Hong Yong-Geun
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2006.05a
    • /
    • pp.1147-1150
    • /
    • 2006
  • Stream Control Transmission Protocol (SCTP) uses the 32-bit checksum in the common header, by which a corrupted SCTP packet will be regarded as a lost packet and then discarded. This may result in degradation of SCTP's throughput performance over wireless networks. This paper proposes a new chunk checksum scheme for SCTP, in which each data chunk contains its own checksum field and SACK chunk carry corresponding Transmission Sequence Number (TSN) with timestamp for every corruption event. The proposed chunk checksum scheme is introduced with the following three purposes: 1) to distinguish the chunk corruptions from the chunk losses; 2) to avoid the unnecessary halving of the congestion window (cwnd) in the case of chunk corruption; 3) to avoid the unwanted timeouts which can be induced in conventional SCTP in the case that the retransmitted data chunks are corrupted again in wireless networks. Simulation results show that the proposed chunk checksum scheme could improve the SCTP throughput in the wireless environments with a high bit error rate.

  • PDF

Block matching algorithm using quantization (양자화를 이용한 블록 정합 알고리즘에 대한 연구)

  • Lee, Young;Park, Gwi-Tae
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.34S no.2
    • /
    • pp.43-51
    • /
    • 1997
  • In this paper, we quantize the image data to simplify the systolic array architecture for block matching algorithm. As the number of bits for pixel data to be processed is reduced by quantization, one can simplify the hardware of systolic array. Especially, if the bit serial input is used, one can even more simplify the structure of processing element. First, we analize the effect of quantization to a block matching. then we show the structure of quantizer and processing element when bit serial input is used. The simulation results applied to standard images have shown that the proposed block matching method has less prediction error than the conventional high speed algorithm.

  • PDF

Advanced LSB Technique for Hiding Messages in Audio Steganography (오디오 스테가노그래피에 자료를 숨기기 위한 개선된 LSB 기법)

  • Ji, Seon Su
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.19 no.1
    • /
    • pp.69-75
    • /
    • 2014
  • Audio seganography is the art and science of writing hidden messages that evolves as a new secret communication method. And audio steganography is similar to the process of modifying the Least Significant Bit of image files 8th LSB layer embedding has been done for desired binary messages. The effective of steganographic tools is to obtain imperceptible and robust way to conceal high rate of secret data. The objective of this paper is to propose a method for hiding the secret messages in safer manner from external attacks by modified LSB technique and encryption rearrangement key.

Improved Impossible Differential Attack on 7-round Reduced ARIA-256

  • Shen, Xuan;He, Jun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.11
    • /
    • pp.5773-5784
    • /
    • 2019
  • ARIA is an involutory SPN block cipher. Its block size is 128-bit and the master key sizes are 128/192/256-bit, respectively. Accordingly, they are called ARIA-128/192/256. As we all know, ARIA is a Korean Standard block cipher nowadays. This paper focuses on the security of ARIA against impossible differential attack. We firstly construct a new 4-round impossible differential of ARIA. Furthermore, based on this impossible differential, a new 7-round impossible differential attack on ARIA-256 is proposed in our paper. This attack needs 2118 chosen plaintexts and 2210 7-round encryptions. Comparing with the previous best result, we improve both the data complexity and time complexity. To our knowledge, it is the best impossible differential attack on ARIA-256 so far.

Color image Decryption Algorithm using $GF(2^m)$ inverse ($GF(2^m)$ 역산을 이용한 컬러 영상 복호화 알고리즘)

  • Lee, Kwang-Ok;Bae, Sang-Hyun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.06a
    • /
    • pp.833-836
    • /
    • 2007
  • Nowadays, the rapid increase of the available amount of internet and system performance has revealed urgent need a method of decryption about digital encryption for stabilization of multimedia data transmission. In this paper, we propose a method of decryption of each frame about video data. Also for advanced decryption, we propose color image decryption method through 4-bit binary of $GF(2^m)$ inverse about an each frame.

  • PDF