• Title/Summary/Keyword: Scrambling

Search Result 147, Processing Time 0.025 seconds

Frequency Domain Scrambling Code Allocation for MC-CDMA Based Communication Systems (MC-CDMA 기반 통신 시스템을 위한 주파수 영역 스크램블링 부호 할당)

  • Kim, Houng-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.1A
    • /
    • pp.44-50
    • /
    • 2007
  • In typical MC-CDMA systems, different frequency-domain scrambling codes are randomly chosen from a given code set and then assigned to different subscriber stations using the same subcarrier set. When orthogonal codes are employed for the frequency-domain scrambling, the choice of the scrambling code does not affect the detection performance if the timing and frequency synchronizations are perfect and the channel characteristic is flat. However, in practical cases, inter-code interference often appears due to the broken code orthogonality. In this paper, the optimal order of allocating the orthogonal frequency-domain scrambling codes to new subscriber stations is derived under non-negligible timing offsets in MC-CDMA system.

Scrambling Technology in MPEG Video Environment (MPEG비디오 부호화기 내의 scrambling 기술)

  • Kwon, Goo-Rak;Youn, Joo-Sang
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.7
    • /
    • pp.1279-1284
    • /
    • 2009
  • With the advance of multimedia technology, multimedia sharing among multiple devices has become the main issue. This allows users to expect the peer-to-peer distribution of unprotected and protected contents over public network. Inevitably, this situation has caused an incredible piracy activity and Web sites have begun to provide copyrighted A/V data for free. In order to, protect the contents from illegal attacks and distribution, digital right management (DRM) is required. In this paper, we present the minimal cost scrambling scheme for securing the copyrighted multimedia using the data encryption standard (DES) encryption technique. Experimental results indicate that the proposed scrambling techniques achieve a very good compromise between several desirable properties such as speed, security, and file size.

Source Coding Rule of Characters to Minimize HDB-3 Scrambling in Line Coder for UTF-8 code (UTF-8 부호의 HDB-3스크램블링 최소화를 위한 문자의 원천부호화 규칙)

  • Hong, Wan-Pyo
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.10 no.9
    • /
    • pp.1019-1026
    • /
    • 2015
  • This paper studied the source coding rule of the characters to minimize the HDB-3 scrambling for UTF-8 code. An existing source coding rule of the characters to minimize the HDB-3 scrambling in the line coder is for the source codes which are directly entered into the line coder without any transformation. Therefore the existing source coding rule can't apply the UTF-8 code which is directly came into an input of line coder. The reason is that the scrambling code in the source codes are not same as UTF-8 codes. So, if they want to analysis the scrambling occurrence situation in UTF-8 codes and make an unscrambling UTF-8 code, they should make a UTF-8 code table for the source codes, find out the scrambling occurrence codes and then encode the unscrambling source code. The source coding rule for UTF-8 code showing this paper can omit such a complicated procedure to encode an unscrambling source code.

Digital Video Scrambling Method using Intra Prediction Mode of H.264 (H.264 인트라 예측 모드를 이용한 디지털 비디오 스크램블링 방법)

  • Ahn Jinhaeng;Jeon Byeungwoo
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.42 no.2 s.302
    • /
    • pp.59-68
    • /
    • 2005
  • The amount of digitalized contents has been rapidly increased, but the main distribution channel of them is Internet which is easily accessible. Therefore 'security' necessarily arises as one of the most important issues and the method of protecting contents becomes a major research topic as much as data coding techniques. In recent years, many developers have studied on techniques that allow only authorized person to access contents. Among them the scrambling method is one of well-known security techniques. In this paper, we propose a simple and effective digital video scrambling method which utilizes the intra block properties of a recent video coding technique, H.264. Since intra prediction modes are adopted in H.264 standard, it is easy to scramble a video sequence with modification of the intra prediction modes. In addition to its simplicity, the proposed method does not increase bit rate after scrambling. The inter blocks are also distorted by scrambling intra blocks only. This paper introduces a new digital video scrambling method and verifies its effectiveness through simulation.

Integer Programming Model and Heuristic on the Guided Scrambling Encoding for Holographic Data Storage (홀로그래픽 저장장치에 대한 GS 인코딩의 정수계획법 모형 및 휴리스틱)

  • Park, Taehyung;Lee, Jaejin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38A no.8
    • /
    • pp.656-661
    • /
    • 2013
  • In Guided Scrambling (GS) encoding for the holographic storage, after scrambling augmented source word into codeword, the best codeword satisfying modulation constraint is determined. Modulation constraints considered in this paper are strength which is the minimum number of transition between '0' and '1' in each row and column of codeword array and the symbol balancedness of codeword array. In this paper, we show that GS encoding procedure can be formulated as an integer programming model and develop a fast neighborhood search heuristic for fast computation of control bits. In the simulation, we compared the performance of heuristic algorithm with the integer programming model for various array and control bit size combinations.

