• Title/Summary/Keyword: Iterative detection

Search Result 210, Processing Time 0.028 seconds

Iterative Pre-Whitening Projection Statistics for Improving Multi-Target Detection Performance in Non-Homogeneous Clutter (불균일 클러터 환경에서 다중 표적탐지 성능 향상을 위한 반복 백색화 투영 통계 기법)

  • Park, Hyuck;Kang, Jin-Whan;Kim, Sang-Hyo
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.49 no.4
    • /
    • pp.120-128
    • /
    • 2012
  • In this paper, we propose a modified iterative pre-whitening projection statistics (MIPPS) scheme for improving multi-target detection performance in non-homogeneous clutter environments. As a non-homogeneity detection (NHD) technique of space-time adaptive processing algorithm for airborne radar, the MIPPS scheme improves the average detection probability of weak target when multiple targets with different reflection signal intensities are located in close range. Numerical results show that the conventional NHD schemes suffers from the masking effect by strong targets and clutters and the proposed MIPPS scheme outperforms the conventional schemes with respect to the average detection probability of the weak target at low signal-to-clutter ratio.

Low Complexity LSD Scheme for Joint Iterative MIMO Detection (반복 MIMO 검출을 위한 저 복잡도 LSD 기법)

  • Ahmed, Saleem;Kim, Sooyoung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38C no.11
    • /
    • pp.1051-1059
    • /
    • 2013
  • This paper proposes a complexity reduced list sphere decoding (LSD) scheme for joint iterative soft detection scheme for coded MIMO system. The conventional LSD scheme is based on searching the candidates with a fixed radius. However, once the candidate list is full, it is highly probable that the radius can be reduced. By reducing the radius, the complexity can be also reduced. We propose a simple and efficient radius update method for complexity reduction of list version sphere decoding and its application to iterative soft MIMO detection. We evaluate the performance of the proposed scheme with a joint soft-input-soft-ouput iterative MIMO detection in combination with turbo codes. Simulation results show that the proposed methods provide substantial complexity reduction while achieving similar bit error rate (BER) performance as the conventional LSD scheme.

Clipping Value Estimate for Iterative Tree Search Detection

  • Zheng, Jianping;Bai, Baoming;Li, Ying
    • Journal of Communications and Networks
    • /
    • v.12 no.5
    • /
    • pp.475-479
    • /
    • 2010
  • The clipping value, defined as the log-likelihood ratio (LLR) in the case wherein all the list of candidates have the same binary value, is investigated, and an effective method to estimate it is presented for iterative tree search detection. The basic principle behind the method is that the clipping value of a channel bit is equal to the LLR of the maximum probability of correct decision of the bit to the corresponding probability of erroneous decision. In conjunction with multilevel bit mappings, the clipping value can be calculated with the parameters of the number of transmit antennas, $N_t$; number of bits per constellation point, $M_c$; and variance of the channel noise, $\sigma^2$, per real dimension in the Rayleigh fading channel. Analyses and simulations show that the bit error performance of the proposed method is better than that of the conventional fixed-value method.

A Low-Complexity CLSIC-LMMSE-Based Multi-User Detection Algorithm for Coded MIMO Systems with High Order Modulation

  • Xu, Jin;Zhang, Kai
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.4
    • /
    • pp.1954-1971
    • /
    • 2017
  • In this work, first, a multiuser detection (MUD) algorithm based on component-level soft interference cancellation and linear minimum mean square error (CLSIC-LMMSE) is proposed, which can enhance the bit error ratio (BER) performance of the traditional SIC-LMMSE-based MUD by mitigating error propagation. Second, for non-binary low density parity check (NB-LDPC) coded high-order modulation systems, when the proposed algorithm is integrated with partial mapping, the receiver with iterative detection and decoding (IDD) achieves not only better BER performance but also significantly computational complexity reduction over the traditional SIC-LMMSE-based IDD scheme. Extrinsic information transfer chart (EXIT) analysis and numerical simulations are both used to support the conclusions.

Iterative damage index method for structural health monitoring

  • You, Taesun;Gardoni, Paolo;Hurlebaus, Stefan
    • Structural Monitoring and Maintenance
    • /
    • v.1 no.1
    • /
    • pp.89-110
    • /
    • 2014
  • Structural Health Monitoring (SHM) is an effective alternative to conventional inspections which are time-consuming and subjective. SHM can detect damage early and reduce maintenance cost and thereby help reduce the likelihood of catastrophic structural events to infrastructure such as bridges. After reviewing the Damage Index Method (DIM), an Iterative Damage Index Method (IDIM) is proposed to improve the accuracy of damage detection. These two damage detection techniques are compared based on damage on two structures, a simply supported beam and a pedestrian bridge. Compared to the traditional damage detection algorithm, the proposed IDIM is shown to be less arbitrary and more accurate.

