• Title/Summary/Keyword: iterative detection

Search Result 208, Processing Time 0.021 seconds

Performance Improvement Using Iterative Two-Dimensional Soft Output Viterbi Algorithm Associated with Noise Filter for Holographic Data Storage Systems

  • Nguyen, Dinh-Chi;Lee, Jaejin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39A no.3
    • /
    • pp.121-126
    • /
    • 2014
  • Demand of the data storage becomes more and more growing. This requests the next generation of storage devices to have the dominated storage capability associated with superfast read/write rate. Holographic data storage (HDS) is investigated for a long time and is considered to be a candidate for the future storage system. However, it has two-dimensional intersymbol interference that conventional one-dimensional detection solutions have not yet handled strictly because of the complexity level of system as well as the cost. We propose a new scheme that combines iterative soft output Viterbi algorithm with noise filter for improving the bit error rate performance of HDS.

Improved Direct Method for Computing a Closest Voltage Collapse Point (최단전압붕괴점을 계산하는 개선된 직접법)

  • Nam, Hae-Kon;Song, Chung-Gi
    • Proceedings of the KIEE Conference
    • /
    • 1997.11a
    • /
    • pp.231-234
    • /
    • 1997
  • This paper presents improved direct method for calculating the closest saddle node bifurcation (CSNB) point, which is also applicable to the selection of appropriate load shedding, reactive power compensation point detection. The proposed method reduced dimension of nonlinear equation compared with that of Dobson's direct method. The improved direct method, utilizing Newton Iterative method converges very quickly. But it diverges if the initial guess is not very close to CSNB. So the direct method is performed with the initial values obtained by carrying out the iterative method twice, which is considered most efficient at this time. Since sparsity techniques can be employed, this method is a good choice to a large scale system on-line application. Proposed method has been tested for 5-bus, New England 30-bus system.

  • PDF

A Study on the New Delay Stopping Criterion of Turbo Code in W-CDMA System (W-CDMA 시스템에서 터보 부호의 새로운 복호지연 감소방식에 관한 연구)

  • Park, No-Jin;Shin, Myung-Sik
    • Journal of The Institute of Information and Telecommunication Facilities Engineering
    • /
    • v.8 no.4
    • /
    • pp.207-215
    • /
    • 2009
  • In recent digital communication systems, the performance of Turbo Code used as the error correction coding method depends on the interleaver size influencing the free distance determination and iterative decoding algorithms of the turbo decoder. However, some iterations are needed to get a better performance, but these processes require large time delay. Recently, methods of reducing the number of iteration have been studied without degrading original performance. In this paper, the new method combining ME (Mean Estimate) stopping criterion with SDR (sign difference ratio) stopping criterion of previous stopping criteria is proposed, and the fact of compensating each method's missed detection is verified Faster decoding realizes that reducing the number of iterative decoding about 1~2 times by adopting our proposed method into serially concatenation of both decoder. System Environments were assumed DS-CDMA forward link system with intense MAI (multiple access interference).

  • PDF

Local-Based Iterative Histogram Matching for Relative Radiometric Normalization

  • Seo, Dae Kyo;Eo, Yang Dam
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.37 no.5
    • /
    • pp.323-330
    • /
    • 2019
  • Radiometric normalization with multi-temporal satellite images is essential for time series analysis and change detection. Generally, relative radiometric normalization, which is an image-based method, is performed, and histogram matching is a representative method for normalizing the non-linear properties. However, since it utilizes global statistical information only, local information is not considered at all. Thus, this paper proposes a histogram matching method considering local information. The proposed method divides histograms based on density, mean, and standard deviation of image intensities, and performs histogram matching locally on the sub-histogram. The matched histogram is then further partitioned and this process is performed again, iteratively, controlled with the wasserstein distance. Finally, the proposed method is compared to global histogram matching. The experimental results show that the proposed method is visually and quantitatively superior to the conventional method, which indicates the applicability of the proposed method to the radiometric normalization of multi-temporal images with non-linear properties.

An Iterative MUSIC-Based DOA Estimation System Using Antenna Direction Control for GNSS Interference

  • Seo, Seungwoo;Park, Youngbum;Song, Kiwon
    • Journal of Positioning, Navigation, and Timing
    • /
    • v.9 no.4
    • /
    • pp.367-378
    • /
    • 2020
  • This paper introduces the development of the iterative multiple signal classification (MUSIC)-based direction-of-arrival (DOA) estimation system using a rotator that can control the direction of antenna for the global navigation satellite system (GNSS) interference. The system calculates the spatial spectrum according to the noise eigenvector of all dimensions to measure the number of signals (NOS). Also, to detect the false peak, the system adjusts the array antenna's direction and checks the change's peak angles. The phase delay and gain correction values for system calibration are calculated in consideration of the chamber's structure and the characteristics of radio waves. The developed system estimated DOAs of interferences located about 1km away. The field test results show that the developed system can estimate the DOA without NOS information and detect the false peak even though the inter-element spacing is longer than the half-wavelength of the interference.

