• Title/Summary/Keyword: scrambling sequence

Search Result 15, Processing Time 0.02 seconds

Estimation of Physical Layer Scrambling Code Sequence of DVB-S2

  • Wu, Hao;Xie, Hui;Huang, Zhi-Tao;Zhou, Yi-Yu
    • ETRI Journal
    • /
    • v.36 no.2
    • /
    • pp.329-332
    • /
    • 2014
  • In this letter, the problem of estimating the physical layer (PL) scrambling code sequence of DVB-S2 is studied. We present the first ever scheme to estimate the scrambling sequence. The scheme is based on hypothesis testing. By analyzing the PL scrambling process, we construct a new sequence equivalent to the scrambling sequence. We then use hypothesis testing to estimate the new sequence. The threshold for the hypothesis testing is also discussed. The experiment results show that the performance of our estimation scheme can work even under high BER.

A Study on the PAPR Reduction by Hybrid Algorithm Based on the PTS and GS Technique

  • Zhao Zi-Bin;Kim Young-Hwan;Kim Jae-Moung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.2A
    • /
    • pp.187-193
    • /
    • 2006
  • Multicarrier systems has major shortcomings due to the large numbers of subcarrier. One of the shortcomings is the high peak-to-average power ratio(PAPR), which causes nonlinearity distortion in the transmitter, and degrades the performance of the system significantly. Partial transmit sequence(PTS) is one of the best approaches that can significantly improve the statistics of the PAPR of an orthogonal frequency division multiplexing(OFDM) signal. Guided scrambling(GS) is an extension of self-synchronizing scrambling. It is also capable of guiding the scrambling process to produce a balanced encoded bit stream. In this paper, we propose a sub-optimal algorithm to optimize the phase factor in PTS. In addition, we integrate GS coding with this method. The proposed Hybrid algorithm can get much more PAPR reduction at the expense of incur a few error extension and do not require transmission of side information.

Composition Rule of Character Codes to efficiently transmit in HDLC Protocol with HDB-3 Scrambling (HDB-3 스크램블링과 HDLC 프로토콜에서 효율적 문자부호 전송을 위한 문자부호 작성 규칙)

  • Hong, Wan-Pyo
    • Journal of Advanced Navigation Technology
    • /
    • v.16 no.5
    • /
    • pp.831-838
    • /
    • 2012
  • In the transmission system, the transmission efficiency can be increased by applying the proper character coding method. This paper is to show the character coding rule in computer and information equipment etc to improve the transmission efficiency in datacommunications. The character coding rule showing in this paper was suggested by considering the two view points. First one is FLAG bits in HDLC and PPP protocol on datalink layer in OSI 7 layer. Second one is one of the scrambling method, HDB-3, on physical layer in OSI 7 layer. The former is to prevent the sequence of over 5bits of "1" in the character codes. The latter is to prevent the sequence of over 4bits of "0" in the character codes.

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.

Improvement of Image Scrambling Scheme Using DPSS(Discrete Prolate Spheroidal Sequence) and Digital Watermarking Application (DPSS(Discrete Prolate Spheroidal Sequence)를 이용한 영상 스크램블링 방식의 개선 및 디지털 워터마킹 응용)

  • Lee, Hye-Joo;Nam, Je-Ho
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.11
    • /
    • pp.1417-1426
    • /
    • 2007
  • As one of schemes to protect multimedia content. it is the selective encryption scheme to encrypt partially multimedia content. Compared AES(advanced encryption standard) of traditional encryption, the selective encryption scheme provides low security but is applicable to applications of multimedia content not to require high secrecy. In this paper, we improve the image scrambling scheme proposed by Van De Ville which scrambles an image without bandwidth expansion using DPSS(discrete prolate spheroidal sequence) to make it more secure based on Shujun's research which verifies the secrecy of Van De Ville's scheme. The proposed method utilizes an orthonormalized random matrix instead of Hadamard matrix for secret matrix and to add it for providing high secrecy against statistical attack or known-plaintext attack using some statistical property or estimate of secret matrix from a scrambled image. The experimental results show that the proposed method is more secure than the existing scheme. In addition, we show that the proposed method can be applied to access control or copy control of watermarking application.

  • PDF

Peformance Analysis of a Pre-Scrambling Scheme for Reducing the PAPR in OFDM Systems (OFDM 시스템에서 PAPR의 감소를 위한 사전-스크램블링 기법의 성능분석)

  • 최광돈;김시철;박상규
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.5A
    • /
    • pp.521-526
    • /
    • 2004
  • OFDM is a very attractive technique for achieving high-bit-rate data transmission and high spectrum efficiency. However, one of disadvantages of OFDM signal is the high PAPR characteristic when multi-carriers are added up coherently. In this Paper, we propose-scrambling scheme using correlator for PAPR reduction and reducing the amount of PAPR calculations. The simulation results show that this scheme has less computational complexity and reasonable PAPR reduction capability compared to PTS technique.

