Hobbits and Mathematics, Continued

There's another connection besides Bilbo Baggins, PhD. I recently came across the MERRY and FRODO algorithms:

The MERRY algorithm (Multicarrier Equalization by Restoration of Redundancy) makes use of the redundancy of the data introduced by the cyclic prefix (CP).…

………

MERRY can be extended to compare multiple samples in the CP to multiple samples at the end of the symbol. As shown in Figure 4, each difference term that is added to the cost function produces a different window with a different delay, and the (somewhat smaller) overall window is the union of the individual windows. This allows the option of using more data, increasing the convergence rate at the expense of over-shortening the channel. This cousin to MERRY is called Forced Redundancy with Optional Data Omission (FRODO).…

On the other hand, I don't think they award either Fields Medals or Nobel Prizes for far-fetched acronyms.