• Title/Summary/Keyword: Bit Stream

Search Result 315, Processing Time 0.02 seconds

Hardware Channel Decoder for Holographic WORM Storage (홀로그래픽 WORM의 하드웨어 채널 디코더)

  • Hwang, Eui-Seok;Yoon, Pil-Sang;Kim, Hak-Sun;Park, Joo-Youn
    • Transactions of the Society of Information Storage Systems
    • /
    • v.1 no.2
    • /
    • pp.155-160
    • /
    • 2005
  • In this paper, the channel decoder promising reliable data retrieving in noisy holographic channel has been developed for holographic WORM(write once read many) system. It covers various DSP(digital signal processing) blocks, such as align mark detector, adaptive channel equalizer, modulation decoder and ECC(error correction code) decoder. The specific schemes of DSP are designed to reduce the effect of noises in holographic WORM(H-WORM) system, particularly in prototype of DAEWOO electronics(DEPROTO). For real time data retrieving, the channel decoder is redesigned for FPGA(field programmable gate array) based hardware, where DSP blocks calculate in parallel sense with memory buffers between blocks and controllers for driving peripherals of FPGA. As an input source of the experiments, MPEG2 TS(transport stream) data was used and recorded to DEPROTO system. During retrieving, the CCD(charge coupled device), capturing device of DEPROTO, detects retrieved images and transmits signals of them to the FPGA of hardware channel decoder. Finally, the output data stream of the channel decoder was transferred to the MPEG decoding board for monitoring video signals. The experimental results showed the error corrected BER(bit error rate) of less than $10^{-9}$, from the raw BER of DEPROTO, about $10^{-3}$. With the developed hardware channel decoder, the real-time video demonstration was possible during the experiments. The operating clock of the FPGA was 60 MHz, of which speed was capable of decoding up to 120 mega channel bits per sec.

  • PDF

A Novel Transmission Scheme with Spatial Modulation for Coded OFDM Systems (채널 부호화된 OFDM 시스템을 위한 공간 변조를 이용한 새로운 전송 기법)

  • Hwang, Soon-Up;Kim, Young-Ki;Jeon, Sung-Ho;Kang, Woo-Seok;Seo, Jong-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.7A
    • /
    • pp.515-522
    • /
    • 2009
  • In this paper, a novel transmission scheme with spatial modulation is proposed for coded orthogonal frequency division multiplexing (OFDM). The multiple-input multiple-output (MIMO) technique, so-called spatial modulation (SM), divides input data into antenna index and data signals, transmitting data signals through the specific antenna chosen by the antenna index. In order to retrieve data stream at the receiver, SM needs to detect the antenna index which means that data signals are transmitted via a certain antenna. For this reason, it should be guaranteed that channel matrix is orthogonal. For the real environment, a MIMO channel has difficulty in maintaining orthogonality due to spatial correlation. Moreover, the receiver of the conventional SM is operated by hard decision, so that this scheme has a limit to be adopted for practical systems. Therefore, soft-output demappers for the conventional and proposed schemes are derived to detect antenna index and data stream by soft decision, and a novel transmission scheme combined with spatial modulation is proposed to improve the bit error rate (BER) performance of the conventional scheme.

The Efficient Error Resilient Entropy Coding for Robust Transmission of Compressed Images (압축 영상의 강건한 전송을 위한 효과적인 에러 내성 엔트로피 부호화)

  • Cho, Seong-Hwan;Kim, Eung-Sung;Kim, Jeong-Sig
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.7 no.2
    • /
    • pp.206-212
    • /
    • 2006
  • Many image and video compression algorithms work by splitting the input image into blocks and producing variable-length coded bits for each block data. If variable-length coded data are transmitted consecutively, then the resulting coder is highly sensitive to channel errors. Therefore, most image and video techniques for providing some protection to the stream against channel errors usually involve adding a controlled amount of redundancy back into the stream. Such redundancy might take the form of resynchronization markers, which enable the decoder to restart the decoding process from the known state, in the event of transmission errors. The Error Resilient Entropy Code (EREC) is a well known method which can regain synchronization without any redundant information to convert from variable-length code to fixed-length code. This paper proposes an enhancement to EREC, which greatly improves its transmission ability for the compressed image quality without any redundant bits in the event of errors. The simulation result shows that the both objective and subjective quality of transmitted image is enhanced compared with the existing EREC at the same BER(Bit Error Rate).

  • PDF