Application of quasi-Monte Carlo methods in multi-asset option pricing (준난수 몬테칼로 방법을 이용한 다중자산 옵션 가격의 추정)

  • Mo, Eun Bi;Park, Chongsun
    • Journal of the Korean Data and Information Science Society
    • /
    • v.24 no.4
    • /
    • pp.669-677
    • /
    • 2013
  • Quasi-Monte Carlo method is known to have lower convergence rate than the standard Monte Carlo method. Quasi-Monte Carlo methods are using low discrepancy sequences as quasi-random numbers. They include Halton sequence, Faure sequence, and Sobol sequence. In this article, we compared standard Monte Carlo method, quasi-Monte Carlo methods and three scrambling methods of Owen, Faure-Tezuka, Owen-Faure-Tezuka in valuation of multi-asset European call option through simulations. Moro inversion method is used in generating random numbers from normal distribution. It has been shown that three scrambling methods are superior in estimating option prices regardless of the number of assets, volatility, and correlations between assets. However, there are no big differences between them.

A MaxMin Model for the Worst Case Performance Evaluation of GS Coding for DC-free Modulation (DC-억압 변조를 위한 GS 코딩의 최악 성능 평가 MaxMin 모형)

  • Park, Taehyung;Lee, Jaejin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38A no.8
    • /
    • pp.644-649
    • /
    • 2013
  • For effective DC-free coding in the optical storage systems, the Guided Scrambling algorithm is widely used. To reduce digital discrepancy of the coded sequence, functions of digital sum value (DSV) are used as criteria to choose the best candidate. Among these criteria, the minimum digital sum value (MDSV), minium squared weight (MSW), and minimum threshold overrun (MTO) are popular methods for effective DC-suppression. In this paper, we formulate integer programming models that are equivalent to MDSV, MSW, and MTO GS coding. Incorporating the MDSV integer programming model in MaxMin setting, we develop an integer programming model that computes the worst case MDSV bound given scrambling polynomial and control bit size. In the simulation, we compared the worst case MDSV bound for different scrambling polynomial and control bit sizes. We find that careful selection of scrambling polynomial and control bit size are important factor to guarantee the worst case MDSV performance.

Quantized DCT Coefficient Category Address Encryption for JPEG Image

  • Li, Shanshan;Zhang, Yuanyuan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.4
    • /
    • pp.1790-1806
    • /
    • 2016
  • Digital image encryption is widely used for image data security. JPEG standard compresses image with great performance on reducing file size. Thus, to encrypt an image in JPEG format we should keep the quality of original image and reduced size. This paper proposes a JPEG image encryption scheme based on quantized DC and non-zero AC coefficients inner category scrambling. Instead of coefficient value encryption, the address of coefficient is encrypted to get the address of cipher text. Then 8*8 blocks are shuffled. Chaotic iteration is employed to generate chaotic sequences for address scrambling and block shuffling. Analysis of simulation shows the proposed scheme is resistant to common attacks. Moreover, the proposed method keeps the file size of the encrypted image in an acceptable range compared with the plain text. To enlarge the cipher text possible space and improve the resistance to sophisticated attacks, several additional procedures are further developed. Contrast experiments verify these procedures can refine the proposed scheme and achieve significant improvements.

High Speed Implementation of HomePNA 2.0 Frame Processor (HomePNA 2.0 프레임 프로세서의 고속 구현 기법)

  • 강민수;이원철;신요안
    • Proceedings of the IEEK Conference
    • /
    • 2003.07a
    • /
    • pp.533-536
    • /
    • 2003
  • 본 논문에서는 전화선을 이용한 고속 홈네트워크인 HomePNA 2.0 시스템에서 HomePNA 2.0 (H2) 프레임을 만들기 위한 프레임 프로세싱 중, 다항식 나누기 연산을 통한 CRC (Cyclic Redundancy Check) 16비트 생성, HCS (Header Check Sequence) 8비트 생성 및 혼화(Scrambling) 처리에 있어서 입력 8 비트를 동시에 병렬 처리함으로써 기존의 1 비트 입력을 LFSR (Linear Feedback Shift Register)를 사용한 다항식 나누기 연산을 수행했을 때보다 빠른 속도로 H2 프레임을 구현하고자 하는 고속 처리 기법을 제시하고 이의 성능을 검증하였다.

  • PDF