• Title/Summary/Keyword: 랜덤 코드

Search Result 71, Processing Time 0.025 seconds

Random PRF Pulse Design for Signal Processing Unit of Small Tracking Radar (소형 추적 레이더 신호처리기용 Random PRF 펄스 설계)

  • Hong-Rak Kim;Man-Hee Lee;Sung-Ho Park;Youn-Jin Kim
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.24 no.2
    • /
    • pp.59-64
    • /
    • 2024
  • The small tracking radar randomly changes the transmission period to avoid deceptive signals such as RGPO (Range Gaet Pull Off) operated on the target. Since the code repeats after a specific section, it becomes difficult to avoid a deceptive signal when the repetition is exposed. In this paper, a more realistic transmission pulse code is generated by adding random code generation through FPGA and system white noise. We present the research results of code generation that generates PRF that can avoid repetition while using pseudo-random code in EPROM using FPGA. Also, the result of designing random PRF pulse was confirmed by applying it to tracking radar.

Random Sign Reversal Technique in Space Frequency Block Code for Single Carrier Modulation (단일 반송파 변조를 위한 공간 주파수 블록 코드의 난수 부호 반전 기법)

  • Jung, Hyeok-Koo
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.27 no.5
    • /
    • pp.25-36
    • /
    • 2022
  • This paper proposes a random sign reversal technique in space frequency block code for single carrier modulation. The traditional space time and frequency block coding technique may be confronted with radio environments openly, severe radio hijacking problems are to be overcome. In order to avoid such an open radio issue, random coded data protection technique for space-time block code was proposed, but this algorithm can change channel combination per an Orthogonal Frequency Division Multiplexing block. This kind of slow switching increases the probability that nearby receivers will detect the transmitted data. This paper proposes a fast switching algorithm per data symbols' basis which is a random sign reversal technique in space frequency block code for Single Carrier Modulation. It is shown in simulation that the proposed one has a superior performance in comparison with the performance of the receiver which do not know the random timing sequence of sign reversal.

Performance Analysis of Reed Solomon/Convolutional Concatenated Codes and Turbo code using Semi Random Interleaver over the Radio Communication Channel (무선통신 채널에서 RS/길쌈 연쇄부호와 세미 랜덤 인터리버를 이용한 터보코드의 성능 분석)

  • 홍성원
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.5 no.5
    • /
    • pp.861-868
    • /
    • 2001
  • In this paper, the performance of Reed Solomon(RS)/convolution리 concatenated codes and turbo code using semi random interleaver over the radio communication channel was analyzed. In the result, we proved that the performance of decoder was excellent as increase the interleaver size, constraint length, and iteration number. When turbo code using semi random interleaver and Hsiconvolutional concatenated codes was constant constraint length L=5, BER=10-4 , each value of $E_b/N_o$ was 4.5〔dB〕 and 2.95〔dB〕. Therefore, when the constraint length was constant, we proved that the performance of turbo code is superior to RS/Convolutional concatenated codes about 1.55〔dB〕 in the case of BER=10-4.

  • PDF

Binary Image Trimming using Chain Code (체인 코드를 이용한 이진 영상 트리밍)

  • Jung, Min-Chul
    • Proceedings of the KAIS Fall Conference
    • /
    • 2007.05a
    • /
    • pp.216-219
    • /
    • 2007
  • 본 논문에서는 영상 인식을 위해 그레이 레벨로 획득된 영상을 이진화할 때 발생되어 패턴의 윤곽선을 울퉁불퉁하게 만드는 랜덤 노이즈를 제거하기 위한 방법으로 체인 코드 트리밍(chain code trimming) 을 제안한다. 제안된 방법은 패턴의 외부 윤곽선과 내부 윤곽선의 체인 코드 분석을 통해 랜텀 노이즈의 체인 코드를 제거, 교정함으로서 이루어진다. 실험에서는 트리밍을 사용하기전과, 단순 트리밍을 한 경우, 체인 코드 트리밍을 한 경우를 서로 바로, 분석한다. 실험 결과는 패턴에 첨부되었던 랜덤 노이즈가 모두 성공리에 제거된 것을 보인다.

  • PDF

Random beamforming applying codebook rotation (다중 코드북을 이용한 랜덤 빔 형성 기법)

  • Kang, Ji-Won;Yoo, Byung-Wook;Seo, Jeong-Tae;Lee, Chung-Yong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.7
    • /
    • pp.1-5
    • /
    • 2009
  • Random beanforming exploits multiuser diversity gain in static channels. Since the gain is restricted by the user population, some extended works have been proposed. Among them, a codebook-based opportunistic beamforming technique forms multiple random beams with small pilots. The technique however has difficulty in designing beams flexibly by the channel statistics. In this paper, we propose a technique forming the multiple random beams by rotating codebooks. The proposed technique enables the flexible design of beams so that multiuser diversity and beam selection diversity are exploited simultaneously with small pilots robust to the channel statistics.

