• Title/Summary/Keyword: maximum detection probability

Search Result 99, Processing Time 0.031 seconds

Dwell Time Optimization of Alert-Confirm Detection for Active Phased Array Radars

  • Kim, Eun Hee;Park, JoonYong
    • Journal of electromagnetic engineering and science
    • /
    • v.19 no.2
    • /
    • pp.107-114
    • /
    • 2019
  • Alert-confirm detection is a highly efficient method to improve phased array radar search performance. It comprises sequential detection in two steps: alert detection, in which a target is detected at a low detection threshold, and confirm detection, which is triggered by alert detection with a longer dwell time to minimize false alarms. This paper provides a design method for applying the alert-confirm detection to multifunctional radars. We find optimum dwell times and false alarm probabilities for each alert detection and confirm detection under the dual constraints of total false alarm probability and maximum allowable dwell time per position. These optimum values are expressed as a function of the mean new target appearance rate. The proposed alert-confirm detection increases the maximum detection range even with a shorter frame time than that of uniform scanning.

Optimal Sensor Placement in Multistatic Sonar (다중 상태 소나의 최적 수신망 배치)

  • Lee, Kwang-Hee;Han, Dong-Seog
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.15 no.5
    • /
    • pp.630-634
    • /
    • 2012
  • It is very important to place receiver in multistatic sonar. Inefficient placement of the receiver reduce detection probability and to increase the probability of detection should be used more receivers. Therefore, detection of targets in searching area, detection performance of limited receiver depends on how to place. Through the optimized receiver placement, detection area between each sonar as much as possible avoid duplication, as optimization, the minimum receiver can be maintained detection performance. In this paper we prove mathematical verification of maximum signal excess value based on sonar placement and we calculate a signal excess value by using computer simulations and suggest optimal sonar placement.

Cooperative Node Selection for the Cognitive Radio Networks (인지무선 네트워크를 위한 협력 노드 선택 기법)

  • Gao, Xiang;Lee, Juhyeon;Park, Hyung-Kun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.2
    • /
    • pp.287-293
    • /
    • 2013
  • Cognitive radio has been recently proposed to dynamically access unused-spectrum. The CR users can share the same frequency band with the primary user without interference to each other. Usually each CR user needs to determine spectrum availability by itself depending only on its local observations. But uncertainty communication environment effects can be mitigated so that the detection probability is improved in a heavily shadowed environment. Soft detection is a primary user detection method of cooperative cognitive radio networks. In our research, we will improve system detection probability by using optimal cooperative node selection algorithm. New algorithm can find optimal number of cooperative sensing nodes for cooperative soft detection by using maximum ratio combining (MRC) method. Through analysis, proposed cooperative node selection algorithm can select optimal node for cooperative sensing according to the system requirement and improve the system detection probability.

Detection of the Normal Population with the Largest Absolute Value of Mean

  • Kim, Woo-Chul;Jeong, Gyu-Jin
    • Journal of the Korean Statistical Society
    • /
    • v.22 no.1
    • /
    • pp.71-81
    • /
    • 1993
  • Among k independent normal populations with unknown means and a common unknown variance, the problem of detecting the population with the largest absolute value of mean is considered. This problem is formulated in a manner close to the framework of testing hypotheses, and the maximum error probability and the minimum power are considered. The power charts necessary to determine the sample size are provided. The problem of detecting the population with the smallest absolute value of mean is also considered.

  • PDF

A Probabilistic Detection Algorithm for Noiseless Group Testing (무잡음 그룹검사에 대한 확률적 검출 알고리즘)

  • Seong, Jin-Taek
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.23 no.10
    • /
    • pp.1195-1200
    • /
    • 2019
  • This paper proposes a detection algorithm for group testing. Group testing is a problem of finding a very small number of defect samples out of a large number of samples, which is similar to the problem of Compressed Sensing. In this paper, we define a noiseless group testing and propose a probabilistic algorithm for detection of defective samples. The proposed algorithm is constructed such that the extrinsic probabilities between the input and output signals exchange with each other so that the posterior probability of the output signal is maximized. Then, defective samples are found in the group testing problem through a simulation on the detection algorithm. The simulation results for this study are compared with the lower bound in the information theory to see how much difference in failure probability over the input and output signal sizes.

