• Title/Summary/Keyword: Binary CDMA Communication

Search Result 44, Processing Time 0.026 seconds

Ideal Model for Radio communication system against Disasters (통합지휘무선통신 최적 통신시스템 모델)

  • Hong, Wan-Pyo;Oh, Kab-Kuen
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.5 no.3
    • /
    • pp.294-303
    • /
    • 2010
  • Radiocommunication systems is very useful method to configure the unified command communication system in case of the disasters. Currently Korea's radiocommunication network against the disasters is operating with TETRA system. This system is very powerful with multifunction to apply in the disaster situation. However, Korea's disaster radiocommunication system is so important to keep and maintain survivability. Therefore this paper study on the alternate systems to TETRA system.

A class of multi-level spreading codes with enhanced ZCD property

  • Cha, Jae-sang
    • Proceedings of the IEEK Conference
    • /
    • 2002.07c
    • /
    • pp.1705-1708
    • /
    • 2002
  • Spreading codes with ZCD(zero-correlation duration) property have the MAI(multiple access interference) rejection ability in the CDMA systems. A class of multi-level spreading codes, i.e., Zero padded ternary ZCD codes are introduced in this paper. By the selected zero-padding method to the binary ZCD codes, ternary ZCD codes are generated and they have enhanced ZCD property and family size than the binary ZCD codes.

  • PDF

A Class of Binary Cocyclic Quasi-Jacket Block Matrices

  • Lee Moon-Ho;Pokhrel Subash Shree;Choi Seung-Je;Kim Chang-Joo
    • Journal of electromagnetic engineering and science
    • /
    • v.7 no.1
    • /
    • pp.28-34
    • /
    • 2007
  • In this paper, we present a quasi-Jacket block matrices over binary matrices which all are belong to a class of cocyclic matrices is the same as the Hadamard case and are useful in digital signal processing, CDMA, and coded modulation. Based on circular permutation matrix(CPM) cocyclic quasi block low-density matrix is introduced in this paper which is useful in coding theory. Additionally, we show that the fast algorithm of quasi-Jacket block matrix.

Error Detection of Phase Offsets for Binary Sequences (이원부호의 위상오프셋 오류 검출)

  • Song, Young-Joon;Han, Young-Yearl
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.36S no.9
    • /
    • pp.27-35
    • /
    • 1999
  • In this paper, we propose an error detection scheme of phase offsets for binary sequences including PN (Pseudo Noise) sequences based on the number theoretical approach. It is important to know phase offsets of spreading sequences in the CDMA (Code Division Multiple Access) mobile communication systems because phase offsets of the same spreading sequence are used to achieve the acquisition and are used to distinguish each base station. When the period of the sequence is not very long, the relative phase offset between the sequence and its shifted replica can be found by comparing them, but as the period of the sequence increases it becomes difficult to find the phase offset. The error detection failure probability of the proposed method is derived, and it is confirmed by the simulation results. We also discuss the circuit realization of the proposed method and show it can be easily implemented.

  • PDF

New Construction of Quaternary Low Correlation Zone Sequence Sets from Binary Low Correlation Zone Sequence Sets

  • Jang, Ji-Woong;Kim, Sang-Hyo;No, Jong-Seon
    • Journal of Communications and Networks
    • /
    • v.12 no.4
    • /
    • pp.330-333
    • /
    • 2010
  • In this paper, using binary (N, M, L, $\epsilon$) low correlation zone (LCZ) sequence sets, we construct new quaternary LCZ sequence sets with parameters (2N, 2M, L, $2{\epsilon}$). Binary LCZ sequences for the construction should have period $N\;{\equiv}\;3$ mod 4, L|N, and the balance property. The proposed method corresponds to a quaternary extension of the extended construction of binary LCZ sequence sets proposed by Kim, Jang, No, and Chung [1].

M-ary orthogonal CDMA Using Time Hopping Codes (시간도약부호를 사용하는 M진직교 부호분할 다원접속)

  • 김일규;김동인;노종선
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.7
    • /
    • pp.1374-1389
    • /
    • 1994
  • In this paper, a novel M-ary orthogonal CDMA scheme which utilizes time hopping codes and binary orthogonal sequences is proposed for personal communication system. Its modulated output signal has the characteristics of greater bandwidth occupancy and lower spectral density level as well. So this scheme is useful for spectrum overlay with existing narrowband communication systems which occupy current radio frequency channels. This paper investigates system characteristics through the analysis of modulated output signal power spectrum, and demonstrates the possibility of spectrum overlay.

  • PDF

Reverse link rate control for high-speed wireless systems based on traffic load prediction (고속 무선통신 시스템에서 트래픽 부하 예측에 의한 역방향 전송속도 제어)

  • Yeo, Woon-Young
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.11
    • /
    • pp.15-22
    • /
    • 2008
  • The cdma2000 1xEV-DO system controls the data rates of mobile terminals based on a binary overload indicator from the base station and a simple probabilistic model. However, this control scheme has difficulty in predicting the future behavior of mobile terminals due to a probabilistic uncertainty and has no reliable means of suppressing the traffic overload, which may result in performance degradation of CDMA systems that have interference-limited capacity. This Paper proposes a new traffic control scheme that controls the data rates of mobile terminals effectively by predicting the future traffic load and adjusting the forward-link control channel. The proposed scheme is analyzed by modeling it as a multi-dimensional Markov process and compared with conventional schemes. The numerical results show that the maximum cell throughput of the proposed scheme is much higher than those of the conventional schemes.

A Fast Cell Search Algorithm using Code Position Modulation within code block in Asynchronous W-CDMA System (비동기 W-CDMA 시스템을 위한 코드블럭 내의 코드위치변조를 이용한 고속 셀 탐색 알고리즘)

  • 최정현;김낙명
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.5A
    • /
    • pp.611-617
    • /
    • 2000
  • Asynchronous mode W-CDMA system is kmown to be quite appropriate to the next generation mobile communication system, especially in a non-homogenious cellular architecture. In this case, however, each base station needs to use different spreading code for identification, so it is a demeanding task for a mobile terminal to find the best cell site and get an accurate code synchronization at the beginning of a communication. Since slow acquisition of a base station could mean the failure of initiation, a fast algorithm to accelerate the cell search process is essential. In this paper, a new cell search algorithm based on the binary code position modulation within the code block is proposed. Different cell sites are identified by different hopping code sequences, andeach position modulation is performed by the hopping code. The proposed algorithm is proved to make the cell search time in most places in a cell much shorter than the previous algorithms, and to make the receiver implementation simpler.

  • PDF