In a low PHY implementation the resource is rarely spent where a block diagram suggests. The transform, the channel estimation memory and the equaliser dominate, and the memory usually exceeds the arithmetic.
Parallelism is dictated by the deadline. Because a symbol must complete within its period, the datapath is sized for the worst case and then either runs at that rate constantly or is time-shared across bandwidth. Both approaches are defensible; choosing between them is an early architectural decision that is expensive to revisit.
Fixed-point analysis runs alongside rather than afterwards. Word lengths grow through the transform, shrink at the equaliser and are deliberately reduced at the soft-value output where memory cost is highest, and each of those decisions is verified against performance rather than assumed safe.