| タイトル | Efficient multiplication algorithms over the finite fields GF(q sup m), where q equals 3,5 |
| 著者（英） | Truong, T. K.; Reed, I. S.; Cheung, K. M.; Hsu, I. S. |
| 著者所属（英） | Jet Propulsion Lab., California Inst. of Tech. |
| 発行日 | 1988-05-15 |
| 言語 | eng |
| 内容記述 | Finite field multiplication is central to coding theory. For this application, there is a need for a multiplication algorithm which can be realized easily on VLSI chips. A new algorithm is developed which is based on the Babylonian multiplication technique utilizing tables of squares. This algorithm is applied to the finite fields GF(q sup m), where q equals 3 and 5. It is also shown that this multiplier can be used to compute complex multiplications defined on the direct sum of two identical copies of such Galois fields. |
| NASA分類 | COMPUTER PROGRAMMING AND SOFTWARE |
| レポートNO | 88N28191 |
| 権利 | No Copyright |
| URI | https://repository.exst.jaxa.jp/dspace/handle/a-is/233206 |
|
