Description: MIMO系统的典型zf均衡器的算法C＋＋实现。brief ZF Equalizer, i.e. Matrix inversion and multiplication
block, i.e. the solution of a linear equation system. Platform: |
Size: 6843 |
Author:吴 昊 |
Hits:
Description: MIMO系统的典型zf均衡器的算法C＋＋实现。brief ZF Equalizer, i.e. Matrix inversion and multiplication
block, i.e. the solution of a linear equation system.-Zf typical MIMO systems equalizer algorithm C to achieve. brief ZF Equalizer, ie Matrix inversion and multiplicationblock, ie the solution of a linear equation system. Platform: |
Size: 6144 |
Author:吴 昊 |
Hits:
Description: 介绍行列划分算法和矩阵相乘并行算法M P I 程序, 给出基于矩阵相乘并行算法的M P I 实现, 分析和讨
论处理器数目、复杂性、矩阵划分、B 子块传递、死锁避免和矩阵数据的获取等问题.-Introduction into the ranks of the matrix multiplication algorithm and parallel algorithm for MPI procedures, give parallel algorithm based on matrix multiplication of the MPI implementation, analysis and discussion of the number of processors, complexity, matrix breakdown, B sub-block transmission, to avoid deadlock and matrix data access and so on. Platform: |
Size: 188416 |
Author:澄海 |
Hits:
Description: This project implements a matrix multiplication in block. This source code is implemented in Visual Basic.NET Platform: |
Size: 83968 |
Author:marciors |
Hits:
Description: Data Encryption by Matrix Multiplication
We will only use numbers 0 to 26 for the encryptive mathematics operation. Numbers from 1 to 26 are for letters from A to Z and 0 is for all non-letter characters. To minimize usage of numbers, all letters are converted to upper case. The original message is converted to number array according to the ASCII table and minus 64. We partition whole array into blocks of 8 numbers. The last block may be added several zeros. Then multiply each block by the an 8x8 matrix A which is invertible in Z27 to get cipher data. The decryption is the same process except to use its inverse matrix B. For good visual reading, we convert all non-letter characters to under score for the decryption.
-Data Encryption by Matrix Multiplication
We will only use numbers 0 to 26 for the encryptive mathematics operation. Numbers from 1 to 26 are for letters from A to Z and 0 is for all non-letter characters. To minimize usage of numbers, all letters are converted to upper case. The original message is converted to number array according to the ASCII table and minus 64. We partition whole array into blocks of 8 numbers. The last block may be added several zeros. Then multiply each block by the an 8x8 matrix A which is invertible in Z27 to get cipher data. The decryption is the same process except to use its inverse matrix B. For good visual reading, we convert all non-letter characters to under score for the decryption.
Platform: |
Size: 4096 |
Author:delin |
Hits:
Description: In this paper, the problem of estimation
of fast time-varying radio channels is considered. A
new algorithm, Iterative Channel Estimation is
presented. This algorithm is designed for radio
channel estimation in multiple-input multipleoutput
systems with space-time block coding. The
channel transfer matrix is estimated on the basis of
a previously decoded data, so it can be performed
simultaneously with the data transmission. The
estimation process is a simple operation, just a
multiplication of two matrices. As a result, bit error
rate is reduced. The algorithm is compared to the
differential space-time block codes and verified by
Monte-Carlo simulations. Platform: |
Size: 162816 |
Author:Moyad |
Hits:
Search - block matrix multiplication