• Title/Summary/Keyword: Scrambling Code

Search Result 37, Processing Time 0.019 seconds

A Suitable Cell Search Algorithm Using Separated I/Q Channel Cell Specific Scrambling Codes for Systems with Coexisting Cellular and Hot-Spot Cells in Broadband OFCDM Systems (광대역 OFCDM 시스템에서 셀룰러와 핫-스팟 셀들이 공존할 때 분리 I/Q채널 CSSC를 이용한 셀 탐색 알고리즘)

  • Kim Dae-Yong;Kwon Hyeog-Soong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.8
    • /
    • pp.1649-1655
    • /
    • 2005
  • For systems with coexisting cellular and hot-spot cells in broadband orhogonal frequency and code division multiplexing (OFCDM) systems, a suitable cell search algorithm is proposed fur the common pilot channel (CPICH) in the forward link using separated I/Q channel cell specific codes(CSSC), in which the cellular cell specific scrambling code (CCSSC) is assigned to the in-phase (Q) pilot channel of all cellular cells, and the exclusive hot-spot cell specific scrambling code (HSCSSC) group is assigned to the quadrature (Q) pilot channel of all hot-spot cells. Therefore, the proposed algorithm enables a mobile station (MS) to search quickly for the most desirable hot-spot cell due to reducing the effect of CCSSC, when a MS wants to use a mobile internet. The computer simulation results show that the proposed cell search algorithm can achieve faster cell search time performance, compared to conventional cell search methods.

A Study on the Hangul Character Code System for KS X 1001 Information Interchange considering AMI/HDB-3 Line Encoding and HDLC Flag (AMI/HDB-3 회선부호화 및 HDLC FLAG를 고려한 KS X 1001 정보교환용 한글낱자 부호체계 개선연구)

  • Woo, Je-Teak;Hong, Wan-Pyo
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.10 no.1
    • /
    • pp.65-72
    • /
    • 2015
  • AMI / HDB-3 method used a scrambling technique is used primarily for long distance data transmission line encoding. In this paper, information communication code standard (KS X 1001; 2014 confirmation), as defined in Hangul Character Code HDLC Flag bit or character stuffing at the data link layer and physical layer with respect to the code set for Hangul AMI / HDB-3 the code set for the new system to increase the data transmission efficiency Hangul consonant and vowel tables presented in terms of scrambling. The result of the existing system and the code set ($4{\times}4$) bit source coding rules for comparing the frequency of use Hangul consonant and vowel tables and statistics showed that about 22.01% of the data processing efficiency is improved.

Scrambling Occurrence Frequency in HDB-3 in UTF-8 Coding of UNICODE Hangul Jamo (Unicode 한글낱자의 UTF-8 부호화에 따른 HDB-3 스크램블링 발생빈도)

  • Hong, Wan-Pyo
    • Journal of Advanced Navigation Technology
    • /
    • v.19 no.2
    • /
    • pp.153-160
    • /
    • 2015
  • This paper has studied about the scrambling occurrence frequency in UTF-8 coding system for Unicode Hangul Jamo codes. The scrambling methode applied in the study is HDB-3 in AMI line coding that is international transmission standard. In the study, the source coding rule was applied to analysis the scrambling occurrence. The quantity of the scrambling occurrence was calculated by the number of times and frequency rate of the scrambling occurrence in Hangul Jamo and Compatibity Hangul Jamo. In the case of Hangul Jamo, the number of times and frequency rate in Unicode and UTF-8 were 24times, 52% and 148times, 228% respectively. In the case of Compatibility Hangul Jamo, that were 10times, 14% and 83times, 131% respectively. As a result, when Hangul Jamo and Compatibility Hangul Jamo in UNICODE were transformed to UTF-8, the scrambling frequency rates were increased 340% and 851% respectively.

PROMISE: A QR Code PROjection Matrix Based Framework for Information Hiding Using Image SEgmentation

  • Yixiang Fang;Kai Tu;Kai Wu;Yi Peng;Yunqing Shi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.2
    • /
    • pp.471-485
    • /
    • 2023
  • As data sharing increases explosively, such information encoded in QR code is completely public as private messages are not securely protected. This paper proposes a new 'PROMISE' framework for hiding information based on the QR code projection matrix by using image segmentation without modifying the essential QR code characteristics. Projection matrix mapping, matrix scrambling, fusion image segmentation and steganography with SEL(secret embedding logic) are part of the PROMISE framework. The QR code could be mapped to determine the segmentation site of the fusion image as a binary information matrix. To further protect the site information, matrix scrambling could be adopted after the mapping phase. Image segmentation is then performed on the fusion image and the SEL module is applied to embed the secret message into the fusion image. Matrix transformation and SEL parameters should be uploaded to the server as the secret key for authorized users to decode the private message. And it was possible to further obtain the private message hidden by the framework we proposed. Experimental findings show that when compared to some traditional information hiding methods, better anti-detection performance, greater secret key space and lower complexity could be obtained in our work.

