• Title/Summary/Keyword: Frequency-Hopping Patterns

Search Result 8, Processing Time 0.018 seconds

A NEW FAMILY OF FREQUENCY HOPPING PATTERNS WITH GOOD HAMMING AUTOCORRELATION AND CROSSCORRELATION (우수한 해밍 자기상관성 및 타 상관성을 갖는 새로운 주파수 도약 패턴 군)

  • 노종선
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.18 no.11
    • /
    • pp.1735-1741
    • /
    • 1993
  • New family of frequency hopping patterns with long period and good Hamming autocorrelation and Hamming crosscorrelation properties which can be used for frequency hopped multiple access communication systems is introduced. Period of frequency hopping patterns is qk-1, the alphabet size of frequency hopping patterns is q, and the size of family of frequency hopping patterns is q, where k is arbitrary integer and q is power of prime number. The maximum value of out-of-Phase Hamming autocorrelation function of any frequency hopping pattern and Hamming crosscorrelation function of any two frequency hopping patterns in the family is qk-1, which corresponds to optima1 Hamming correlation properties. And the average number of hits per q*q square in one frequency hopping pattern and its time shifted version or two frequency hopping patterns in the frequency hopped multiple access communication systems is less than 1.

  • PDF

Methods of generating Hopping Patterns Based on Permutation Frequency Hopping SSMA System (치환방법을 이용한 주파수 도약 확산 시스템의 주파수 도약 패턴 발생 방법)

  • Choon Sik YIM;Ryuji KOHNO;Hideki IMAI
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.16 no.12
    • /
    • pp.1357-1365
    • /
    • 1991
  • This paper proposes the generation of several classes of frequency hopping patterns. which are derived by permutation, for an asynchronous frequency hopping spread spectrum multiple accecss system (FH/SSMA). The first class of hopping patterns is obtained by using a Latin square. The second class of hopping patterns is derived by generalizing the first class which is designed by using a permutation technique. The third class of hopping patterns is designed by using a rotational base of elements. We evaluate the hit property of the proposed classes of hopping patterns when these patterns are nutually shifted in an FH/SSMA system. Compared to the Reed Slolmon sequences generated by the conventional method, the sequence obtained by the permutation technique can reduce the number of hits among hopping frequencies in asynchronous time/frequency shift.

  • PDF

High speed matched filter synchronization circuit applied in frequency hopping FSK Transceiver (주파수도약 대역 확산 FSK 수신기의 고속 정합여파기 동기회로)

  • Kim, Seong-Cheol
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.8
    • /
    • pp.1543-1548
    • /
    • 2009
  • In this paper, a high speed code synchronization circuit is proposed. for fast code synchronization, matched filler method is used for initial code acquisition with two channel correlators. Particular frequency patterns of the limited number having the information about PN code start time are composed and transmitted repeatedly to increase the probability of accurate initial synchronization. And digital frequency synthesizer is proposed. And it's performance is analyzed theoretically. The analysis show that fast frequency hopping is possible in frequency hopping system that use digital frequency synthesizer.

A Study on the Generating Algorithm and the Correlation Function of Kumar Code Sequences for the Frequency Hopping Patterns (주파수 경로 패턴을 위한 Kumar 부호계열 발생 알고리즘 및 상관함수 특성에 관한 연구)

  • 이정재;한영렬
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.12
    • /
    • pp.1886-1902
    • /
    • 1989
  • In this paper we discuss the generating algorithm of Kumar code sequences which are based on generalized bent sequences for FH-CDMA. The code sequence generator was constructed for the shift register stages n=4 over GF (5). Finally we analyze the characteristics fo Hamming correlation between two code sequences and the time-frequency correlatins of the complete waveform with the sinusoidal chips as the elemental waveforms.

  • PDF