An Effective Detection of Bimean and its Application into Image Segmentation by an Interative Algorithm Method (반복적인 알고리즘 방법에 의한 효과적인 양평균 검출 및 영상분할에 응용)

  • Heo, Pil-U
    • 연구논문집
    • /
    • s.25
    • /
    • pp.147-154
    • /
    • 1995
  • In this paper, we discussed the convergence and the properties of an iterative algorithm method in order to improve a bimean clustering algorithm. This algorithm that we have discussed choose automatically an optimum threshold as a result of an iterative process, successive iterations providing increasingly cleaner extractions of the object region, The iterative approach of a proposed algorithm is seen to select an appropriate threshold for the low contrast images.

  • PDF

Low-Complexity Massive MIMO Detectors Based on Richardson Method

  • Kang, Byunggi;Yoon, Ji-Hwan;Park, Jongsun
    • ETRI Journal
    • /
    • v.39 no.3
    • /
    • pp.326-335
    • /
    • 2017
  • In the uplink transmission of massive (or large-scale) multi-input multi-output (MIMO) systems, large dimensional signal detection and its hardware design are challenging issues owing to the high computational complexity. In this paper, we propose low-complexity hardware architectures of Richardson iterative method-based massive MIMO detectors. We present two types of massive MIMO detectors, directly mapped (type1) and reformulated (type2) Richardson iterative methods. In the proposed Richardson method (type2), the matrix-by-matrix multiplications are reformulated to matrix-vector multiplications, thus reducing the computational complexity from $O(U^2)$ to O(U). Both massive MIMO detectors are implemented using a 65 nm CMOS process and compared in terms of detection performance under different channel conditions (high-mobility and flat fading channels). The hardware implementation results confirm that the proposed type1 Richardson method-based detector demonstrates up to 50% power savings over the proposed type2 detector under a flat fading channel. The type2 detector indicates a 37% power savings compared to the type1 under a high-mobility channel.

Joint FrFT-FFT basis compressed sensing and adaptive iterative optimization for countering suppressive jamming

  • Zhao, Yang;Shang, Chaoxuan;Han, Zhuangzhi;Yin, Yuanwei;Han, Ning;Xie, Hui
    • ETRI Journal
    • /
    • v.41 no.3
    • /
    • pp.316-325
    • /
    • 2019
  • Accurate suppressive jamming is a prominent problem faced by radar equipment. It is difficult to solve signal detection problems for extremely low signal to noise ratios using traditional signal processing methods. In this study, a joint sensing dictionary based compressed sensing and adaptive iterative optimization algorithm is proposed to counter suppressive jamming in information domain. Prior information of the linear frequency modulation (LFM) and suppressive jamming signals are fully used by constructing a joint sensing dictionary. The jamming sensing dictionary is further adaptively optimized to perfectly match actual jamming signals. Finally, through the precise reconstruction of the jamming signal, high detection precision of the original LFM signal is realized. The construction of sensing dictionary adopts the Pei type fast fractional Fourier decomposition method, which serves as an efficient basis for the LFM signal. The proposed adaptive iterative optimization algorithm can solve grid mismatch problems brought on by undetermined signals and quickly achieve higher detection precision. The simulation results clearly show the effectiveness of the method.

Multiple Plane Area Detection Using Self Organizing Map (자기 조직화 지도를 이용한 다중 평면영역 검출)

  • Kim, Jeong-Hyun;Teng, Zhu;Kang, Dong-Joong
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.17 no.1
    • /
    • pp.22-30
    • /
    • 2011
  • Plane detection is very important information for mission-critical of robot in 3D environment. A representative method of plane detection is Hough-transformation. Hough-transformation is robust to noise and makes the accurate plane detection possible. But it demands excessive memory and takes too much processing time. Iterative randomized Hough-transformation has been proposed to overcome these shortcomings. This method doesn't vote all data. It votes only one value of the randomly selected data into the Hough parameter space. This value calculated the value of the parameter of the shape that we want to extract. In Hough parameters space, it is possible to detect accurate plane through detection of repetitive maximum value. A common problem in these methods is that it requires too much computational cost and large number of memory space to find the distribution of mixed multiple planes in parameter space. In this paper, we detect multiple planes only via data sampling using Self Organizing Map method. It does not use conventional methods that include transforming to Hough parameter space, voting and repetitive plane extraction. And it improves the reliability of plane detection through division area searching and planarity evaluation. The proposed method is more accurate and faster than the conventional methods which is demonstrated the experiments in various conditions.

Error-detection-coding-aided iterative hard decision interference cancellation for MIMO systems with HARQ

  • Park, Sangjoon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.3
    • /
    • pp.1016-1030
    • /
    • 2018
  • In this paper, an error-detection-coding-aided iterative hard decision interference cancellation (EDC-IHIC) scheme for multiple-input multiple-output systems employing hybrid automatic repeat request (HARQ) for multi-packet transmission is developed and investigated. In the EDC-IHIC scheme, only packets identified as error-free by the EDC are submitted to the interference cancellation (IC) stage for cancellation from the received signals. Therefore, the possibility of error propagation, including inter-transmission error propagation, can be eliminated using EDC-IHIC. Because EDC must be implemented in systems that employ HARQ to determine packet retransmission, error propagation can be prevented without the need for additional redundancy. The results of simulations conducted herein verify that the EDC-IHIC scheme outperforms conventional hard decision IC schemes in terms of the packet error rate in various environments.