• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.5C
• /
• pp.692-699
• /
• 2004

In this paper we studied an implementation of QR decomposition-based RLS algorithm using modified Givens rotation method. Givens rotation can be obtained with a sequence of the CORDIC operations. In order to reduce the computing time of QR decomposition we restricted the number of iterations of the CORDIC operation per a Givens rotation and used double-rotation method to remove the square-root in the scaling factor.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.6 no.2
• /
• pp.199-205
• /
• 2011

This paper presents a QR decomposition processor by exploiting Givens rotation for the GDFE (Generalized Decision Feedback Equalizer). A Givens rotation consists of phase extraction, sine/cosine generation and angle rotation parts. Combining two-stage method (coarse and fine stage) and the fixed-width modified-Booth multiplier, we design an efficient QR decomposition processor. By simulations, it is shown that the proposed QR decomposition processor can be a feasible solution for GDFE.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.49 no.3
• /
• pp.31-37
• /
• 2012

This paper presents an efficient hardware architecture to enable the high-speed Givens rotation-based QR decomposition. The proposed architecture achieves a highly parallel givens rotation process by maximizing the number of pivots selected for parallel zero-insertions. Sign-select lookahed (SSL)-CORDIC is also efficiently used for the high-speed givens rotation. The performance of QR decomposition hardware considerably increases compared to the conventional triangular systolic array (TSA) architecture. Moreover, the circuit area of QR decomposition hardware was reduced by decreasing the number of flip-flops for holding the pre-computed results during the decomposition process. The proposed QR decomposition hardware was implemented using TSMC $0.25{\mu}m$ technology. The experimental results show that the proposed architecture achieves up to 70 % speed-up over the TACR/TSA-based architecture for the $8{\times}8$ matrix decomposition.

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

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.11 no.1
• /
• pp.6-14
• /
• 2011

This paper presents a high-speed QR decomposition architecture for the multi-input-multi-output (MIMO) receiver based on Givens rotation. Under fast-varying channel, since the inverse matrix calculation has to be performed frequently in MIMO receiver, a high performance and low latency QR decomposition module is highly required. The proposed QR decomposition architecture is composed of Sign-Select Lookahead (SSL) coordinate rotation digital computer (CORDIC). In the SSL-CORDIC, the sign bits, which are computed ahead to select which direction to rotate, are used to select one of the last iteration results, therefore, the data dependencies on the previous iterations are efficiently removed. Our proposed QR decomposition module is implemented using TSMC 0.25 ${\mu}M$ CMOS process. Experimental results show that the proposed QR architecture achieves 34.83% speed-up over the Compact CORDIC based architecture for the 4 ${\times}$ 4 matrix decomposition.

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.8C
• /
• pp.782-787
• /
• 2007

This paper presents the D(Diagonal)-QR-RLS algorithm which normalizes the fast algorithm minimizes the MSE by using Givens rotated inputs and analyzes its characteristic. This proposed one has computational complexity of O(N) and the merit that it obtains the coefficients of TDL filter directly. Although this proposed normalized algorithm has the similar form to NLMS algorithm, we can see that D-QR-RLS has superior convergence characteristic to NLMS by computer simulation.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.10
• /
• pp.32-43
• /
• 1994

This paper presents new QRD-based recursive least squares algorithms for bilinear lattice filter. Bilinear recursive least square lattice algorithms are derived by using the QR decomposition for minimization covariance matrix of predication error by applying Givens rotation to the bilinear recursive least squares lattics algorithms. The proposed algorithms are applied to the bilinear system identification to evaluate the performance of algoithms. Computer simulations show that the convergence properties of the proposed algorithms are superior to that of the algorithms proposed by Baik when signal includes the measurement noise.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2003.06a
• /
• pp.238-241
• /
• 2003

This paper presents a nonlinear least squares decision feedback equalizer Bilinear systems are attractive because of the ability to approximate a large class of nonlinear systems efficiently. The nonlinearity of channel is modeled using a bilinear system. The algorithms are derived by using the QR decomposition for minimization covariance matrix of prediction error by applying Givens rotation to the bilinear model. Result of computer simulation experiments that compare the performance of the bilinear DFE to two other DFE's in eliminating the intersymbol interference caused by a nonlinear channel are presented In the paper.

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

This paper proposes one of normalized QR-typed LMS (Least Mean Square) algorithms with computational complexity of O(N). This proposed algorithm shows the normalized property in terms of theoretical characteristics. This proposed algorithm is one of algorithms which normalize variance of input signal in terms of mean because QR-typed LMS is proportional to variance of input signal. In this paper, convergence characteristic analysis of normalized algorithm was made. Computer simulation was made by the algorithms used for echo canceller. Proposed algorithm has similar performance to theoretical value. And, we can see that proposed method shows similar one to performance of NLMS.by comparison among different algorithms.