Frequency and Subcarrier Reuse Partitioning for FH-OFDMA Cellular Systems

  • Lee, Yeonwoo;Kim, Kyung-Ho
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.5
    • /
    • pp.601-609
    • /
    • 2013
  • One of the most serious factors constraining the next generation cellular mobile consumer communication systems will be the severe co-channel interference experienced at the cell edge. Such a capacity-degrading impairment combined with the limited available spectrum resource makes it essential to develop more spectrally efficient solutions to enhance the system performance and enrich the mobile user's application services. This paper proposes a unique hybrid method of frequency hopping (FH) and subcarrier-reuse-partitioning that can maximize the system capacity by efficiently utilizing the available spectrum while at the same time reduce the co-channel interference effect. The main feature of the proposed method is that it applies an optimal combination of different frequency reuse factors (FRF) and FH-subcarrier allocation patterns into the partitioned cell regions. From the simulation results, it is shown that the proposed method can achieve the optimum number of subcarrier subsets according to the frequency-reuse distance and results in better performance than the fixed FRF methods, for a given partitioning arrangement. The results are presented in the context of both blocking probability and BER performances. It will also be shown how the proposed scheme is well suited to FH-OFDMA based cellular systems aiming at low co-channel interference performance and optimized number of subcarriers.

A Study on the Performance Improvement of Trellis Coded Orthogonal MC/FH-CDMA System in Wireless Channel (무선 통신로에서 Trellis Coded Orthogonal MC/FH-CDMA 시스템의 성능 개선에 관한 연구)

  • Lee, Moon Seung
    • Journal of Advanced Navigation Technology
    • /
    • v.5 no.1
    • /
    • pp.11-18
    • /
    • 2001
  • In this paper, we evaluated the performance of Orthogonal MC/FH-CDMA system considering the hit of frequency hopping patterns, and obtained the degree of the performance improvement by adopting TCM scheme under frequency selective Rayleigh fading channel. From the performance analysis, it is known that the error performance is improved, since delay time relative to symbol time is reduced as the number of carrier is increased. On the other hand, it is found that BER performance is improved about $5{\times}10^{-2}$ degree by adopting TCM scheme, and higher S/N is required if the QoS of voice (BER = $10^{-3}$) must be achieved.

  • PDF

Maritime Wireless Data Communications of Predictive Frequency Hopping Technique

  • Bae, Sang-Hyun;Lee, Kwang-Ok;Jang, Bong-Seog
    • Journal of Integrative Natural Science
    • /
    • v.5 no.3
    • /
    • pp.182-185
    • /
    • 2012
  • In this paper, For 4th generation wireless communication systems, we propose a method to predict FH patterns in FH-OFDMA systems. OFDM is recognized as a promising modulation technique. Multi-user allocation in OFDM system can use FH that provides the spectrum-spread techniques. If one can generate more predictable FH sequences, then performance of the system can be easily improved. Current random FH and simple adaptive FH methods, however, are not considering predicting FH sequences. In this paper we show that the sampling of the wireless faded signal is not realized as a certain probability nature. With this regard, the proposed predictive FH allocation method is designed to embed the unknown probability models. Simulation study shows that the predictive FH method is more accurately predict FH sequences than the random or simple adaptive FH methods. We will further improve this proposed method to apply QoS control and MAC function development in OFDMA based wireless physical structures, especially maritime wireless data communications.

Linear Complexities of Sequences over Unknown Symbol Sets and Constructions of Sequences over CF($p^k$) whose Characteristic Polynomials are over GF($p^{k}$ ) (임의의 심볼 집합 상의 수열의 선형복잡도와 GF(p)상의 특성다항식을 갖는 GF($p^k$)상의 수열 생성에 관한 연구)

  • Hong, Yun-Pyo;Eun, Yu-Chang;Kim, Jeong-Heon;Song, Hong-Yeop
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.5C
    • /
    • pp.443-451
    • /
    • 2003
  • We propose an appropriate approach of defining the linear complexities (LC) of sequences over unknown symbol set. We are able to characterize those p-ary sequences whose R-tuple versions now eve. GF($p^{R}$ ) have the same characteristic polynomial as the original with respect to any basis. This leads to a construction of $p^{R}$ -ary sequences whose characteristic polynomial is essentially over GF(p). In addition, we can characterize those $p^{R}$ -ary sequences whose characteristic polynomials are uniquely determined when symbols are represented as R-tuples over GF(p) with respect to any basis.