• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권6호
• /
• pp.2908-2924
• /
• 2019

Multiple input multiple output orthogonal frequency division multiplexing (MIMO-OFDM) is widely applied in wireless communication by virtue of its excellent properties in data transmission rate and transmission accuracy. However, as a major drawback of MIMO-OFDM systems, the high peak-to-average power ratio (PAPR) complicates the design of the power amplifier at the receiver end. Some available PAPR reduction methods such as selective mapping (SLM) suffer from high computational complexity. In this paper, a low-complexity SLM method based on active constellation extension (ACE) and joint space-time selective mapping (AST-SLM) for reducing PAPR in Alamouti STBC MIMO-OFDM systems is proposed. In SLM scheme, two IFFT operations are required for obtaining each transmission sequence pair, and the selected phase vector is transmitted as side information(SI). However, in the proposed AST-SLM method, only a few IFFT operations are required for generating all the transmission sequence pairs. The complexity of AST-SLM is at least 86% less than SLM. In addition, the SI needed in AST-SLM is at least 92.1% less than SLM by using the presented blind detection scheme to estimate SI. We show, analytically and with simulations, that AST-SLM can achieve significant performance of PAPR reduction and close performance of bit error rate (BER) compared to SLM scheme.

• 대한수학회논문집
• /
• 제32권3호
• /
• pp.765-778
• /
• 2017

Finding an initial feasible solution on the central path is the main difficulty of feasible interior-point methods. Although, some algorithms have been suggested to remedy this difficulty, many practical implementations often do not use perfectly centered starting points. Therefore, it is worth to analyze the case that the starting point is not exactly on the central path. In this paper, we propose a weighted-path following interior-point algorithm for solving the Cartesian $P_{\ast}({\kappa})$-linear complementarity problems (LCPs) over symmetric cones. The convergence analysis of the algorithm is shown and it is proved that the algorithm terminates after at most $O\((1+4{\kappa}){\sqrt{r}}{\log}{\frac{x^0{\diamond}s^0}{\varepsilon}}\)$ iterations.

• 한국정보처리학회논문지
• /
• 제6권1호
• /
• pp.42-48
• /
• 1999

최단경로를 포함한 어떤 문제를 해결하는데 필요한 정보가 네트워상의 프로세서에 분산되어 있는 상황에서 그들 정보를 교환하면서, 그 문제를 해결하는 알고리즘을 분산알고리즘(Distributed Algorithm)이라고 한다. 본 논문에서는 비동기식 네트워크에서 최단경로문제를 해결하는 분산 알고리즘을 제안한다. 일반적으로 분산 알고리즘은 메시지 복잡도와 이상시간 복잡도로 평가되는데, 본 논문에서 제안하는 분산 알고리즘이 메시지 복잡도와 이상 시간 복잡도는 각각 O(n53)와 O(nln)이다. 여기서, n은 네트상에 있는 프로세서 수를 나타낸다.

• Journal of the Optical Society of Korea
• /
• 제20권1호
• /
• pp.204-211
• /
• 2016

Oil pollution seriously endangers the biological environment and human health. Due to the diversity of oils and the complexity of oil composition, it is of great significance to identify the oil contaminants. The 3-D fluorescence spectrum combined with a second order correction algorithm was adopted to measure an oil mixture with overlapped fluorescence spectra. The self-weighted alternating trilinear decomposition (SWATLD) is a kind of second order correction, which has developed rapidly in recent years. Micellar solutions of #0 diesel, #93 gasoline and ordinary kerosene in different concentrations were made up. The 3-D fluorescence spectra of the mixed oil solutions were measured by a FLS920 fluorescence spectrometer. The SWATLD algorithm was applied to decompose the spectrum data. The predict concentration and recovery rate obtained by the experiment show that the SWATLD algorithm has advantages of insensitivity to component number and high resolution for mixed oils.

• Journal of Information Processing Systems
• /
• 제17권6호
• /
• pp.1083-1096
• /
• 2021

Compressed sensing-based matching pursuit algorithms can estimate the sparse channel of massive multiple input multiple-output systems with short pilot sequences. Although they have the advantages of low computational complexity and low pilot overhead, their accuracy remains insufficient. Simply multiplying the weight value and the estimated channel obtained in different iterations can only improve the accuracy of channel estimation under conditions of low signal-to-noise ratio (SNR), whereas it degrades accuracy under conditions of high SNR. To address this issue, an improved weighted matching pursuit algorithm is proposed, which obtains a suitable weight value u_op by training the channel data. The step of the weight value increasing with successive iterations is calculated according to the sparsity of the channel and u_op. Adjusting the weight value adaptively over the iterations can further improve the accuracy of estimation. The results of simulations conducted to evaluate the proposed algorithm show that it exhibits improved performance in terms of accuracy compared to previous methods under conditions of both high and low SNR.

• 전기전자학회논문지
• /
• 제26권1호
• /
• pp.67-76
• /
• 2022

