• Title/Summary/Keyword: 데이터 스크램블링

Search Result 28, Processing Time 0.023 seconds

Design of Bit Manipulation Accelerator fo Communication DSP (통신용 DSP를 위한 비트 조작 연산 가속기의 설계)

  • Jeong Sug H.;Sunwoo Myung H.
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.42 no.8 s.338
    • /
    • pp.11-16
    • /
    • 2005
  • This paper proposes a bit manipulation accelerator (BMA) having application specific instructions, which efficiently supports scrambling, convolutional encoding, puncturing, and interleaving. Conventional DSPs cannot effectively perform bit manipulation functions since かey have multiply accumulate (MAC) oriented data paths and word-based functions. However, the proposed accelerator can efficiently process bit manipulation functions using parallel shift and Exclusive-OR (XOR) operations and bit jnsertion/extraction operations on multiple data. The proposed BMA has been modeled by VHDL and synthesized using the SEC $0.18\mu m$ standard cell library and the gate count of the BMA is only about 1,700 gates. Performance comparisons show that the number of clock cycles can be reduced about $40\%\sim80\%$ for scrambling, convolutional encoding and interleaving compared with existing DSPs.

Scrambling Technology using Scalable Encryption in SVC (SVC에서 스케일러블 암호화를 이용한 스크램블링 기술)

  • Kwon, Goo-Rak
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.4
    • /
    • pp.575-581
    • /
    • 2010
  • With widespread use of the Internet and improvements in streaming media and compression technology, digital music, video, and image can be distributed instantaneously across the Internet to end-users. However, most conventional Digital Right Management are often not secure and not fast enough to process the vast amount of data generated by the multimedia applications to meet the real-time constraints. The SVC offers temporal, spatial, and SNR scalability to varying network bandwidth and different application needs. Meanwhile, for many multimedia services, security is an important component to restrict unauthorized content access and distribution. This suggests the need for new cryptography system implementations that can operate at SVC. In this paper, we propose a new scrambling encryption for reserving the characteristic of scalability in MPEG4-SVC. In the base layer, the proposed algorithm is applied and performed the selective scambling. And it encrypts various MVS and intra-mode scrambling in the enhancement layer. In the decryption, it decrypts each encrypted layers by using another encrypted keys. Throughout the experimental results, the proposed algorithms have low complexity in encryption and the robustness of communication errors.

A Design of TC layer Controller for ATM-PON OLT (ATM-PON OLT TC 계층 처리기 설계)

  • 이석훈;채종억;유태환;김봉태;김재근;김대영
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.6B
    • /
    • pp.1059-1067
    • /
    • 1999
  • In this paper characteristics of ATM-PON is described and a TC layer controller for ATM-PON OLT is designed. This paper proposes an algorithm of economically controlling the grant information written by CPU to dynamically allocate the upstream bandwidth on the PON among the ONUs in a fair way and of encrypting the downstream data using a lower standard of encryption, termed data churning, which is used to distinguish it from existing transmission system scramblers and higher layer encryption methods. This paper also proposes a method of allocating churning-related message into the PLOAM cell in order to synchronously change the churning key between the OLT and the ONU.

  • PDF

A Study on Video Data Protection Method based on MPEG using Dynamic Shuffling (동적 셔플링을 이용한 MPEG기반의 동영상 암호화 방법에 관한 연구)

  • Lee, Ji-Bum;Lee, Kyoung-Hak;Ko, Hyung-Hwa
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.1
    • /
    • pp.58-65
    • /
    • 2007
  • This dissertation proposes digital video protection algorithm lot moving image based on MPEG. Shuffling-based encryption algorithms using a fixed random shuffling table are quite simple and effective but vulnerable to the chosen plaintext attack. To overcome this problem, it is necessary to change the key used for generation of the shuffling table. However, this may pose a significant burden on the security key management system. A better approach is to generate the shuffling table based on the local feature of an image. In order to withstand the chosen plaintext attack, at first, we propose a interleaving algorithm that is adaptive to the local feature of an image. Secondly, using the multiple shuffling method which is combined interleaving with existing random shuffling method, we encrypted the DPCM processed 8*8 blocks. Experimental results showed that the proposed algorithm needs only 10% time of SEED encryption algorithm and moreover there is no overhead bit. In video sequence encryption, multiple random shuffling algorithms are used to encrypt the DC and AC coefficients of intra frame, and motion vector encryption and macroblock shuffling are used to encrypt the intra-coded macroblock in predicted frame.

  • PDF

