Back to search

University of Illinois Urbana-Champaign

Design space exploration of binary algebraic hard decision decoders for data center connectivity

Abstract

dc:description

The recent adoption of large artificial intelligence models with trillions of parameters has introduced the need for new connectivity solutions. These complex models are trained within data centers, involving coordinated execution across thousands of compute nodes, which requires the connectivity between these compute sockets to support higher data rates with lower latency and energy costs. This justifies a need to re-evaluate current communication systems and design connectivity links capable of supporting the rapidly growing compute and energy consumption of these future workloads. Forward error correction is a key component in enabling high-throughput, low-latency, and energy-efficient communication links, reducing the need for costly protocol-level retransmission and relaxing the signal-to-noise ratio requirements on the channel and analog front-end circuits. However, the design space of forward error correction implementations is vast, spanning across diverse families of codes, each with their corresponding decoding algorithms and very large-scale integration architectures. In this thesis, we explore the design space of binary algebraic hard decision decoders for connectivity. We first analyze and derive specifications on FEC for short-reach connectivity. These stringent requirements indicate that published works and implementations from communication standards do not meet these requirements. Therefore, we hypothesize that algebraic hard decision decoders, under a modern process node, are suitable baselines for connectivity due to their efficient decoding algorithms and high-speed architectures. We justify this both information-theoretically and experimentally, using a design space exploration methodology with place-and-routed circuit data points in a 28 nm process. From this exploration, we find that these algebraic decoders meet the connectivity specifications quite comfortably, which validates our hypothesis and provides a strong baseline to design decoders for future workloads.

Degree

thesis:*
Name thesis:degree_name
M.S.
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
Electrical & Computer Engr
Grantor
University of Illinois Urbana-Champaign
Year dc:date
2025

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Lee, Gene
Contributors dc:contributor
  • Shanbhag, Naresh R.

Subjects

dc:subject × 5

Rights

dc:rights
Statement dc:rights
  • Copyright 2025 Gene Lee
Language dc:language
en, eng

Identifiers

dc:identifier.*
Handle dc:identifier
https://hdl.handle.net/2142/130216

Chain of custody

source
Harvested from
University of Illinois - Urbana-Champaign
Base URL
www.ideals.illinois.edu/oai-pmh
Last updated
2026-07-22
Source record
OAI-PMH GetRecord
citation

Lee, Gene. Design space exploration of binary algebraic hard decision decoders for data center connectivity. Thesis thesis, University of Illinois Urbana-Champaign, 2025. https://hdl.handle.net/2142/130216