• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1C
• /
• pp.43-50
• /
• 2007

In the paper, we address QRM-MLD (Maximum Likelihood Detection with QR Decomposition and M-algorithm) signal detection method for spatially multiplexed MIMO (Multiple Input Multiple Output) systems. Recently, the QRM-MLD signal detection method which can achieve 1Gbps transmission speed for next generation mobile communication was implemented in a MIMO testbed for the mobile moving at a pedestrian speed. In the paper, we propose a novel signal detection method 'reduced complexity QRM-MLD' that achieves identical error performance as the QRM-MLD while reducing the computational complexity significantly. We rigorously compare the two detection methods in terms of computational complexity to show the complexity reduction of the proposed method. We also perform a set of computer simulations to demonstrate that two detection methods achieve identical error performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11A
• /
• pp.1244-1252
• /
• 2004

In this paper, we derive some properties of linear detectors (zero forcing or minimum mean square error) at spatial multiplexing systems with alamouti's space-time block code. Based on the derived properies, this paper proposes low-complexity receivers. Implementing MMSE detector adaptively, the number of weight vectors to be calculated and updated is greatly reduced with the derived properties compared to the conventional methods. In the case of recursive least square algorithm, with the proposed approach computational complexity is reduced to less than the half. We also identify that sorted QR decomposition detector, which reduces the complexity of V-Blast detector, has the same properties for unitary matrix Q and upper triangular matrix R. A complexity reduction of about 50%, for sorted QR decomposition detector, can be achieved by using those properties without the loss of performance.

• Proceedings of the KIEE Conference
• /
• 2005.11b
• /
• pp.217-219
• /
• 2005

This paper describes implicit restated arnoldi method algorithm and Its application to small size power systems In order to observe the salient features of IRAM algorithm. Two area system with 36 state variables and England 39-bus system with 150 state variables have been tested using IRAM, and the eigenvalue results of IRAM are compared with those of the results obtained from QR method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.7
• /
• pp.1393-1400
• /
• 2017

As the number of smartphone users increases, vulnerability to privacy protection is increasing. This is because personal information is stored on various servers connected to the Internet and the user is authenticated using the same ID and password. Authentication methods such as OTP, FIDO, and PIN codes have been introduced to solve traditional authentication methods, but their use is limited for authentication that requires sharing with other users. In this paper, we propose the authentication method that is needed for the management of shared information such as hospitals and corporations. The proposed algorithm is an algorithm that can authenticate users in the same place in real time using smart phone IMEI, QR code, BLE, push message. We propose an authentication algorithm that can perform user authentication through mutual cooperation using a smart phone and can cancel realtime authentication. And we designed and implemented a mutual authentication system using proposed algorithm.

• Journal of Biomedical Engineering Research
• /
• v.25 no.2
• /
• pp.129-135
• /
• 2004

In the home health management system, we often face the situation to handle biological signals that are frequently measured from normal subjects. In such a case, it is necessary to decide whether the signal at a certain moment is normal or abnormal. Since ECC is one of the most frequently measured biological signals, we describe algorithms that detect QRS-complex and decide whether it is normal or abnormal. The developed QRS detection algorithm is a simplified version of the conventional algorithm providing enough performance for the proposed application. The developed classification algorithm that detects abnormal from mostly normal beats is based on QRS width, R-R interval and QRS shape parameter using Karhunen-Loeve transformation. The simplified QRS detector correctly detected about 99% of all beats in the MTT/BIH ECG database. The classification algorithm correctly classified about 96% of beats as normal or abnormal. The QRS detection and classification algorithm described in this paper could be used in home health management system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.9C
• /
• pp.734-742
• /
• 2008

In spatially multiplexed MIMO systems that enable high data rate transmission over wireless communication channels, the spatial demultiplexing at the receiver is a challenging task and various demultiplexing methods have been developed. Among the previous methods, maximum likelihood detection with QR decomposition and M-algorithm (QRM-MLD), sphere decoding (SD), QOC, and MOC schemes have been reported to achieve a (near) maximum likelihood (ML) hard decision performance. In general, however, the reliability of soft output of these schemes is not satisfactory. In this paper, we propose a method which enhances the reliability of soft output. By computer simulations, we demonstrate the improved performance by the proposed method.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2005.11a
• /
• pp.13-16
• /
• 2005

It would be desirable to have methods for specific problems, which have low communication costs compared to the computation costs, and in specific applications, algorithms need to be developed and mapped onto parallel computer architectures. Main memory access for shared memory system or global communication in message passing system deteriorate the computation speed. In this paper, it is found that the m-step generalization of the block Lanczos method enhances parallel properties by forming m simultaneous search direction vector blocks. QR factorization, which lowers the speed on parallel computers, is not necessary in the m-step block Lanczos method. The m-step method has the minimized synchronization points, which resulted in the minimized global communications compared to the standard methods.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.62 no.9
• /
• pp.1270-1275
• /
• 2013

A lot of research about camera calibration and lens distortion for wide-angle lens has been made. Especially, calibration for fish-eye lens which has 180 degree FOV(field of view) or above is more tricky, so existing research employed a huge calibration pattern or even 3D pattern. And it is important that calibration parameters (such as distortion coefficients) are suitably initialized to get accurate calibration results. It can be achieved by using manufacturer information or lease-square method for relatively narrow FOV(135, 150 degree) lens. In this paper, without any previous manufacturer information, camera calibration and barrel undistortion for fish-eye lens with over 180 degree FOV are achieved by only using one calibration pattern image. We applied QR decomposition for initialization and Regularization for optimization. With the result of experiment, we verified that our algorithm can achieve camera calibration and image undistortion successfully.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2013.06a
• /
• pp.221-222
• /
• 2013

본 논문에서는 채널상태에 기반하여 QRD-M (QR-decomposition based M algorithm)및 QRPIC (parallel interference cancellation using QR-decomposition)을 이용한 검출 기법을 제안한다. 기존의 QRD-M 검출기법은 성능은 좋지만 복잡도가 높고, QRPIC 기법은 성능은 떨어지지만 복잡도가 낮다. 제안된 검출 기법은 채널상태에 따라 QRD-M 검출 기법을 사용할지 QRPIC 검출 기법을 사용할지 결정하게 되므로 기존의 QRD-M 검출 기법보다 성능은 조금 감소하지만 복잡도가 크게 낮아진다.

• Journal of applied mathematics & informatics
• /
• v.8 no.3
• /
• pp.773-793
• /
• 2001

The explicit expressions for the 2n+1 primitive idempotents in R/sub pⁿ/ = F[x]/< x/sup pⁿ/ -1>, where F is the field of prime power order q and the multiplicative order of q modulo pⁿ is ø(pⁿ)/2(n≥1 and p is an odd prime), are obtained. An algorithm for computing the generating polynomials of the minimal QR cyclic codes of length pⁿ, generated by these primitive idempotents, is given and hence some bounds on the minimum distance of some QR codes of prime length over GF(q)(q=2, 3, ...) are obtained.