The Related-Key Attack on Grain-v1 (스트림 암호 Grain-v1에 대한 연관키 공격)

  • Lee, Yu-Seop;Jung, Ki-Tae;Sung, Jae-Chul;Hong, Seok-Hie
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.18 no.4
    • /
    • pp.45-52
    • /
    • 2008
  • The slide resynchronization attack on Grain-v1 was proposed in [5]. Given the keystream sequence, this attack can generate the 1-bit shifted keystream sequence generated by Grain-v1. In this paper, extending the attack proposed in [5], we propose the key recovery attack on Grain-v1 using the related-key. Using the weakness of the initialization procedure of Grain-v1, this attack recover the master key with $2^{25.02}$ Ⅳs and $2^{56}$ time complexity. This attack is the first known key recovery attack on Grain-v1.

DCT-domain MPEG-2/H.264 Video Transcoder System Architecture for DMB Services (DMB 서비스를 위한 DCT 기반 MPEG-2/H.264 비디오 트랜스코더 시스템 구조)

  • Lee Joo-Kyong;Kwon Soon-Young;Park Seong-Ho;Kim Young-Ju;Chung Ki-Dong
    • The KIPS Transactions:PartB
    • /
    • v.12B no.6 s.102
    • /
    • pp.637-646
    • /
    • 2005
  • Most of the multimedia contents for DBM services art provided as MPEG-2 bit streams. However, they have to be transcoded to H.264 bit streams for practical services because the standard video codec for DMB is H.264. The existing transcoder architecture is Cascaded Pixel-Domain Transcoding Architecture, which consists of the MPEG-2 dacoding phase and the H.264 encoding phase. This architecture can be easily implemented using MPEG-2 decoder and H.264 encoder without source modifying. However. It has disadvantages in transcoding time and DCT-mismatch problem. In this paper, we propose two kinds of transcoder architecture, DCT-OPEN and DCT-CLOSED, to complement the CPDT architecture. Although DCT-OPEN has lower PSNR than CPDT due to drift problem, it is efficient for real-time transcoding. On the contrary, the DCT-CLOSED architecture has the advantage of PSNR over CPDT at the cost of transcoding time.

The Implementation of Multi-Channel Audio Codec for Real-Time operation (실시간 처리를 위한 멀티채널 오디오 코덱의 구현)

  • Hong, Jin-Woo
    • The Journal of the Acoustical Society of Korea
    • /
    • v.14 no.2E
    • /
    • pp.91-97
    • /
    • 1995
  • This paper describes the implementation of a multi-channel audio codec for HETV. This codec has the features of the 3/2-stereo plus low frequency enhancement, downward compatibility with the smaller number of channels, backward compatibility with the existing 2/0-stereo system(MPEG-1 audio), and multilingual capability. The encoder of this codec consists of 6-channel analog audio input part with the sampling rate of 48 kHz, 4-channel digital audio input part and three TMS320C40 /DSPs. The encoder implements multi-channel audio compression using a human perceptual psychoacoustic model, and has the bit rate reduction to 384 kbit/s without impairment of subjective quality. The decoder consists of 6-channel analog audio output part, 4-channel digital audio output part, and two TMS320C40 DSPs for a decoding procedure. The decoder analyzes the bit stream received with bit rate of 384 kbit/s from the encoder and reproduces the multi-channel audio signals for analog and digital outputs. The multi-processing of this audio codec using multiple DSPs is ensured by high speed transfer of date between DSPs through coordinating communication port activities with DMA coprocessors. Finally, some technical considerations are suggested to realize the problem of real-time operation, which are found out through the implementation of this codec using the MPEG-2 layer II sudio coding algorithm and the use of the hardware architecture with commercial multiple DSPs.

  • PDF

