• Title/Summary/Keyword: M-sequence code

Search Result 88, Processing Time 0.022 seconds

A Study of the Interference-Cancelled CDMA System Using Binary ZCD Spreading Codes (이진 ZCD확산코드를 이용한 저간섭 CDMA시스템에 관한 연구)

  • 차재상
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.18 no.4
    • /
    • pp.149-154
    • /
    • 2004
  • In this paper, Interference-Cancelled CDMA system using binary ZCD spreading codes is introduced. Proposed Interference-Cancelled CDMA system can be usefully used for the intra-cellular Interference-Cancelled wireless communication systems. Binary ZCD spreading code sets have various sequence period and family sizes and the ZCD properties of them are very effective for Interference-cancelled CDMA Systems. In this paper, we mathematically analyzed the system performance of our proposed Interference-Cancelled CDMA system in the AWGN channel and various interference environments such as MAI and MPI. Furthermore, using the BER performance simulation we certify the available interference cancellation properties of the proposed system.

RASE Acquisition Algorithm of Ultra Wideband System for Car Positioning and Traffic Light Control (차량 위치추적기반 교통신호등 제어용 UWB 시스템의 Acquisition 알고리즘 연구)

  • Hwang, In-Kwan;Park, Yun-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.10C
    • /
    • pp.992-998
    • /
    • 2005
  • In this paper, An Ultra Fast Acquisition Algorithm of low transmission rate ultra-wideband(UWB) systems for car positioning and traffic light controling is proposed. Since the acquisition algorithms for CDMA system are not fast enough to access the low transmission rate UWB systems, the new ultra fast acquisition scheme which can be implemented with low cost and simplified circuit is required. The proposed algorithm adopted the Recurrent Sequential Estimation scheme and trinomial M-sequence. Therefore, The proposed scheme can reduce the average acquisition time in $1\~3{\mu}sec$ with simple circuit, even for the UWB systems which use long pseudo-noise(PN) sequence and transmit low power below the FCC EIRP emission limits. The simulation results for the average acquisition time of the proposed scheme are compared with the ones of the existing acquisition schemes.

Performance Evaluation of the M-algorithm for Decoding Convolutional Codes (M-알고리듬을 이용한 컨벌루셔널 부호의 복호 성능 평가)

  • 천진영;최규호;성원진
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.3A
    • /
    • pp.188-195
    • /
    • 2002
  • The M-algorithm for decoding convolutional codes can significantly reduce the complexity of the Viterbi algorithm by tracking a fixed number of survivor paths in each level of the decoding trellis. It is an easily-implementable algorithm suited for real-time processing of high-speed data. The algorithm, however, generates a sequence of catastrophic errors when the correct path is not included in the set of survivor paths. In this paper, the performance of the M-algorithm obtained from using various decoding complexity levels, frame lengths, and code constraint lengths is presented. The performance gain is quantified when the algorithm is used in conjunction with codes of increased constraint length. In particular, it is demonstrated the gain from the increased code free distance overcompensates the loss from the correct path being excluded from the survivors, when the frame length is short to moderate. Using 64 survivor paths, the signal-to-noise ratio gain obtained by increasing the constraint length from K=7 to K=9, 11, 15 is respectively 0.6, 0.75, and 08dB, when the frame of length L=100 has the frame error rate of 0.01%.

Analysis of Cross-Correlation of m-sequences and Equation on Finite Fields (유한체상의 방정식과 m-수열의 상호상관관계 분석)

  • Choi, Un-Sook;Cho, Sung-Jin
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.7 no.4
    • /
    • pp.821-826
    • /
    • 2012
  • p-ary sequences of period $N=2^k-1$ are widely used in many areas of engineering and sciences. Some well-known applications include coding theory, code-division multiple-access (CDMA) communications, and stream cipher systems. The analysis of cross-correlations of these sequences is a very important problem in p-ary sequences research. In this paper, we analyze cross-correlations of p-ary sequences which is associated with the equation $(x+1)^d=x^d+1$ over finite fields.

The evolution of merger fraction for galaxies in NEP-Wide field

  • Kim, Eunbin;Jeong, Woong-Seob;Hwang, Ho Seong;Kim, Seong Jin;Goto, Tomotsugu
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.44 no.2
    • /
    • pp.77.1-77.1
    • /
    • 2019
  • We present the results of the merger fraction evolution for galaxies in NEP-Wide field depending on star formation mode and redshift. We select the galaxies which have AKARI 9 ㎛ detections as a sample for large number of galaxies. We use multi-wavelength data from GALEX to Herschel, and Subaru HSC i-band images for analysis. We classify the merger galaxies with using Gini and M20, which are non-parametric calculated by statmorph code. We obtain the total infrared luminosity from the SED modeling with using one band, AKARI 9 ㎛. We find that the merger fractions of galaxies in all different star formation mode increase as the redshift increases. However, with fixed mass range of 10.5 < log(M🞵) < 11.5, the merger fractions of starbursts significantly increase as the redshift increases compared to those of main sequence and quiescent galaxies. We discuss the implications of these results in this poster.

  • PDF

