Using Spatio-Temporal Duality for Memory-Efficient Non-Uniform Fourier Transformation with Field Correction

Keywords

according achieved acquisition additionally although amount applications applies appropriate approximation audience challenging channel channels codes coils completeness complex complexity computational computed computer concerned conjugates considered constraint constraints consuming consumption context contrast convergence cores correction covers dataset datasets denote design designed differential diminishing dissipative distributed dynamics easily encoding equation except excitation excited exhibits experiment field flexibility formation frame gives graphics grid grids hardware hours hypothetical illustrate individual inherent inherently instruments inverse libraries limits linear local logical machine magnitude massively matrices matrix measured memory money needed neglecting next noted numeric operation operator parallel part particularly perfect performance population presence principle process product production programmed progressing proposed pulses random reached real receive reciprocity reconstruct reconstructed reconstruction reconstructions respectively restricting reversal reversing rules schemes sensitivities shah shape shot simple simulation simulator simulators solutions space speedups spiral strikingly suited symmetries synthesis systems target temporal theory thereby trajectory transform transformation transmit transmitters typical uniform usually validity violated