An Improvement of Still Image Quality Based on Error Resilient Entropy Coding for Random Error over Wireless Communications (무선 통신상 임의 에러에 대한 에러내성 엔트로피 부호화에 기반한 정지영상의 화질 개선)

  • Kim Jeong-Sig;Lee Keun-Young
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.43 no.3 s.309
    • /
    • pp.9-16
    • /
    • 2006
  • Many image and video compression algorithms work by splitting the image into blocks and producing variable-length code bits for each block data. If variable-length code data are transmitted consecutively over error-prone channel without any error protection technique, the receiving decoder cannot decode the stream properly. So the standard image and video compression algorithms insert some redundant information into the stream to provide some protection against channel errors. One of redundancies is resynchronization marker, which enables the decoder to restart the decoding process from a known state in the event of transmission errors, but its usage should be restricted not to consume bandwidth too much. The Error Resilient Entropy Code(EREC) is well blown method which can regain synchronization without any redundant information. It can work with the overall prefix codes, which many image compression methods use. This paper proposes EREREC method to improve FEREC(Fast Error-Resilient Entropy Coding). It first calculates initial searching position according to bit lengths of consecutive blocks. Second, initial offset is decided using statistical distribution of long and short blocks, and initial offset can be adjusted to insure all offset sequence values can be used. The proposed EREREC algorithm can speed up the construction of FEREC slots, and can improve the compressed image quality in the event of transmission errors. The simulation result shows that the quality of transmitted image is enhanced about $0.3{\sim}3.5dB$ compared with the existing FEREC when random channel error happens.

10Gbps Demultiplexer using SiGe HBT (SiGe HBT를 이용한 10Gbps 디멀티플렉서 설계)

  • 이상흥;강진영;송민규
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.4A
    • /
    • pp.566-572
    • /
    • 2000
  • In the receiver of optical communication systems, a demultiplexer converts to a single data stream with a highbit rate into several parallel data streams with a low bit rate. In this paper, we design a 1:4 demultiplexer using SiGe HBT with emitter size of 2x8um² The operation speed is 10Gbps, the rise and fall times of 20-80% are37ps and 36ps, respectively and the dissipation of power is 1.40W.

  • PDF

Multicast Model and Application of Group Communication System using Trigger (트리거를 이용한 그룹통신시스템의 멀티캐스트모델 및 응용)

  • Ryu Kwon-Yeol
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.7
    • /
    • pp.1222-1228
    • /
    • 2006
  • In this paper, I propose a video watermaking method using adaptive threshold value and half-cell motion vector. Conventional method cause a lot of change of motion vectors and bring about a falling-off in invisibility, because it search embedding condition about whole macroblocks and watermarks are embedded in arbitrary motion vectors. Proposed method improve invisibility and decrease in number of change of motion vectors, because it create threshold value by using power of motion vector(PMV), and watermarks are embedded in motion vectors which greater than threshold value. Consequently, proposed method improve invisibility with on an average 5.4 dB ~9.3dB according to video bit-stream.

A Study on the Data Compression Algorithm for Just-in-Time Rendering of Concentric Mosaic (동심원 모자이크의 실시간 표현을 위한 데이터 압축 알고리즘에 관한 연구)

  • Jee, Inn-Ho;Ahn, Hong-Yeoung
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.1
    • /
    • pp.91-96
    • /
    • 2010
  • Concentric mosaics are made with arranging and summing of video frames by using common spacial standards. Compared with previous works on 3-D wavelet transform coding, we have made important design considerations to enable flexible partial decoding and bit-stream random access. A just-in-time(JIT) rendering engine of the compressed concentric mosaic is developed. However, computationally, it is still demanding to accomplish the real-time rendering. Only the contents for specific scene representation are need to be decoded by maintaining compressed data. Thus our proposed algorithm is able to render real concentric mosaic by using lifting scheme instead of wavelet transform.