Implementation of 1.5Gbps Serial ATA (1.5Gbps 직렬 에이티에이 전송 칩 구현)

  • 박상봉;허정화;신영호;홍성혁;박노경
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.41 no.7
    • /
    • pp.63-70
    • /
    • 2004
  • This paper describes the link layer and physical layer of the Serial ATA which is the next generation for parallel ATA specification that defines data transfer between PC and peripheral storage devices. The link layer consists of CRC generation/error detection, 8b/10b decoding/encoding, primitive generation/detection block. For the physical layer, it includes CDR(Cock Data Recovery), transmission PLL, serializer/de-serializer. It also includes generation and receipt of OOB(Out-Of-Band) signal, impedance calibration, squelch circuit and comma detection/generation. Additionally, this chip includes TCB(Test Control Block) and BIST(Built-In Selt Test) block to ease debugging and verification. It is fabricated with 0.18${\mu}{\textrm}{m}$ standard CMOS cell library. All the function of the link layer operate properly. For the physical layer, all the blocks operate properly but the data transfer is limited to the 1.28Gbps. This is doe to the affection or parasitic elements and is verified with SPICE simulation.

An Effective Method of Design and Implementation for Conditional Access System in Terrestrial-DMB (지상파DMB 제한수신 시스템의 효율적인 설계 및 구현 방법)

  • Lee, Yong-Hoon;Lee, Jin-Hwan;Lee, Gwang-Soon;Lee, Soo-In;Kim, Nam
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.10A
    • /
    • pp.1020-1030
    • /
    • 2006
  • As the Terrestrial DMB(T-DMB) has been launched, service providers are focusing on finding a business model as well as preparing the variety of data services. So, the need for development of the CAS(Conditional Access system) is urgently required and its domestic standardization is also in progress. This Paper proposes design and implementation methods of an Ensemble Re-multiplexer and receiver platform for its verification that can be used for the CAS system in T-DMB. And, with transmitting ensemble stream scrambled by the proposed Ensemble Re-multiplexer, we verified their performance by do-scrambling and decoding according to scramble mode at the receiver platform.

Parallel Descrambling of Transponder Telegram for High-Speed Train (고속철도용 트랜스폰더 텔레그램의 병렬 디스크램블링 기법)

  • Kwon, Soon-Hee;Park, Sungsoo;Shin, Dong-Joon;Lee, Jae-Ho;Ko, Kyeongjun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.2
    • /
    • pp.163-171
    • /
    • 2016
  • In order to detect the exact position of high-speed train, it is necessary to obtain location information from the transponder tag installed along the track. In this paper, we proposed parallel descrambling scheme for high-speed railway transponder system, which aims for reducing the processing time required to decode telegram. Since a telegram is stored in a tag after information bits are scrambled by an encoder, decoding procedure includes descrambling of received telegram to recover the original information bits. By analyzing the structure of the descrambling shift register circuit, we proposed a parallel descrambling scheme for fast decoding of telegram. By comparing the required number of clocks, it is shown that the proposed scheme significantly outperforms the original one.

A Study on the Hangul Syllables of Unicode System considering Data Transmission Efficiency (데이터전송효율을 고려한 유니코드의 한글글자마디에 대한 연구)

  • Hong, Wan-Pyo
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.10 no.1
    • /
    • pp.39-46
    • /
    • 2015
  • The paper studied possibility of improvement of efficient of data processing in the line coder when Hangul syllables in Unicode system is used for the source code. The scrambling in the line coder is to solve the problem happened due to the source code. The study is based on the HDB-3 scrambling method in ITU-T standards that is applied to AMI line coder. The referred data of Hangul syllables and its use frequency which are required to analysis was used the data extracted from the source data of the National Korean Language Institute. According to the analysis, the average 24% scrambling was generated in source code of Hangul syllables in Unicode system. When the referred Hangul syllables was applied to Unicode system, the average 27% scrambling was producted. Total 8,924ea Hangul syllables in 11,172ea Hangul syllables in Unicode system were not scrambled. Therefore the referred Hangul syllables 1,540ea were accepted in the unscrambled code areas. As a result, the existing Unicode Hangul syllable codes can't prevent the scrambling, but it is possible to completely remove the 27% scrambling with new source coding system. And then, it can be improved the data processing efficient upto minimum 27% in line coder by software in presentation layer instead of physical layer.