• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.13 no.2
• /
• pp.95-101
• /
• 2020

In this paper, we consider a group testing (GT) framework which is to find a set of defective samples out of a large number of samples. To handle this framework, we propose a maximum product detection algorithm (MPDA) which is based on maximum a posteriori probability (MAP). The key idea of this algorithm exploits iterative detection to propagate belief to neighbor samples by exchanging marginal probabilities between samples and output results. The belief propagation algorithm as a conventional approach has been used to detect defective samples, but it has computational complexity to obtain the marginal probability in the output nodes which combine other marginal probabilities from the sample nodes. We show that the our proposed MPDA provides a benefit to reduce computational complexity up to 12% in runtime, while its performance is only slightly degraded compared to the belief propagation algorithm. And we verify the simulations to compare the difference of performance.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.2
• /
• pp.46-54
• /
• 2007

In this paper, we introduce the performance of improved symbol timing detection by the superposed difference type symbol timing detection method in the OFDM system. Also, we represent the maximum detection probability of symbol synchronization timing at each received delay signal in multipath channel delay profile in the correlation and difference type symbol timing detection methods. The computer simulation results show that the correlation symbol timing detection method have maximum detection probability at the lead of the nth received delay signal of highest amplitude, but the difference type symbol timing detection method always have maximum detection probability at the lead of the first received delay signal in the channel delay spread of $70nsec{\sim}217nsec$. The simulation results indicate the possibility of the perfect detection of OFDM symbol synchronization timing and it fit well with the results of improved S/N to the eb/n0 and the performance of symbol timing detection of the proposed method.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.2
• /
• pp.55-61
• /
• 2007

In this paper, we represent the maximum detection probability formulas of symbol synchronization timing at each received delay signal in multipath channel delay profile in the multiplied correlation and difference type correlated symbol synchronization timing detection method. The computer simulation results show that the correlation symbol timing detection method have maximum detection probability at the lead of received delay signal of highest amplitude, but the difference type of correlation symbol timing detection method always have maximum detection probability at the lead of first received delay signal in the multipath channel models. Using this results, we show the BER characteristics difference between the IEEE802.11a OFDM signals which is obtained in case of the symbol synchronization timing is taken at zero error(perfect) timing position and at -1 sample error symbol timing position from perfect timing position in the multipath channel models regardless the length of channel delay spread.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.3C
• /
• pp.304-310
• /
• 2009

This paper proposes a successive MAP (maximum a posteriori probability) detection scheme with SoIC(soft interference cancellation) to reduce the receiver complexity of hierarchical M-ary QAM system. For the successive MAP detection, modulation symbols generated from the other data streams are treated as Gaussian noise or eliminated as the soft interference according to their priorities. The log-likelihood ratio of the a posteriori probability (LAPRP) of each bit is calculated by the MAP detector with an adjusted noise variance in order to take the elimination and Gaussian assumption effect into account. By separating the detection process into the successive steps, the detection complexity is reduced to increase linearly with the number of bits per hierarchical M-ary QAM symbol. Simulation results show that the proposed detection provides a small performance degradation as compared to the optimal MAP detection.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11A
• /
• pp.1063-1071
• /
• 2008

This paper proposes a prior maximum likelihood (ML) detection verifier which has an ability to verify if the zero forcing (ZF) detection results are identical to the ML detection results. Since more than 90% of ZF detection results are identical to ML detection results, the proposed verifier makes it possible to omit the computationally complex ML detection in 90% cases of MIMO signal detections. The proposed verifier is designed by using the diversity gain obtained from converting MIMO signal into single input multiple output (SIMO) signals. In the proposed method, single input multiple output (SIMO) signals for each transmit antenna are separated from MIMO signals after the MIMO signals are detected by ZF method. Computer simulations show that the true alarm probability of the proposed verifier is more than 80% and the false alarm probability is less than $10^{-4}$.

• International Journal of Computer Science & Network Security
• /
• v.22 no.12
• /
• pp.51-56
• /
• 2022

In space based constellation network, users are allowed to enter or leave the network arbitrarily. Hence, the number, identities and transmitted data of active users vary with time and have considerable impacts on the receiver's performance. The so-called problem of multiuser detection means identifying the identity of each active user and detecting the data transmitted by each active user. Traditional methods assume that the number of active users is equal to the maximum number of users that the network can hold. The model of traditional methods are simple and the performance are suboptimal. In this paper a Maximum A Posteriori Probability (MAP) based multiuser detection method is proposed. The proposed method models the activity state of users as Markov chain and transforms multiuser detection into searching optimal path in grid map with BCJR algorithm. Simulation results indicate that the proposed method obtains 2.6dB and 1dB E_b/N₀ gains respectively when activity detection error rate and symbol error rate reach 10^-3, comparing with reference methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.12C
• /
• pp.1082-1087
• /
• 2008

Maximum Likelihood (ML) detection is well known to exhibit better bit-error-rate (BER) than many other detectors for multiple-input multiple-output (MIMO) channel. However, ML detection has been shown a difficult problem due to its NP-hard problem. It means that there is no known algorithm which can find the optimal solution in polynomial-time. In this paper, Semi-Definite relaxation (SDR) is iteratively applied to ML detection problem. The probability distribution can be obtained by survival eigenvector out of the dominant eigenvalue term of the optimal solution. The probability distribution which is yielded by SDR is recurred to the received signal. Our approach can reach to nearly ML performance.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.4 s.316
• /
• pp.117-122
• /
• 2007

For multiple antenna systems, we consider the hybrid iterative detection of the maximum a posteriori probability(MAP) detection and the linear detection such as the minimum-mean-square-error(MMSE) filtering with soft cancelation. We devise methods to obtain both the lower complexity of the linear detection and the superior performance of the MAP detection. Using the a prior probability of the coded bit which is extrinsic of the outer decoder, we compute the threshold of grouping and determine the detection scheme symbol by symbol. Through the simulation results, it is shown that the proposed receiver obtains the superior performance to the MMSE detector and the lower complexity than the MAP detector.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.1
• /
• pp.37-41
• /
• 2014

Recently, a lot of research efforts has been directed toward spectrum sensing techniques exploiting the some characteristics of power spectrum. Among them, a sensing technique employing the maximum of power spectrum as a test statistic has appeared in the literature and its false alarm probability was also derived under the assumption that the test statistic follows the Gaussian distribution. This paper provides an exact form of the false alarm probability without using the assumption and compares it with the previous work.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.7
• /
• pp.1803-1813
• /
• 1996

This paper describes an automatic threshold decision using a maximum mismatched correlation value in the direct sequence spread spectrum (DS-SS) system. For received PN codes with different single-to-noise ratio (SNR), this scheme is able to detect a desired threshold value in the search mode, i.e. a maximum mismstched correlation value, so that value is utilized as a threshold for the verification mode. Performance of the proposed scheme in both the additive white gaussian noise (AWGN) and frequency-selective Rayleigh fading channels is analyzed through the Monte Carlo simulation. And hardware implementation of this scheme using a DSP processor is demonstrated. The proposed acquisition shceme is compared to the conventional constant threshold (CT) scheme, and significant improvement of performance is shown. Analysis of system performance in the verification mode is presented, and key quantities such as the false alarm probability and the detection probability are derived in a AWGN channel.