• 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.

• Journal of Magnetics
• /
• v.18 no.3
• /
• pp.357-360
• /
• 2013

A modified SQI method using magnetic leakage flux (MFL) signal for underground gas pipelines' defect detection and characterization is presented in this paper. Raw signals gathered using MFL signals include many unexpected noises and high frequency signals, uneven background signals, signals caused by real defects, etc. The MFL signals of defect free pipelines primarily consist of two kinds of signals, uneven low frequency signals and uncertain high frequency noises. Leakage flux signals caused by defects are added to the case of pipelines having defects. Even though the SQI (Self Quotient Image) is a useful tool to gradually remove the varying backgrounds as well as to characterize the defects, it uses the division and floating point operations. A modified SQI having low computational complexity without time-consuming division operations is presented in this paper. By using defects carved in real pipelines in the pipeline simulation facility (PSF) and real MFL data, the performance of the proposed method is compared with that of the original SQI.

• International Journal of Internet, Broadcasting and Communication
• /
• v.9 no.1
• /
• pp.72-80
• /
• 2017

In this work, an efficient transmit antenna selection approach for the quadrature spatial modulation (QSM) systems is proposed. The conventional Euclidean distance antenna selection (EDAS)-based schemes in QSM have too high computational complexity for practical use. The proposed antenna selection algorithm is based on approximation of the EDAS decision metric employed for QSM. The elimination of imaginary parts in the decision metric enables decoupling of the approximated decision metric, which enormously reduces the complexity. The proposed method is also evaluated via simulations in terms of symbol error rate (SER) performance and compared with the conventional EDAS methods in QSM systems.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.7
• /
• pp.1-13
• /
• 1993

In this paper, the problems of the conventional special-purpose array processor such as the deficiency of flexibility have been investigated. Then, a new modified methodology has been suggested and applied to obtain the common solution of the three typical App algorithms like SP(Shortest Path), TC(Transitive Closure), and MST(Minimun Spanning Tree) among the various APP algorithms using the similar method to obtain the solution. In the newly proposed APP parallel algorithm, real-time Processing is possible, without the structure enhancement and the functional restriction. In addition, we design 2-demensional bit-parallel low-triangular systolic array processor and the 1-PE in detail. For its evaluation, we consider its computational complexity according to bit-processing method and describe relationship of total chip size and execution time. Therefore, the proposed processor obtains, on which a large data inputs in real-time, 3n-4 execution time which is optimal o(n) time complexity, o(n$^{2}$) space complexity which is the number of total gate and pipeline period rate is one.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1999.06a
• /
• pp.171-176
• /
• 1999

Template matching is one of the most often used techniques for machine vision applications to find a template of size M$\times$M or subimage in a scene image of size N$\times$N. Most template matching methods, however, require pixel operations between the template and the image under analysis resulting in high computational cost of O(M2N2). So in this thesis, we present a two stage template matching method. In the first stage, we use a novel low cost feature whose complexity is approaching O(N2) to select matching candidates. In the second stage, we use conventional template matching method to find out the exact matching point. We compare the result with other methods in terms of complexity, efficiency and performance. Proposed method was proved to have constant time complexity and to be quite invariant to noise.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.9C
• /
• pp.914-920
• /
• 2006

In this paper, we introduce a new partial transmit sequence (PTS) orthogonal frequency division multiplexing (OFDM) scheme with low computational complexity. In the proposed scheme, $2^n$-point inverse fast Fourier transform (IFFT) is divided into two parts. An input symbol sequence is partially transformed using the first l stages of IFFT into an intermediate signal sequence and the intermediate signal sequence is partitioned into a number of intermediate signal subsequences. Then, the remaining n - l stages of IFFT are applied to each of the intermediate signal subsequences and the resulting signal subsequences are summed after being multiplied by each member of a set of W rotating vectors to yield W distinct OFDM signal sequences. The one with the lowest peak to average power ratio (PAPR) among these OFDM signal sequences is selected for transmission. The new PTS OFDM scheme reduces the computational complexity while it shows almost the same performance of PAPR reduction as that of the conventional PTS OFDM scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.11C
• /
• pp.1087-1094
• /
• 2007

In this paper, we propose a new peak-to-average power ratio (PAPR) reduction scheme of orthogonal frequency division multiplexing (OFDM) system, called a modified selected mapping (SLM) scheme, which considerably reduces the computational complexity with keeping the similar PAPR reduction performance compared with the conventional SLM scheme. The proposed scheme is analytically and numerically evaluated for the OFDM system specified in the IEEE 802.16 standard. For the OFDM system with 2048 subcarriers, the proposed scheme with 4 binary phase sequences can reduce the complex multiplications by 63.5% with the similar PAPR reduction compared with the SLM scheme with 16 binary phase sequences.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.6C
• /
• pp.480-486
• /
• 2008

The high peak-to-average power ratio (PAPR) of the transmitted signals is one of major drawbacks of the orthogonal frequency division multiplexing (OFDM). A partial transmit sequences (PTS) technique can improve the PAPR statistics of OFDM signals. However, in a PTS technique, the search complexity to select phase weighting factors increases exponentially with the number of sub-blocks. In this paper, a PTS technique with low computational complexity is presented, which adopts micro-genetic algorithm(${\mu}$-GA) as a search algorithm. A search on the phase weighting factors starts with a population of five randomly generated individuals. An elite having the largest fitness value and the other four individuals selected through the tournament selection strategy are determined, and then the next generation members are generated through the crossover operations among those. If the new generation converges, all the four individuals except the elite are randomly generated again. The search terminates when there has been no improvements on the PAPR during the predefined number of generations, or the maximum number of generations has been reached. To evaluate the performance of the proposed PTS technique, the complementary cumulative distribution functions (CCDF) of the PAPR are compared with those of the conventional PTS techniques.

• Journal of IKEEE
• /
• v.26 no.1
• /
• pp.27-35
• /
• 2022

This paper proposes an ultrasound vessel-pattern imaging algorithm with low computational complexity. The proposed imaging algorithm reconstructs blood-vessel patterns by only detecting blood flow, and can be applied to a real-time signal processing hardware that extracts an ultrasonic finger-vessel pattern. Unlike a blood-flow imaging mode of typical ultrasound medical imaging device, the proposed imaging algorithm only reconstructs a presence of blood flow as an image. That is, since the proposed algorithm does not use an I/Q demodulation and detects a presence of blood flow by accumulating an absolute value of the clutter-filter output, a structure of the algorithm is relatively simple. To verify a complexity of the proposed algorithm, a simulation model for finger vessel was implemented using Field-II program. Through the behavioral simulation, it was confirmed that the processing time of the proposed algorithm is around 54 times less than that of the typical color-flow mode. Considering the required main building blocks and the amount of computation, the proposed algorithm is simple to implement in hardware such as an FPGA and an ASIC.

• Journal of Advanced Navigation Technology
• /
• v.11 no.4
• /
• pp.430-436
• /
• 2007

In this paper, we assume the uplink multiuser MIMO system based on FDD. Considering the implementation of practical system, Antenna selection and Transmit Beamforming scheme are suggested. System model of both two schemes are introduced and the scheduling algorithm which approaches the optimal performance with affordable computational complexity is proposed for each transmission scheme. Simulation results show that the sum-rate of the proposed low complexity scheduler approaches the performance of brute-force scheduler which is believed to be the optimal scheme.