• Title/Summary/Keyword: QR Decomposition

Search Result 82, Processing Time 0.022 seconds

Extended-list SQRD-based Decoder for Improving BER Performance in V-BLAST Systems (V-BLAST 시스템에서의 BER 성능 향상을 위한 Extended-list SQRD-based Decoder)

  • PHAM Van-Su;LE Minh-Tuan;YOON Giwan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.7
    • /
    • pp.1452-1457
    • /
    • 2005
  • In the QR Decomposition-based (QRD) decoding class, the system performance is sensitive to the error propagation. Thus, it is critical to correctly decode the previous layers. One apprach to desensitize the error propagation is to propose the optimal decoding order of layers. In this wort we propose a new extended-list Soled QRD-based (SQRD) decoding approach. In the proposed decoding scheme, the solution of the few first layers is extended as the list of promising possible solutions. By doing so, the diversity of the lowest layer is increased. As a result, the system performance is less sensitive to the error propagation than its counterparts. The proposed approach is verified by the computer simulation results.

A Soft Output Enhancement Technique for Spatially Multiplexed MIMO Systems (공간다중화 MIMO 시스템을 위한 Soft Output 성능향상 기법)

  • Kim, Jin-Min;Im, Tae-Ho;Kim, Jae-Kwon;Yi, Joo-Hyun;Cho, Yong-Soo
    • 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.

Low-Complexity Soft-MIMO Detection Algorithm Based on Ordered Parallel Tree-Search Using Efficient Node Insertion (효율적인 노드 삽입을 이용한 순서화된 병렬 트리-탐색 기반 저복잡도 연판정 다중 안테나 검출 알고리즘)

  • Kim, Kilhwan;Park, Jangyong;Kim, Jaeseok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37A no.10
    • /
    • pp.841-849
    • /
    • 2012
  • This paper proposes an low-complexity soft-output multiple-input multiple-output (soft-MIMO) detection algorithm for achieving soft-output maximum-likelihood (soft-ML) performance under max-log approximation. The proposed algorithm is based on a parallel tree-search (PTS) applying a channel ordering by a sorted-QR decomposition (SQRD) with altered sort order. The empty-set problem that can occur in calculation of log-likelihood ratio (LLR) for each bit is solved by inserting additional nodes at each search level. Since only the closest node is inserted among nodes with opposite bit value to a selected node, the proposed node insertion scheme is very efficient in the perspective of computational complexity. The computational complexity of the proposed algorithm is approximately 37-74% of that of existing algorithms, and from simulation results for a $4{\times}4$ system, the proposed algorithm shows a performance degradation of less than 0.1dB.

A Study On The Eigen-properties of A 2-D Square Waveguide by the Krylov-Schur Iteration Method (Krylov-Schur 순환법에 의한 2차원 사각도파관에서의 고유치 문제에 관한 연구)

  • Kim, Yeong Min;Kim, Dongchool;Lim, Jong Soo
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.11
    • /
    • pp.28-35
    • /
    • 2013
  • The Krylov-Schur algorithm has been applied to reveal the eigen-properties of the wave guide having the square cross section. The eigen-matrix equation has been constructed from FEM with the basis function of the tangential edge-vectors of the triangular element. This equation has been treated firstly with Arnoldi decomposition to obtain a upper Hessenberg matrix. The QR algorithm has been carried out to transform it into Schur form. The several eigen values satisfying the convergent condition have appeared in the diagonal components. The eigen-modes for them have been calculated from the inverse iteration method. The wanted eigen-pairs have been reordered in the leading principle sub-matrix of the Schur matrix. This sub-matrix has been deflated from the eigen-matrix equation for the subsequent search of other eigen-pairs. These processes have been conducted several times repeatedly. As a result, a few primary eigen-pairs of TE and TM modes have been obtained with sufficient reliability.

Application SVD-Least Square Algorithm for solving astronomical ship position basing on circle of equal altitude equation

  • Nguyen, Van Suong;Im, Namkyun
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2013.10a
    • /
    • pp.130-132
    • /
    • 2013
  • This paper presents an improvement for calculating method of astronomical vessel position with circle of equal altitude equation based on using a virtual object in sun and two stars observation. In addition, to enhance the accuracy of ship position achieved from solving linear matrix system, and surmount the disadvantages on rank deficient matrices situation, the authors used singular value decomposition (SVD) in least square method instead of normal equation and QR decomposition, so, the solution of matrix system will be available in all situation. As proposal algorithm, astronomical ship position will give more accuracy than previous methods.

  • PDF

Fast Adaptive Parameter Estimation Algorithm using Unit Vector (단위 벡터를 이용한 고속 적응 계수 예측 알고리즘)

  • Cho, Ju-Phil
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.8 no.3
    • /
    • pp.1-7
    • /
    • 2008
  • This paper proposes a new QRD-LS adaptive algorithm with computational complexity of O(N). The main idea of proposed algorithm(D-QR-RLS) is based on the fact that the computation for the unit vector of is made from the process during Givens Rotation. The performance of the algorithm is evaluated through computer simulation of FIR system identification problem. As verified by simulation results, this algorithm exhibits a good performance. And, we can see the proposed algorithm converges to optimal coefficient vector theoretically.

  • PDF

Camera Calibration and Barrel Undistortion for Fisheye Lens (차량용 어안렌즈 카메라 캘리브레이션 및 왜곡 보정)

  • Heo, Joon-Young;Lee, Dong-Wook
    • 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.

QRD-LS Adaptive Algorithm with Efficient Computational Complexity (효율적 계산량을 가지는 QRD-LS 적응 알고리즘)

  • Cho, Hae-Seong;Cho, Ju-Phil
    • Journal of Satellite, Information and Communications
    • /
    • v.5 no.1
    • /
    • pp.85-89
    • /
    • 2010
  • This paper proposes a new QRD-LS adaptive algorithm with computational complexity of O(N). The main idea of proposed algorithm(D-QR-RLS) is based on the fact that the computation for the unit vector of is made from the process during Givens Rotation. The performance of the algorithm is evaluated through computer simulation of FIR system identification problem. As verified by simulation results, this algorithm exhibits a good performance. And, we can see the proposed algorithm converges to optimal coefficient vector theoretically.