Target Detection Performance in a Clutter Environment Based on the Generalized Likelihood Ratio Test (클러터 환경에서의 GLRT 기반 표적 탐지성능)

  • Suh, Jin-Bae;Chun, Joo-Hwan;Jung, Ji-Hyun;Kim, Jin-Uk
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.30 no.5
    • /
    • pp.365-372
    • /
    • 2019
  • We propose a method to estimate unknown parameters(e.g., target amplitude and clutter parameters) in the generalized likelihood ratio test(GLRT) using maximum likelihood estimation and the Newton-Raphson method. When detecting targets in a clutter environ- ment, it is important to establish a modular model of clutter similar to the actual environment. These correlated clutter models can be generated using spherically invariant random vectors. We obtain the GLRT of the generated clutter model and check its detection probability using estimated parameters.

Analytical BER Expression of the Optimal Single User Detection of a BPSK Signal in the Presence of a Gaussian CCI (가우시안 동일 채널 간섭하에서 BPSK 신호의 최적 단일 사용자 검출의 정확한 BER 수식)

  • Chung, Kyuhyuk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39A no.9
    • /
    • pp.491-496
    • /
    • 2014
  • We derive an analytical expression for the bit-error rate (ber) of optimal single user detection (osud) of a binary phase-shift keying (bpsk) signal corrupted by a gaussian cochannel interferer (cci). the channel capacity is also calculated to investigate the ber performance.

The Mutual Information for Bit-Linear Linear-Dispersion Codes (BLLD 부호의 Mutual Information)

  • Jin, Xiang-Lan;Yang, Jae-Dong;Song, Kyoung-Young;No, Jong-Seon;Shin, Dong-Joon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.10A
    • /
    • pp.958-964
    • /
    • 2007
  • In this paper, we derive the relationship between the bit error probability (BEP) of maximum a posteriori (MAP) bit detection and the bit minimum mean square error (MMSE), that is, the BEP is greater than a quarter of the bit USE and less than a half of the bit MMSE. By using this result, the lower and upper bounds of the derivative of the mutual information are derived from the BEP and the lower and upper bounds are easily obtained in the multiple-input multiple-output (MIMO) communication systems with the bit-linear linear-dispersion (BLLD) codes in the Gaussian channel.

Optimal sensing period in cooperative relay cognitive radio networks

  • Zhang, Shibing;Guo, Xin;Zhang, Xiaoge;Qiu, Gongan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.12
    • /
    • pp.5249-5267
    • /
    • 2016
  • Cognitive radio is an efficient technique to improve spectrum efficiency and relieve the pressure of spectrum resources. In this paper, we investigate the spectrum sensing period in cooperative relay cognitive radio networks; analyze the relationship between the available capacity and the signal-to-noise ratio of the received signal of second users, the target probability of detection and the active probability of primary users. Finally, we derive the closed form expression of the optimal spectrum sensing period in terms of maximum throughput. We simulate the probability of false alarm and available capacity of cognitive radio networks and compare optimal spectrum sensing period scheme with fixed sensing period one in these performance. Simulation results show that the optimal sensing period makes the cognitive networks achieve the higher throughput and better spectrum sensing performance than the fixed sensing period does. Cooperative relay cognitive radio networks with optimal spectrum sensing period can achieve the high capacity and steady probability of false alarm in different target probability of detection. It provides a valuable reference for choosing the optimal spectrum sensing period in cooperative relay cognitive radio networks.

Cooperative Spectrum Sensing Via Sequential Detection: A Method to Reduce the Sensing Time

  • Thanh, Truc Tran;Kong, Hyung-Yun
    • Journal of electromagnetic engineering and science
    • /
    • v.12 no.3
    • /
    • pp.196-202
    • /
    • 2012
  • Spectrum sensing is one of the most important functions in cognitive radio systems. In this paper, we focus on reducing the sensing time in a cooperative spectrum sensing paradigm. In the proposed scheme, a sequential detection technique is employed to provide a robust and quick detection system. Each of the secondary users measures the log-likelihood probability of the received signals and then sequentially reports to the base station. Here, the maximum ratio combining (MRC) technique is employed to reduce the average sample number (ASN) in order to reduce the sensing time. This proposed scheme is analyzed and simulated to illustrate the performance in comparison with the other given methods. Analysis and simulation are provided to validate the proposed method.