Analysis Performance of Convolutional Code and Turbo code Using The Semi-Random Interleaver (길쌈부호와 세미 랜덤 인터리버를 사용한 터보코드의 성능분석)

  • 홍성원
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.5 no.6
    • /
    • pp.1184-1189
    • /
    • 2001
  • In this paper was analyzed the performance of turbo code using semi-random interleaver which proposed a reference numbers 11. Which was analyzed comparison the performance of between the current mobile communication system had been used the viterbe decoding algorithm of convolutional code and turbo codes when fixed constraint length. The result was defined that the performance of turbo code rose a $E_{b/}$ $N_{o}$=4.7[㏈] than convolutional code, when convolutional code and turbo code was fixed by BER = 10$^{-4}$ and constraint length K 5.5.5.

  • PDF

OptoDigital Implementation of Multiple Information Hiding and Extraction System (다중 정보 은폐 및 추출 시스템의 광-디지털적 구현)

  • 김은수
    • Proceedings of the Optical Society of Korea Conference
    • /
    • 2002.07a
    • /
    • pp.126-127
    • /
    • 2002
  • 본 논문에서는 최근, 차세대 정보보호 기술로 많은 연구가 이루어지고 있는 디지털 정보은폐(Digital Information hiding) 기술과 광정보처리 기술을 상호 보완적으로 이용한 새로운 복합 광-디지털 다중 정보은폐 및 실시간 추출 시스템을 구현하였다. 즉, 디지털 기술을 이용한 다중 정보은폐에서는 확산코드간에 랜덤성과 직교성을 보장할 수 있는 새로운 코드로써 의사랜덤 코드(Pseudo random code)와 하다마드 행렬(Hadamard matrix)을 상호보완적으로 조합하여 만든 스테고 키(stego key)를 사용하였으며 이를 이용하여 임의의 커버영상(cover image)에 다중의 정보를 은폐시킬 수 있는 새로운 기법을 제시하였다. 이와 같은 방법으로 은폐된 정보는 정보 은폐시 사용된 스테고 키성분이 정확하게 일치될 경우에만 추출될 수 있으므로 불법 사용자가 무한히 발생시킬 수 있는 랜덤시퀀스를 정확하게 재생하는 것은 거의 불가능함으로 강한 비화성을 가지며, 하다마드 행렬의 직교성으로 서로 다른 확산코드간의 상관성이 발생하지 않기 때문에 에러 없는 은폐정보의 추출도 가능하다. (중략)

  • PDF

Performance Analysis of Turbo code using Semi Random Interleaver over the Radio Communication Channel (무선통신 채널에서 세미 랜덤 인터리버를 이용한 터보코드의 성능분석)

  • 홍성원
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.4 no.5
    • /
    • pp.1067-1075
    • /
    • 2000
  • In this paper, the performance of turbo code using semi random interleaver over the radio communication channel was analyzed. In the result, we proved that the performance of decoder was excellent as increase the interleaver size, constraint length, and iteration number. When the constraint length of turbo code using seim random interleaver and convolutional code is constant, and BER $10^{-4}$ each value of $E_b/N_o$ was 6.4(DB) and 1.7(dB). There(ore, when the constraint length was constant, we proved that the performance of turbo code using semi random interleaver is superior to convolutional code about 4.7(dB) in the case of BER=$10^{-4}$.

  • PDF

The Presentation of Semi-Random Interleaver Algorithm for Turbo Code (터보코드에 적용을 위한 세미 랜덤 인터리버 알고리즘의 제안)

  • Hong, Sung-Won;Park, Jin-Soo
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.2
    • /
    • pp.536-541
    • /
    • 2000
  • Turbo code has excellent decoding performance but had limitations for real time communications because of the system complexity and time delay in decoding procedure. To overcome this problem, a new SRI(Semi-Random Interleaver) algorithm which realize the reduction of the interleaver size is proposed for reducing the time delay during the decoding prodedure. SRI compose the interleaver 0.5 size from the input data sequence. In writing the interleaver, data is recorded by row such as block interleaver. But, in reading, data is read by randomly and the text data is located by the just address simultaneously. Therefore, the processing time of with the preexisting method such as block, helical random interleaver.

  • PDF