In multiple-input multiple-output (MIMO) channel (H) communication, when channel status information (CSI) is known to the receiver but not to the transmitter, the precoding technique can achieve a highly reliable communication link, when the receiver informs an optimal precoding matrix index to the transmitter based on current CSI. To select an optimal precoding matrix (F), the maximum capacity...

In this paper, the performance of quadratic residue (QR) codes of lengths within 100 is given and analyzed when the hard decoding, soft decoding, and linear programming decoding algorithms are utilized. We develop a simple method to estimate the soft decoding performance, which avoids extensive simulations. Also, a simulation-based algorithm is proposed to obtain the maximum likelihood decoding...

We describe the implementation of a Monte Carlo basin hopping (BH) global optimization procedure for prediction molecular crystal structures. The BH method is combined with quasi-random (QR) structure generation in hybrid prediction, QR-BH, which combines low-discrepancy sampling provided by QR sequences efficiency at locating low energy Through tests on set single-component crystals and co-cry...

We present an efficient implementation of the multi-shift QR algorithm for computing the eigenvalues of a unitary matrix. The algorithm can perform QR iterations of arbitrary degree, it is conceptually simple, and it is backward stable.

This paper proposes new approximate QR-based algorithms for recursive nonlinear least squares (NLS) estimation. Two QR decomposition-based recursive algorithms are introduced based on the classical Gauss-Newton (GN) and Levenberg-Marquardt (LM) algorithms in nonlinear unconstrained optimization or least squares problems. Instead of using the matrix inversion formula, recursive QR decomposition ...

In this paper, we extend the well known QR-updating scheme to a similar but more versatile and generally applicable scheme for updating the singular value decomposition (SVD). This is done by supplementing the QR-updating with a Jacobi-type SVD procedure, where apparently only a few SVD steps after each QR-update su ce in order to restore an acceptable approximation for the SVD. This then resul...

Barcode technology is one of the most important parts of Automatic Identification and Data Capture (AIDC). Quick Response code (QR code) is one of the most popular types of two-dimensional barcodes. How to decode various QR code images efficiently and accurately is a challenge. In this paper, we revise the traditional decoding procedure by proposing a serial of carefully designed preprocessing ...

The need for scalable algorithms to solve least squares and eigenvalue problems is becoming increasingly important given the rising complexity of modern machines. We address this concern by presenting a new scalable QR factorization algorithm intended to accelerate these problems for rectangular matrices. Our contribution is a communication-avoiding distributed-memory parallelization of an exis...

At Eurocrypt ’02 Cramer and Shoup [7] proposed a general paradigm to construct practical public-key cryptosystems secure against the adaptive chosen ciphertext attack as well as several concrete examples. Using the construction, we present a new variant of the Cramer-Shoup encryption scheme, which is secure against the adaptive chosen ciphertext attack. Our variant is based on the problem relat...

We show how the QR algorithm can be restructured so that it becomes rich in operations that can achieve near-peak performance on a modern processor. The key is a novel algorithm for applying multiple sets of Givens rotations. We demonstrate the merits of this new QR algorithm for computing the Hermitian (symmetric) eigenvalue decomposition and singular value decomposition of dense matrices when...