A Training Algorithm for the Transform Trellis Code with Applications to Stationary Gaussian Sources and Speech (정상 가우시안 소오스와 음성 신호용 변환 격자 코드에 대한 훈련 알고리즘 개발)

  • Kim, Dong-Youn;Park, Yong-Seo;Whang, Keum-Chan;Pearlman, William A.
    • The Journal of the Acoustical Society of Korea
    • /
    • v.11 no.1
    • /
    • pp.22-34
    • /
    • 1992
  • There exists a transform trellis code that is optimal for stationary Gaussian sources and the squared-error distortion measure at all rates. In this paper, we train an asymptotically optimal version of such a code to obtain one which is matched better to the statistics of real world data. The training algorithm uses the M algorithm to search the trellis codebook and the LBG algorithm to update the trellis codebook. We investigate the trained transform trellis coding scheme for the first-order AR(autoregressive) Gaussian source whose correlation coefficient is 0.9 and actual speech sentences. For the first-order AR source, the achieved SNR for the test sequence is from 0.6 to 1.4 dB less than the maximum achievable SNR as given by Shannon's rate-distortion function for this source, depending on the rate and surpasses all previous known results for this source. For actual speech data, to achieve improved performance, we use window functions and gain adaptation at rate 1.0 bits/sample.

  • PDF

Development of a Human Factors Investigation and Analysis Model for Use in Maritime Accidents: A Case Study of Collision Accident Investigation

  • Kim, Hong-Tae;Na, Seong
    • Journal of Navigation and Port Research
    • /
    • v.41 no.5
    • /
    • pp.303-318
    • /
    • 2017
  • In the shipping industry, it is well known that around 80 % or more of all marine accidents are caused fully or at least in part by human error. In this regard, the International Maritime Organization (IMO) stated that the study of human factors would be important for improving maritime safety. Consequently, the IMO adopted the Casualty Investigation Code, including guidelines to assist investigators in the implementation of the Code, to prevent similar accidents occurring again in the future. In this paper, a process of the human factors investigation is proposed to provide investigators with a guide for determining the occurrence sequence of marine accidents, to identify and classify human error-inducing underlying factors, and to develop safety actions that can manage the risk of marine accidents. Also, an application of these investigation procedures to a collision accident is provided as a case study This is done to verify the applicability of the proposed human factors investigation procedures. The proposed human factors investigation process provides a systematic approach and consists of 3 steps: 'Step 1: collect data & determine occurrence sequence' using the SHEL model and the cognitive process model; 'Step 2: identify and classify underlying human factors' using the Maritime-Human Factor Analysis and Classification System (M-HFACS) model; and 'Step 3: develop safety actions,' using the causal chains. The case study shows that the proposed human factors investigation process is capable of identifying the underlying factors and indeveloping safety actions to prevent similar accidents from occurring.

Analysis for Diagnosis of Patients with Cerebral Infarction by Sequence Modeling (순차규칙 모델링을 활용한 뇌경색증 환자 진단 분석)

  • Shin, A.M.;Park, H.J.;Lee, I.H.;Kim, Y.N.
    • Journal of rehabilitation welfare engineering & assistive technology
    • /
    • v.2 no.1
    • /
    • pp.51-56
    • /
    • 2009
  • This study was tried to analyze the diagnosis of patients with cerebral infarction by sequence modeling that was one of data mining analysis method and find out previous disease or complication of patients with cerebral infarction. Mass data that the diagnosis code of cerebral infarction was 163 in 2000 to 2007 were extracted from A hospital's database and then the data mart was constructed for analysis. Total 2,267 patients illnesses were diagnosed as cerebral infarction and 32,692 cases related diagnosis were extracted. Sequence modeling in Clementine 12.0 program was used to analyze diagnosis of patients with cerebral infarction and 8 meaningful rules were found in this paper. This result could be used as a basic data to make secondary cerebral infarction prevention program and to prevent complication of cerebral infarction.

  • PDF

Novel Approach for Eliminating BER Irreducible Floor in the Enhanced Blind Cyclic Detection for Space-Time Coding

  • Pham, Van-Su;Le, Minh-Tuan;Mai, Linh;Kabir, S.M.Humayun;Yoon, Gi-Wan
    • Journal of information and communication convergence engineering
    • /
    • v.6 no.2
    • /
    • pp.150-153
    • /
    • 2008
  • In the blind Maximum-likelihood (ML) detection for Orthogonal Space-Time Block Codes (OSTBC), the problem of ambiguity in determining the symbols has been a great concern. A possible solution to this problem is to apply semi-blind ML detection, i.e. the blind ML decoding with pilot symbols or training sequence. In order to increase the performance, the number of pilot symbols or length of training sequence should be increased. Unfortunately, this leads to a significantly decrease in system spectral efficiency. This work presents an approach to resolve the aforementioned issue by introducing a new method for constructing transmitted information symbols, in which transmitting information symbols drawn form different modulation constellations. Therefore, the ambiguity can be easily eliminated. In addition, computer simulation is implemented to verify the performance of the proposed approach.

Comparison of Spectrum Sensing Algorithms for Cognitive Radio Systems (인지무선통신 시스템을 위한 스펙트럼 센싱 알고리즘의 비교)

  • Choi, Young-Hoon;Kim, Yoon-Hyun;Kim, Jin-Young;Lee, Jung-Hoon;Cha, Jae-Sang
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.4
    • /
    • pp.195-201
    • /
    • 2011
  • Cognitive radio (CR), which is proposed as a technology that utilizes the frequency resources effectively, has studied to relive scarcity of the frequency resources. CR provides opportunistically under-utilize licensed frequency to the secondary user. However, in the wireless channels, due to the effect of fading and shadowing environments, spectrum sensing performance is compromised. Besides, to detect and classify various CR systems, a novel spectrum sensing algorithm is needed. Therefore, in this paper, we proposed the spectrum sensing algorithm with water marking scheme.