Data Scrambling Scheme that Controls Code Density with Data Occurrence Frequency (데이터 출현 빈도를 이용하여 코드 밀도를 조절하는 데이터 스크램블링 기법)

  • Hyun, Choulseung;Jeong, Gwanil;You, Soowon;Lee, Donghee
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.10 no.9
    • /
    • pp.235-242
    • /
    • 2021
  • Most data scrambling schemes generate pure random codes. Unlike these schemes, we propose a variable density scrambling scheme (VDSC) that differentiates densities of generated codes. First, we describe conditions and methods to translate plain codes to cipher codes with different densities. Then we apply the VDSC to flash memory such that preferred cell states occur more than others. To restrain error rate, specifically, the VDSC controls code densities so as to increase the ratio of center state among all possible cell states in flash memory. Scrambling experiments of data in Windows and Linux systems show that the VDSC increases the ratio of cells having near-center states in flash memory.

Parallel Scrambling Techniques for Multibit-Interleaved Multiplexing Environments (다중 비트 다중화 환경에서의 병렬 혼화 기법)

  • 김석창;이병기
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.31A no.4
    • /
    • pp.30-38
    • /
    • 1994
  • In this paper, we propose the parallel scrambling technique which is applicable in the multibit-interleaved multiplexing environment. For this, we introduce the concept of SSRG (simple shift register generator) and MSRG(modular shift register generator), and investigate their properties. We also introduce the concept of PSRG(parallel shift register generator) - parallel form of shift register generator, and consider realizations of PSRGs based on SSRGs and MSRGs. Finally, we show how to apply PSRGs to the parallel scrambling for the SDH system.

  • PDF

Scrambling in Koran: A Marker-based Approach

  • Cho, Sae-Youn;Choe, Jong-Joo
    • Language and Information
    • /
    • v.5 no.1
    • /
    • pp.73-85
    • /
    • 2001
  • The purpose of this paper is to explore the relationship between nominal markers and scrambling in Korean by providing proper LP constraints based on Cho &Chai (2000) anc Cho & Choe(2001). In doing so, we introduce a new type marker which includes case, postpositions and delimiters and propose the Adjunct LP Constraint and the Argument LP Constraint. Our LP constraints presents a solution to the problems of the previous analyses such as Kuno's (1980) Crossing-Over Constraint. The newly postulated type marker enables us to account for the scrambling possibilities of the NPs containing cases as well as postpositions and delimiters.

  • PDF

A study of e-passport against forgeries using scrambling encryption method (스크램블링 암호화 기법을 이용한 전자신분증 위변조 방지 기법)

  • Lee, Kwang-Hyoung;Jung, Young-Hoon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.13 no.2
    • /
    • pp.849-855
    • /
    • 2012
  • In this paper, a proposed system can be ensured safety using scrambling technique in order to protect personal information which identifies visually from the existing e-passport. This system inserts ID card number and photograph into e-passport using scrambling technique. In this system, we need user private key and CA private key to encrypt and decrypt which make it secure. And It show better performance in throughput by not encrypting or decrypting the whole e-passport.

Reducing peak-to-average-power-ratio for OFDM system by using complementary code scrambling (Complementary Code Scrambling을 이용한 OFDM 시스템의 Peak-to-Average-Power-Ratio 감소 방안)

  • 권기범;오성근
    • Proceedings of the IEEK Conference
    • /
    • 1998.10a
    • /
    • pp.191-194
    • /
    • 1998
  • 본 논문에서는 OFDM 시스템에서 사용되는 부 반송파의 수와 동일한 길이의 complementary code를 사용하여 각 부 반송파 데이터를 frequency 영역에서 scrambling하는 PAPR 감소 방안을 제안한다. 이 방법은 부 반송파의 수와 동일한 길이의 complementary code 집합을 이용하여 주어진 데이터에 부과해서 PAPR 값이 가장 적은 complementary code를 사용하여 scrambled된 데이터를 송신함으로서 PAPR 값을 감소시키는 방법이다. 수신기에서의 복호를 위하여 Nc개의 complementary code에 해당하는 log2Nc 비트의 code 인덱스를 데이터와 함께 전송한다. 이때 code 인덱스 비트가 PAPR 값에 영향을 주지 않도록 하기 위하여 CODE인덱스와 데이터가 함께 complementary code로 scrambling되어진다. 제안된 이 방법을 사용하면 주파수 대역효율을 높이면서 PAPR 값을 크게 줄일 수 있다.

  • PDF