Efficient Usage of Secondary Scramble Code via Optical Repeater in W-CDMA System (W-CDMA 시스템에서 광중계기를 이용한 secondary-스크램블 코드의 효율적 활용방안에 대한 연구)

  • Jeon, Eun-Sung;Park, Jun-Hyo;Yang, Jang-Hoon;Kim, Dong-Ku
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.8C
    • /
    • pp.731-741
    • /
    • 2009
  • Optical repeater is often installed at the isolated area. Spatial separation makes it possible to reduce the inter-code interference when secondary scrambling codes are used for traffic connected through repeater. In this paper, we propose five secondary scrambling code usage scenarios with the aids of optical repeater to maximize the user capacity. In order to evaluate the performance, dynamic system level simulation is performed. We also propose a base station-repeater switching where each active users can change access points by comparing the channel condition from base station and repeater thorough secondary common pilot channel (S-CPICH) signal to noise-interference ratio (SINR). Moreover, primary-secondary scramble code replacing scheme is proposed which replaces secondary scramble code with primary scramble code when a call using primary scramble code is ended and its corresponding OVSF code is available to users using the secondary scramble code

A Cell Search with Reduced Complexity in a Mobile Station of OFCDM Systems (OFCDM 시스템의 이동국에서의 복잡도 감소 셀 탐색)

  • Kim, Dae-Yong;Park, Yong-Wan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.1
    • /
    • pp.139-149
    • /
    • 2007
  • Asynchronous OFCDM(Orthogonal Frequency and Code Division Multiplexing) systems must have a cell search process necessarily unlike synch개nous systems. this process is hewn initial synchronization and a three-step cell search algorithm is performed for the initial synchronization in the following three steps: OFCDM symbol timing, i.e., Fast Fourier Transform(FFT) window timing is estimated employing guard interval (GI) correlation in the first step, then the frame timing and CSSC(Cell Specific Scrambling Code) group is detected by taking the correlation of the CPICH(Common Pilot Channel) based on the property yielded by shifting the CSSC phase in the frequency domain. Finally, the CSSC phase within the group is identified in the third step. This paper proposes a modification group code with two or three block of the conventional CPICH based cell search algorithm in the second step which offers MS(Mobile Station) complexity reductions. however, the effect of the reduction complexity leads to degradation of the performance therefore, look for combination to have the most minimum degradation. the proposed block type group code with suitable combinations is the nearly sane performance as conventional group code and has a complexity reduction that is to be compared and verified through the computer simulation.

Application of Correlation-Aided DSA(CDSA) Technique to Fast Cell Search in IMT-2000 W-CDMA Systems.

  • Kim, Byoung-Hoon;Jeong, Byeong-Kook;Lee, Byeong-Gi
    • Journal of Communications and Networks
    • /
    • v.2 no.1
    • /
    • pp.58-68
    • /
    • 2000
  • In this paper we introduce the correlation-aided distributed sample acquisition (CDSA) scheme for fast cell search in IMT-2000 W-CDMA cellular system. The proposed scheme incorporates the state symbol correlation process into the comparison-correction based synchronization process of the original DSA scheme to enable fast acquisition even under very poor channel environment. for its realization, each mobile station (MS) has to store in its memory a set of state sample sequences. which are determined by the long-period scrambling sequences used in the system and the sampling interval of the state samples. CDSA based cell search is carried out in two stages : First, the MS first acquires the slot timing by using the primary synch code (PSC) and then identifies the igniter code which conveys the state samples of the current cell . Secondly. the MS identifies the scrambling code and frame timing by taking the comparison-correction based synchronization approach and, if the identification is not done satisfactorily within preset time. it initiates the state symbol correlation process which correlates the received symbol sequence with the pre-stored state sample sequences for a successful identification. As the state symbol SNR is relatively high. the state symbol correlation process enables reliable synchronization even in very low chip-SNR environment. Simulation results show that the proposed CDSA scheme outperforms the 3GPP 3-step approach, requiring the signal power of about 7 dB less for achieving the same acquisition time performance in low-SNR environments. Furthermore, it turns out very robust in the typical synchronization environment where large frequency offset exists.

  • PDF

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.

A Minimum-Bandwidth Line Code for Low-Pass Channels (저역 통과 선로를 위한 최소 대역폭 선로부로)

  • 김대영;김재균
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.20 no.5
    • /
    • pp.23-30
    • /
    • 1983
  • A new runlength-limited minimum-bandwidth line code is designed by modifying the duobinary code. Since the new code is runlength limited, the need for a data scrambling before transmission is eliminated. The eye width and the error probability of the new code are shown to be almost the same as those of the duobinary code. Also, the power spectral shape is scarcely changed, so that the new code is suitable for such low-pass channels as optical fibers.

  • PDF

A Study on Initial Cell Search Parameters in UMTS Terminal Modem (UMTS 단말기 모뎀의 초기 셀 탐색 파라미터의 영향에 대한 연구)

  • 류동렬;김용석;옥광만;최형진
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.5A
    • /
    • pp.267-275
    • /
    • 2003
  • In UMTS terminal modem uses 3 step search procedure for initial cell search, which comprises 1) slot synchronization, 2) code group identification and frame synchronization, and 3) scrambling-code identification. The performance of initial cell search procedure depends on search parameters like observation time and threshold. The purpose of this paper is to get the optimal observation time and threshold of each step for minimum mean acquisition time. In this paper we induce mean detection time of each step and mean acquisition timefrom the model of 3 step search procedure using state diagram. Also we propose initial cell search algorithm which utilize window search method against initial oscillator error, and select an appropriate observation time and threshold of each step by the analysis of simulation and induced result. It is shown that the mean acquisition time in multipath fading channel can be shorter than 500ms by using the determined observation time and threshold of each step.