4 ms·
Faster than an H100 for solving 128x128 matrices. But it’s not clear to me how they tested this, code is only available on request. > We have described a high-
by teruakohatu 1y ago
Faster than an H100 for solving 128x128 matrices. But it’s not clear to me how they tested this, code is only available on request.
> We have described a high-precision and scalable analogue matrix
equation solver. The solver involves low-precision matrix operations,
which are suited well to RRAM-based computing. The matrix operations
were implemented with a foundry-developed 40-nm 1T1R RRAM array
with 3-bit resolution. Bit-slicing was used to guarantee the high preci-
sion. Scalability was addressed through the BlockAMC algorithm, which
was experimentally demonstrated. A 16 × 16 matrix inversion problem
was solved with the BlockAMC algorithm with 24-bit fixed-point preci-
sion. The analogue solver was also applied to the detection process
in massive MIMO systems and showed identical BER performance
within only three iterative cycles compared with digital counterparts
for 128 × 8 systems with 256-QAM modulation.