Topic
QR decomposition
About: QR decomposition is a research topic. Over the lifetime, 3504 publications have been published within this topic receiving 100599 citations. The topic is also known as: QR factorization.
Papers published on a yearly basis
Papers
More filters
03 May 1993
TL;DR: The scaled tangent rotation (STAR) RLS algorithm (STAR-RLS) is designed such that fine-grain pipelining can be accomplished very easily and the computational complexity and inter cell communications are considerably lower than the QRD-R LS algorithm and the square-root free techniques.
Abstract: The QR decomposition based recursive least-squares (RLS) adaptive filtering algorithm (QRD-RLS) has a processing speed limitation. Fine-grain pipelining of the recursive loops within the cells using look-ahead techniques requires large hardware increase. A new scaled tangent rotation (STAR) is used instead of the usual Givens rotations. The scaled tangent rotation (STAR) RLS algorithm (STAR-RLS) is designed such that fine-grain pipelining can be accomplished very easily. The scaled tangent rotation are not exactly orthogonal transformations but tend to become orthogonal asymptotically. Simulation results show that the algorithm performance is similar to that of the QRD-RLS algorithm. The STAR-RLS algorithm can be mapped onto a systolic array. The computational complexity and inter cell communications are considerably lower than the QRD-RLS algorithm and the square-root free techniques. >
13 citations
TL;DR: In this paper, a fixed-complexity sphere encoder (FSE) was proposed for multi-user multi-input multi-output (MU-MIMO) systems.
Abstract: In this paper, we propose a fixed-complexity sphere encoder (FSE) for multi-user multi-input multi-output (MU-MIMO) systems. The proposed FSE accomplishes a scalable tradeoff between performance and complexity. Also, because it has a parallel tree-search structure, the proposed encoder can be easily pipelined, leading to a tremendous reduction in the preceding latency. The complexity of the proposed encoder is also analyzed, and we propose two techniques that reduce it. Simulation and analytical results demonstrate that in a 4 × 4 MU-MIMO system, the proposed FSE requires only 11.5% of the computational complexity needed by the conventional QR decomposition with M-algorithm encoder (QRDM-E). Also, the encoding throughput of the proposed encoder is 7.5 times that of the QRDM-E with tolerable degradation in the BER performance, while achieving the optimum diversity order.
13 citations
01 Dec 2014
TL;DR: Simulation results indicate that the proposed watermarking method is highly robust against different attacks, has high data payload and provides good imperceptible watermarked sounds, and shows superior performance than the state-of-theart water marking methods reported recently.
Abstract: This paper presents a blind audio watermarking method based on lifting wavelet transform (LWT) and QR decomposition (QRD) for audio copyright protection. In our proposed method, initially the original audio is segmented into non-overlapping frames. Watermark information is embedded into the largest element of the upper triangular matrix obtained from the low frequency LWT coefficients of each frame. A blind watermark detection technique is introduced to identify the embedded watermark under various attacks. Simulation results indicate that the proposed watermarking method is highly robust against different attacks. In addition, it has high data payload and provides good imperceptible watermarked sounds. Moreover, it shows superior performance than the state-of-theart watermarking methods reported recently.
13 citations
19 May 2013
TL;DR: This paper presents a high speed multi-dimensional (M-D) coordinate rotation digital computer (CORDIC) based QRD architecture that is enabled by exploiting multiple annihilations in a single CORDic operation and removing data dependencies between two CORDIC operations in Householder-based QRD process.
Abstract: Conventional QR decomposition (QRD) hardware with a large size of channel matrix suffers from very low throughput and large latencies This paper presents a high speed multi-dimensional (M-D) coordinate rotation digital computer (CORDIC) based QRD architecture The novel high speed M-D architecture is enabled by exploiting multiple annihilations in a single CORDIC operation and removing data dependencies between two CORDIC operations (evaluation and application CORDIC) in Householder-based QRD process The proposed QRD architecture can compute 4×4 complex R matrix for every 8 clock cycles Our QRD hardware for 4×4 channel matrix was implemented using Samsung 013μm CMOS process, and the experimental results show that the proposed architecture achieves 474x speed-up compared to the conventional hybrid M-D based QRD
13 citations
TL;DR: In this paper, the matrix pencil method was used to compute the eigenvalues of the fundamental component by reducing the matrix order to two, and QR factorization and similarity transformation were introduced to compute eigen values.
Abstract: This paper proposes a fast phasor estimation method for power systems. Using the matrix pencil method, the multiplication of the pseudoinverse of the sampling matrix and the reference signal matrix constructs a square matrix. The fundamental sinusoidal component of the signal is derived by finding the eigenvalues of this square matrix. QR factorization and similarity transformation are introduced to compute the eigenvalues of the fundamental component by reducing the matrix order to two. The proposed method is compared with recently proposed methods, including the Fourier algorithm and least-square method. Extensive simulation results demonstrate that, with only half-cycle sampling data, the presented method has low computational complexity and its high accuracy is not affected by harmonics or decaying dc component even during the transient process.
13 citations