Adaptive Detection of a Moving Target Undergoing Illumination Changes against a Dynamic Background

  • Lu, Mu;Gao, Yang;Zhu, Ming
    • Journal of the Optical Society of Korea
    • /
    • v.20 no.6
    • /
    • pp.745-751
    • /
    • 2016
  • A detection algorithm, based on the combined local-global (CLG) optical-flow model and Gaussian pyramid for a moving target appearing against a dynamic background, can compensate for the inadaptability of the classic Horn-Schunck algorithm to illumination changes and reduce the number of needed calculations. Incorporating the hypothesis of gradient conservation into the traditional CLG optical-flow model and combining structure and texture decomposition enable this algorithm to minimize the impact of illumination changes on optical-flow estimates. Further, calculating optical-flow with the Gaussian pyramid by layers and computing optical-flow at other points using an optical-flow iterative with higher gray-level points together reduce the number of calculations required to improve detection efficiency. Finally, this proposed method achieves the detection of a moving target against a dynamic background, according to the background motion vector determined by the displacement and magnitude of the optical-flow. Simulation results indicate that this algorithm, in comparison to the traditional Horn-Schunck optical-flow algorithm, accurately detects a moving target undergoing illumination changes against a dynamic background and simultaneously demonstrates a significant reduction in the number of computations needed to improve detection efficiency.

Cross-architecture Binary Function Similarity Detection based on Composite Feature Model

  • Xiaonan Li;Guimin Zhang;Qingbao Li;Ping Zhang;Zhifeng Chen;Jinjin Liu;Shudan Yue
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.8
    • /
    • pp.2101-2123
    • /
    • 2023
  • Recent studies have shown that the neural network-based binary code similarity detection technology performs well in vulnerability mining, plagiarism detection, and malicious code analysis. However, existing cross-architecture methods still suffer from insufficient feature characterization and low discrimination accuracy. To address these issues, this paper proposes a cross-architecture binary function similarity detection method based on composite feature model (SDCFM). Firstly, the binary function is converted into vector representation according to the proposed composite feature model, which is composed of instruction statistical features, control flow graph structural features, and application program interface calling behavioral features. Then, the composite features are embedded by the proposed hierarchical embedding network based on a graph neural network. In which, the block-level features and the function-level features are processed separately and finally fused into the embedding. In addition, to make the trained model more accurate and stable, our method utilizes the embeddings of predecessor nodes to modify the node embedding in the iterative updating process of the graph neural network. To assess the effectiveness of composite feature model, we contrast SDCFM with the state of art method on benchmark datasets. The experimental results show that SDCFM has good performance both on the area under the curve in the binary function similarity detection task and the vulnerable candidate function ranking in vulnerability search task.

Damage detection in steel structures using expanded rotational component of mode shapes via linking MATLAB and OpenSees

  • Toorang, Zahra;Bahar, Omid;Elahi, Fariborz Nateghi
    • Earthquakes and Structures
    • /
    • v.22 no.1
    • /
    • pp.1-13
    • /
    • 2022
  • When a building suffers damages under moderate to severe loading condition, its physical properties such as damping and stiffness parameters will change. There are different practical methods besides various numerical procedures that have successfully detected a range of these changes. Almost all the previous proposed methods used to work with translational components of mode shapes, probably because extracting these components is more common in vibrational tests. This study set out to investigate the influence of using both rotational and translational components of mode shapes, in detecting damages in 3-D steel structures elements. Three different sets of measured components of mode shapes are examined: translational, rotational, and also rotational/translational components in all joints. In order to validate our assumptions two different steel frames with three damage scenarios are considered. An iterative model updating program is developed in the MATLAB software that uses the OpenSees as its finite element analysis engine. Extensive analysis shows that employing rotational components results in more precise prediction of damage location and its intensity. Since measuring rotational components of mode shapes still is not very convenient, modal dynamic expansion technique is applied to generate rotational components from measured translational ones. The findings indicated that the developed model updating program is really efficient in damage detection even with generated data and considering noise effects. Moreover, methods which use rotational components of mode shapes can predict damage's location and its intensity more precisely than the ones which only work with translational data.

Preclinical Prototype Development of a Microwave Tomography System for Breast Cancer Detection

  • Son, Seong-Ho;Simonov, Nikolai;Kim, Hyuk-Je;Lee, Jong-Moon;Jeon, Soon-Ik
    • ETRI Journal
    • /
    • v.32 no.6
    • /
    • pp.901-910
    • /
    • 2010
  • As a supplement to X-ray mammography, microwave imaging is a new and promising technique for breast cancer detection. Through solving the nonlinear inverse scattering problem, microwave tomography (MT) creates images from measured signals using antennas. In this paper, we describe a developed MT system and an iterative Gauss-Newton algorithm. At each iteration, this algorithm determines the updated values by solving the set of normal equations using Tikhonov regularization. Some examples of successful image reconstruction are presented.

Maximum Product Detection Algorithm for Group Testing Frameworks

  • Seong, Jin-Taek
    • 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.