In this paper, we propose a new algorithm to improve the accuracy of the Wi-Fi access point (AP) positioning technique. The proposed algorithm based on evaluating the trustworthiness of the signal strength quality of each measurement node is superior to other existing AP positioning algorithms, such as the centroid, weighted centroid, multilateration, and radio distance ratio methods, owing to advantages such as reduction of distance errors during positioning, reduction of complexity, and ease of implementation. To validate the performance of the proposed algorithm, we conducted experiments in a complex indoor environment with multiple walls and obstacles, multiple office rooms, corridors, and lobby, and measured the corresponding AP signal strength value at several specific points based on their coordinates. Using the proposed algorithm, we can obtain more accurate positioning results of the APs for use in research or industrial applications, such as finding rogue APs, creating radio maps, or estimating the radio frequency propagation properties in an area.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권8호
• /
• pp.2626-2646
• /
• 2014

This study presents a power and Physical Resource Blocks (PRBs) joint allocation algorithm to coordinate uplink (UL) interference in the device-to-device (D2D) underlaying Long Term Evolution-Advanced (LTE-A) networks. The objective is to find a mechanism to mitigate the UL interference between the two subsystems and maximize the weighted sum throughput as well. This optimization problem is formulated as a mixed integer nonlinear programming (MINLP) which is further decomposed into PRBs assignment and transmission power allocation. Specifically, the scenario of applying imperfect channel state information (CSI) is also taken into account in our study. Analysis reveals that the proposed PRBs allocation strategy is energy efficient and it suppresses the interference not only suffered by the LTE-A system but also to the D2D users. In another side, a low-complexity technique is proposed to obtain the optimal power allocation which resides in one of at most three feasible power vectors. Simulations show that the optimal power allocation combined with the proposed PRBs assignment achieves a higher weighted sum throughput as compared to traditional algorithms even when imperfect CSI is utilized.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제14권5호
• /
• pp.579-587
• /
• 2014

This paper presents a variable gain amplifier (VGA) for an analog front-end (AFE) of ultrasound medical imaging. This VGA has a closed-loop topology and shows a 37-dB-linear characteristic with a single-stage amplifier. It consists of an op-amp, a non-binary-weighted capacitor array, and a gain-control block. This non-binary-weighted capacitor array reduces the required number of capacitors and the complexity of the gain-control block. The VGA has been fabricated in a 0.35-mm CMOS process. This work gives the largest gain range of 37 dB per stage, the largest P1 dB of 9.5 dBm at the 3.3-V among the recent VGA circuits available in the literature. The voltage gain is controlled in the range of [-10, 27] dB in a linear-in-dB scale with 16 steps by a 4-bit digital code. The VGA has a bandpass characteristic with a passband of [20 kHz, 8 MHz].

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권12호
• /
• pp.3117-3132
• /
• 2012

The tree topology in multicast systems has high transmission efficiency, low latency, but poor resilience to node failures. In our work, some nodes are selected as backbone nodes to construct a tree-like core overlay. Backbone nodes are reliable enough and have strong upload capacity as well, which is helpful to overcome the shortcomings of tree topology. The core overlay is organized into a spanning tree while the whole overlay is of mesh-like topology. This paper focuses on improving the performance of the application-layer multicast overlay by optimizing the core overlay which is periodically adjusted with the proposed optimization algorithm. Our approach is to construct the overlay tree based on the out-degree weighted reliability where the reliability of a node is weighted by its upload bandwidth (out-degree). There is no illegal solution during the evolution which ensures the evolution efficiency. Simulation results show that the proposed approach greatly enhances the reliability of the tree-like core overlay systems and achieves shorter delay simultaneously. Its reliability performance is better than the reliability-first algorithm and its delay is very close to that of the degree-first algorithm. The complexity of the proposed algorithm is acceptable for application. Therefore the proposed approach is efficient for the topology optimization of a real multicast overlay.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제36권10호
• /
• pp.851-860
• /
• 2009

최근 계산을 통한 단백질 상호작용 예측 기법 중, 단백질 쌍이 포함하고 있는 도메인들 사이의 관계에 중점을 둔 도메인 정보 기반 예측 기법들이 다양하게 제안되고 있다. 하지만, 다수의 도메인 쌍들이 상호작용에 기여하는 정도를 정밀하게 반영하는 계산 기법은 드문 실정이다. 본 논문에서는 단백질 상호작용에 있어 도메인 조합 쌍의 상호작용 영향력을 수치화하여 반영한 상호작용 중요도 행렬을 고안하고 이를 기반으로 한 단백질 상호작용 예측 시스템을 구현한다. 일반적인 도메인 조합 기법과 달리, 상호작용 중요도 행렬에서는 상호작용을 위한 도메인간의 협업 확률이 고려된 Weighted 도메인 조합과, 다수의 Weighted 도메인 조합 중 실제 상호작용 주체가 될 확률을 도메인 조합 쌍의 힘(Domain Combination Pair Power, DCPPW)으로 수치화한다. DIP과 IntAct에서 얻어온 S. cerevisiae의 단백질 상호작용 데이터와 Pfam-A 도메인 정보를 사용한 정확도 검증 결과, 평균 63%의 민감도와 94%의 특이도를 확인하였으며, 학습집단의 증가에 따른 안정적인 예측 정확도 향상을 보였다. 본 논문에서 구현한 예측 시스템과 학습 데이터는 웹(http://code.google.com/p/prespi)을 통하여 내려 받을 수 있다.