A survey on FEC techniques for industrial wireless communications

Recei ed 26 Sep embe 2022; e ised 27 Oc obe 2022; accep ed 1 No embe 2022. Da e o publica ion 4 No embe 2022;
da e o cu en e sion 18 No embe 2022. The e iew o his a icle was a anged by Associa e Edi o Thomas I. S asse .
Digi al Objec Iden i ie 10.1109/OJIES.2022.3219607
A Su ey on FEC Techniques o Indus ial
Wi eless Communica ions
LORENZO FANARI 1(G adua e S uden Membe , IEEE), ENEKO IRADIER 1(Membe , IEEE),
IÑIGO BILBAO 1(G adua e S uden Membe , IEEE),
RUFINO CABRERA 1(G adua e S uden Membe , IEEE), JON MONTALBAN 1,2 (Senio Membe , IEEE),
PABLO ANGUEIRA 1(Senio Membe , IEEE), OSCAR SEIJO 3(Membe , IEEE),
AND IÑAKI VAL 3(Senio Membe , IEEE)
1Depa men o Communica ions Enginee ing, Uni e si y o he Basque Coun y (UPV/EHU), 48012 Bilbao, Spain
2Depa men o Elec onic Technology, Uni e si y o he Basque Coun y (UPV/EHU), 48012 Bilbao, Spain
3Ike lan Technology Resea ch Cen e, Basque Resea ch and Technology Alliance (BRTA), 20500 A asa e, Spain
CORRESPONDING AUTHOR: LORENZO FANARI (e-mail: [email p o ec ed]).
This wo k was suppo ed in pa by he Basque Go e nmen unde G an IT1436-22, in pa by he PREDOC unde G an PRE2019_099407, in pa by he Spanish
Go e nmen h ough p ojec PHANTOM (MCIU/AEI/FEDER, UE) unde G an RTI2018-099162-B-I00 and h ough p ojec THERESA unde G an
PID2021-124706OB-I00 unded by MCIN/AEI/10.13039/501100011033 and by ERDF A way o making Eu ope, and in pa by he Basque Go e nmen h ough
p ojec VIRTGRID unde G an Elka ek KK-2022/00069.
ABSTRACT Indus y 4.0 aims o digi ize indus ial p ocesses en i ely, and wi eless echnologies ep esen
one o he enable s o scalable and lexible communica ions. Howe e , he cu en s anda ds and p op ie a y
solu ions do no mee he indus y’s igh equi emen s in undamen al use cases such as ac o y au oma ion
(FA). One o he key esea ch challenges owa d eplacing wi ed ieldbuses wi h wi eless links is he
design o echniques ha enable eal- ime and de e minis ic beha io when ansmi ing sho packe s.
Fo wa d e o co ec ion (FEC) echniques a e c i ical o his objec i e, and coding/decoding algo i hms
mus comply wi h eliabili y and low la ency speci ica ions. This a icle su eys exis ing FEC echniques o
sho packe ansmissions. Compa ed o o he su ey pape s in he ield, we p opose se e al FEC candida e
echniques speci ically sui able o FA wi eless sys ems. We explo e ou o hese echniques, also examining
ha dwa e a chi ec u e p oposals. This a icle p oposes a me hodology o e alua e hei la ency and eliabili y
pe o mance. We inally discuss he lessons lea ned and challenges o u u e esea ch.
INDEX TERMS Complexi y, ac o y au oma ion (FA), o wa d e o co ec ion (FEC), indus ial wi eless
communica ions, Indus y 4.0, la ency, PHY, eliabili y, sho packe ansmission, wi eless communica ions.
ABBREVIATIONS USED IN THIS ARTICLE
3GPP 3 d Gene a ion Pa ne ship P ojec .
5G NR 5G New Radio.
AR3A Accumula e-Repea -3-Accumula e.
AR4JA Accumula e-Repea -by4-Jagged-Accumula e.
AWGN Addi i e whi e Gaussian noise.
ASIC Applica ion speci ic in eg a ed ci cui .
ASIP Applica ion-speci ic ins uc ion se p ocesso .
ATSC Ad anced Tele ision Sys ems Commi ee.
ARQ Au oma ic epea eques .
BM Base ma ix.
BP Belie p opaga ion.
BPSK Bina y phase-shi keying.
B-DMC Bina y-inpu disc e e memo yless channel.
BER Bi e o a e.
BLER Block e o a e.
BCH Bose–Chaudhu i–Hocquenghem.
BPM Bu s posi ion modula ion.
CVA Ci cula Vi e bi algo i hm.
CCSDS Consul a i e commi ee o space da a
sys ems.
CC Con olu ional codes.
CA-Pola CRC-aided pola .
CRC Cyclic edundancy check.
This wo k is licensed unde a C ea i e Commons A ibu ion 4.0 License. Fo mo e in o ma ion, see h ps://c ea i ecommons.o g/licenses/by/4.0/
674 VOLUME 3, 2022
DVB-S2 Digi al Video B oadcas ing - Sa elli e - Second
Gene a ion.
DVB-T2 Digi al Video B oadcas ing - Second Gene a-
ion Te es ial.
DSSS Di ec sequence sp ead spec um.
E2E End- o-end la ency.
FA Fac o y au oma ion.
FPGA Field p og ammable ga e a ays.
FEC Fo wa d e o co ec ion.
GPU G aphics p ocessing uni .
HART Highway add essable emo e ansduce p o o-
col.
HARQ Hyb id au oma ic epea eques .
HAR2D-FI Hyb id channel Access wi h edundancy o e-
liable and de e minis ic Wi-Fi.
IEC In e na ional Elec o echnical Commission.
ISM Indus ial Medical Scien i ic Band.
ISA In e na ional Socie y o Au oma ion.
LDPC Low densi y pa i y check.
LLR Loga i hmic likelihood a io.
LTE Long- e m e olu ion.
LT Luby ans o m.
MAP Maximum a pos e io i.
MediaFLO Media o wa d link only.
MAC Medium access con ol laye .
MBMS Mul imedia b oadcas mul icas se ices.
NASA Na ional Ae onau ics and Space Adminis a-
ion.
OMNET++ Objec i e Modula Ne wo k Tes bed in C++.
OSI Open sys ems in e connec ion model.
OSD O de ed s a is ics decoding.
OFDMA O hogonal equency-di ision mul iple access.
OFDM O hogonal- equency di ision mul iplexing.
PER Packe e o a e.
PLR Packe loss a e.
PCCC Pa allel conca ena ed con olu ional codes.
H Pa i y check ma ix.
PHY Physical laye .
PPDU Physical laye p o ocol da a uni .
PAC Pola iza ion-adjus ed con olu ional codes.
PEG Powe edge g ow h.
PA P ocess au oma ion.
QPSK Quad a u e phase-shi keying.
QC Quasi-cyclic.
RAN Radio access ne wo k.
RS Reed–Solomon.
SCCC Se ial conca ena ed con olu ional codes.
SNR Signal- o-noise a io.
SDR So wa e-de ined adio.
SVC Spa se ec o code.
SCF Successi e cancella ion lip.
SCL Successi e cancella ion lis .
SHARP Synch onous and hyb id a chi ec u e o eal-
ime pe o mance.
TBCC Tailbi ing con olu ional codes.
TDMA Time-di ision mul iple access.
TPC Tu bo p oduc codes.
URLLC Ul a eliable low la ency communica ions.
UWB Ul awideband.
UMTS Uni e sal mobile elecommunica ions sys em.
USRP Uni e sal so wa e adio pe iphe als.
Wi elessHP Wi eless high-pe o mance.
WIA-FA Wi eless ne wo ks o indus ial au oma ion-
dac o y au oma ion.
WPAN Wi eless pe sonal a ea ne wo k.
WiMAX Wo ldwide in e ope abili y o mic owa e ac-
cess.
WAVA W ap-a ound Vi e bi algo i hm.
ZTBCC Ze o ailbi ing con olu ional codes.
I. INTRODUCTION
The ou h indus ial e olu ion, also e e ed o as Indus-
y 4.0, is one o he mos p omising ields whe e esea ch
on in o ma ion echnologies is unde de elopmen . I s p in-
cipal goal is o digi alize he en i e indus ial p ocess. The
ansi ion equi es he inclusion o he la es communica ion
echnologies: wi eless ne wo ks, ac ile in e ne , In e ne o
Things, and in gene al, he op imiza ion o he so-called
cybe -physical sys ems. Wi eless communica ions b ing sig-
ni ican ad an ages o his scena io while posing ele an
echnological challenges [1].
Rega ding he wi eless ansi ion, nume ous ac o s om
bo h he indus ial wo ld [2], [3], [4], [5], as well as om
he s anda diza ion commi ees [6], [7], [8] ha e es ablished
se e al guidelines o success ul wi ed o wi eless ansi ion
in a a ie y o scena ios [4]. Indeed, he indus ial wo ld en-
compasses di e se en i onmen s, which di e in applica ions
and en i onmen al p ope ies. Some examples a e ac o y p o-
duc ion p ocesses o ac o y au oma ion (FA), su eillance
sys ems, elec ici y p oduc ion asse s, anspo in as uc u e,
oil p oduc ion, chemical ma e ial handling, e c. FA is among
he mos challenging use cases o ad hoc wi eless sys em
design and deploymen . Con a y o he adi ional equi e-
men s o gene ic wi eless communica ions, which en ail he
ansmission o la ge-size da a, FA wi eless communica ions
in ol e he ansmission o sho da a packe s wi h high elia-
bili y and educed la ency.
A. FIELDS OF APPLICATION FOR FA
FA comp ises di e en ields o applica ion ha a e necessa y
o he ope a ions o moni o ing and con olling in he indus-
ial en i onmen . These p ocesses a e dis inguishable among
c i ical and nonc i ical p ocesses. Based on he c i icali y le el
o he p ocesses, se e al laye s o he Open Sys ems In e con-
nec ion model (OSI model) ha e o be adap ed [9].
Nume ous playe s om he indus ial wo ld [2], [3], [4], [5]
and om s anda diza ion commi ees [6], [7], [8] ha e sug-
ges ed hei use case ision o FA, and de ining he desi ed
pe o mance a he MAC laye . Howe e , such guidelines a e
challenging o accomplish in he case o highly c i ical o
sa e y communica ions. Few p oposals o e pa ial solu ions
VOLUME 3, 2022 675
FANARI ET AL.: SURVEY ON FEC TECHNIQUES FOR INDUSTRIAL WIRELESS COMMUNICATIONS
TAB LE 1. P oposed Fields o Applica ion
ha , ne e heless, do no en i ely ul ill he equi ed pe o -
mance ange [10]. Table 1 p esen s a classi ica ion o he ields
o applica ion o he indus ial wi eless sys ems as a unc ion
o he link-le el equi emen s. The de ini ion o equi emen s
ollows he guidelines o [4], [7]. We ha e conside ed h ee
key pa ame e s: payload leng h, eliabili y, and la ency. Re-
liabili y and la ency a e de ined as packe e o a e (PER)
and end- o-end (E2E) la ency. The PER e alua es he co ec
in e p e a ion o he message, while he E2E la ency es ima es
he ime in e al be ween he da a gene a ion and i s u u e
ecep ion a he MAC laye .
Based on he p esen ed pa ame e s, h ee p ominen ields
o applica ion a e ecognized: Non-c i ical communica ions,
which include, o example, moni o ing ope a ions and in-
ol e less s ingen equi emen s. Exis ing wi eless ech-
nologies a e cu en ly applied in such scena ios. C i ical
communica ions demand communica ion sys ems designed
o p o ec people, machines, and p oduc ion p ocesses. Such
scena ios deno e s ic eliabili y and la ency equi emen s.
Finally, he case o sa e y communica ions co e s all he
isk educ ion ope a ions associa ed wi h pe sonnel and
equipmen damage p e en ion and p o ec ion. In his case,
he communica ions equi e ex emely low la ency da a
ans e .
B. WHY FEC?
Op imizing all ISO/OSI laye s owa ds eal- ime communi-
ca ions [9] is necessa y o he demanded pe o mance o
FA ields o applica ion. Focusing on he PHY laye , wo
s a egies can be conside ed [11]. Fi s , he au oma ic e-
pea eques (ARQ) echniques in oduce some check-bi s in
he ansmi ed packe o e ansmi ing he e oneous mes-
sages. Howe e , on he o he hand, e ansmissions in oduce
undesi able delay du ing he packe ansmission [12]. The
o he s a egy is he FEC. These echniques include some
edundancy bi s wi hin he packe du ing ansmission. A
he ecei e , his edundancy allows he de ec ion and e o
co ec ion o he ecei ed message, a oiding he delay e ec
discussed in he p e ious case. Consequen ly, including FEC
echniques wi hin he indus ial wi eless sys ems has po en ial
bene i s o achie ing he desi ed pe o mance in e ms o
eliabili y and la ency. The equi emen s ha e been b ie ly
in oduced in Sec ion I-A.
C. RELATED WORKS AND CONTRIBUTIONS
1) RELATED WORKS
Despi e a la ge body o su eys on FEC o sho packe
ansmissions, only [20] a emp s o add ess some issues e-
la ed o FA. The majo i y o he encoun e ed su eys ocus
on URLLC, which equi es di e en pe o mances ela ed o
la ency and eliabili y. Howe e , hei esul s a e essen ial o
he de elopmen o his opic.
Sybis e al. [13] compa e di e en FEC candida es o
5G URLLC communica ions, p e iously iden i ied by 3GPP.
Analysis o bo h eliabili y and complexi y a e p oposed,
conside ing di e en decoding algo i hms. Li a e al. [14]
p esen a su ey o mode n codes o sho packe ansmis-
sion. Iscan e al. [15] compa e di e en FEC schemes o
5G URLLC communica ions. Mo eo e , di e en decoding
algo i hms a e included in he s udy. Wu e al. [27], o
sho packe communica ions made wi h SDR, analyzes di -
e en FEC candida es. Tzimp agos e al. [17] e iew di e en
FEC schemes o 100-Gb/s op ical ne wo ks. Also, an analy-
sis o he published esul s is included. Shi animoghaddam
e al. [18] e iew he s a e o he a o he FEC echniques o
URLLC. Mo eo e , a compa ison o eliabili y and decoding
complexi y analyzes di e en decoding algo i hms. The e-
sul s a e ob ained om MATLAB simula ions. Qiao e al. [19]
compa e he pe o mance o nume ous FEC wi hin a lexible
ASIP decode . Zhan e al. [20] analyzes FEC candida es o
Wi elessHP. This wo k also o e s u u e di ec ions o design-
ing FEC schemes o indus ial con ol applica ions. Hajiya
e al. [21] compa e di e en candida es o 5G machine- ype
communica ions. Shao e al. [22] analyze he published e-
sul s o he ASIC implemen a ions o di e en 3GPP FEC
echniques. Ahmed e al. [23] in hei su ey ocused on
add essing he design o u u e ARQ schemes, e iews sui -
able FEC echniques. In [24], Habib e al. s udy di e en
decoding algo i hms o LDPC un he con ex o Rein o ce
Lea ning. Lian e al. compa e di e en decoding algo i hms
o TBCC and Pola in e ms o eliabili y and complex-
i y [25]. Fe az e al. [26] analyze and compa e nume ous
decoding algo i hms o LDPC add essing issues associa ed
wi h high- h oughpu and low ene gy consump ion.
Table 2 ou lines he exis ing su ey a icles and jus i-
ies how hese publica ions di e om his su ey a icle.
Nowadays, no su eys in he li e a u e simul aneously e iew
nume ous FEC echniques o sho packe ansmission and
add ess he a chi ec u al and design p oblems o he FEC
echniques o FA ields o Applica ion.
2) CONTRIBUTIONS
The su eys a ailable in he li e a u e do no add ess he
speci ic challenges o FA communica ions. An excep ion is
gi en by [20], whose main con ibu ion consis s o su ey-
ing a se o candida e codes, and hen, sugges ing an ad
hoc se o a chi ec u es. Howe e , his wo k lacks he anal-
ysis o decoding algo i hms. To he bes o ou knowledge,
he e is no comp ehensi e su ey in he li e a u e abou FEC
676 VOLUME 3, 2022
TAB LE 2. Rela ed Wo ks
echniques o FA wi eless sys ems ha add ess a he same
ime eliabili y and la ency aspec . Mo eo e , exis ing su eys
nei he conside heo e ical no ha dwa e implemen a ion
esul s.
The main con ibu ions o his a icle a e summa ized as
ollows.
1) A comp ehensi e axonomy o se e al FEC echniques
de eloped o sho packe communica ions. These
echniques a e classi ied in o block and memo y codes,
and hei ea u es a e collec ed and compa ed in a able.
The ea u es a e associa ed wi h he equi emen s o he
FA use cases. The bes -pe o ming FEC echniques a e
conside ed as candida es.
2) Fo each candida e, se e al decoding a chi ec u e p o-
posals a e compiled and analyzed. The ga he ed esul s
ha e been ound om he in o ma ion- heo e ic and
echnique-o ien ed li e a u e. Mo eo e , we compa e
hose con ibu ions by using eliabili y and la ency me -
ics. Some examples a e BLER and he numbe o
equi ed clock cycles.
3) As he esul s o he p e ious con ibu ions, he
au ho s p o ide some me ics o e alua ing he FEC
pe o mance wi hin FA wi eless sys ems. Finally, he
sugges ed me ics a e used o benchma k he candida es.
4) Some lessons lea ned and u u e challenges a e
ou lined.
D. ARTICLE OUTLINE
The es o his a icle is o ganized as ollows. Sec ion II
desc ibes he esea ch me hod adop ed o he p oposed li -
e a u e e iew. Sec ion III b ie ly desc ibes FEC and de ines
he me ics analyzed in his su ey. Sec ion IV o e s s a e-
o - he-a o se e al FEC echniques sui able o sho packe
communica ions ocusing on FA. Sec ion V e iews he in-
dus ial wi eless sys ems p oposed, analyzing hei FEC. This
Sec ion also includes he candida es de ec ed by he au ho s
in Sec ion IV. Sec ion VI collec s he pe o mance o se -
e al candida e ha dwa e implemen a ions and compa es hem.
Sec ion VII o e s eliabili y and la ency compa isons based
VOLUME 3, 2022 677
FANARI ET AL.: SURVEY ON FEC TECHNIQUES FOR INDUSTRIAL WIRELESS COMMUNICATIONS
FIGURE 1. Su ey s uc u e.
on simula ions and published esul s o he de ec ed candi-
da es. Sec ion VIII con ains he u u e challenges de ec ed by
his s udy. Finally, Sec ion IX concludes his a icle. Fig. 1
o e s an ou line o he su ey con en .
II. RESEARCH METHOD
This s udy p oposes a sys ema ic li e a u e e iew app oach
o e iewing he a icles encoun e ed in he conside ed
da abases. PRISMA is he guideline ollowed [28]. This
me hodology comp ises ou main s eps: issue de ec ion and
p elimina y s udies, collec ion o a icles and epo s, da a
ex ac ion, and da a inclusion. The i s s ep aims o iden-
i y esea ch ques ions, and he e o e, he objec i es. Mo e in
de ail, his is he s age whe e he selec ion p ocedu e o he
a icle, keywo ds o mula ion o esea ch and sea ch que ies,
and he quali y assessmen c i e ia o ex ac ed s udies a e
de ined. The subsequen s ep consis s o using he keywo ds
o he que ies in he da abases. The esul s a e hen collec ed
678 VOLUME 3, 2022

TAB LE 3. Resea ch Ques ion o This Su ey
TAB LE 4. Selec ed Keywo ds o This Su ey
in Zo e o©, a so wa e o managing bibliog aphic da a and
gene ally esea ch ma e ials encoun e ed in da abases o man-
ually added.
A. RESEARCH QUESTIONS
This s udy sugges s FEC echniques o wi eless sys ems o
indus ial en i onmen s like FA. Mo eo e , se e al guidelines
a e p o ided o he audience o designing ad hoc PHY laye s
o u u e indus ial wi eless sys ems p oposals. Fo his aim,
six esea ch ques ions ha e been conside ed (see Table 3).
B. SELECTION CRITERIA
A e de ining he objec i es o his wo k, he da abases a e
selec ed o he subsequen analysis. Fo his aim, he ol-
lowing da abases ha e been conside ed IEEE Xplo e, Google
Schola , and he 3gpp-da abase. This las collec s many ech-
nical epo s associa ed wi h FEC implemen a ion o URLLC
scena ios, which show simila i ies wi h FA.
Then, a lis o keywo ds o he que ies is gene a ed as
shown in Table 4. These a e o ganized in o ou g oups.
The i s con ains he FA- ela ed keywo ds, and he second
includes FEC- ela ed keywo ds. In con as , he decoding
algo i hm- ela ed keywo ds a e g ouped in he hi d g oup. Fi-
nally, G oup 4 collec s he keywo ds associa ed wi h indus ial
wi eless sys ems.
Mo eo e , he a icles selec ed a e published in English and
indica e a minimum o one ci a ion. The esul is a collec ion
o documen s published in English ha co e s mo e han 60
yea s o con ibu ions associa ed wi h “FEC o sho -packe
communica ions.”
C. STUDY SELECTION
Fig. 2 esumes he decision s eps o including he a icles in
his wo k.
Ini ially, he esea ch shows a o al o 234 a icles and ech-
nical epo s o be analyzed. Among hese, 18 we e excluded
as copies. The e o e, he amoun passes o 216.
Then, he s udy passes o he sc eening phase, which
consis s o an ini ial examina ion o he i le and abs ac , ol-
lowed by a ull- ex analysis. Du ing he i s s ep, he numbe
o a icles was educed o 192, and subsequen ly, hey passed
o 184. The excluded manusc ip s did no show any elemen
o his scope. In his case, he e a e no explana ions o he
me hodology p oposed o he absence o compa able esul s.
Consequen ly, his su ey conside s a o al o 184 documen s
di ided in o academic a icles and echnical epo s.
III. BACKGROUND
This sec ion p esen s a b ie de ini ion o FEC and he
PHY-laye me ics p oposed o analyzing he di e en FEC
echniques p esen ed in his wo k. Acco ding o he au ho s,
his sec ion aims o amilia ize he gene al eade wi h he
con en p oposed in his a icle.
A. FEC IN A NUTSHELL
In 1948, Shannon [29] p o ed ha he e o - ee ansmission
o da a is achie able in communica ion channels a ec ed by
noise. He demons a ed ha he eliabili y is achie able in
hese scena ios by ansmi ing he da a wi h a code a e R
lowe han he channel capaci y, also known as Shannon limi .
The FEC echniques a e one o he common app oaches o
his p oblem. I consis s o applying some edundancy o he
VOLUME 3, 2022 679
FANARI ET AL.: SURVEY ON FEC TECHNIQUES FOR INDUSTRIAL WIRELESS COMMUNICATIONS
FIGURE 2. Selec ion c i e ia based on PRISMA.
da a, which will be ansmi ed h ough he communica ion
channel, wi h a de e mined code a e R.Ris he a io be ween
he o iginal da a size o Kbi s and ansmi ed da a o size N,
whe e N>K. This edundancy helps he ecei e de ec and
co ec some co up ed bi s wi hin he ansmi ed da a.
Ideally, he Shannon limi ends o in ini y, and conse-
quen ly, i is much easie o analyze he pe o mance o
FECs in he case o la ge packe s [30]. Consequen ly, mo e
assump ions a e needed o e alua e FECs in sho packe com-
munica ions. In [31] a solid heo e ical bound is p oposed o
he e alua ion o FEC wi hin sho packe communica ions.
B. FEC METRICS FOR INDUSTRIAL WIRELESS SYSTEMS
1) RELIABILITY
Indus ial wi eless sys ems equi e high eliabili y du ing he
ansmission o sho da a. A ansmission ailu e could a ec
c i ical aspec s o he manu ac u ing p ocesses associa ed wi h
sa e y, equipmen , and machine y in eg i y. The e o a e
is a me ic s ic ly ela ed o he p obabili y o ansmission
ailu e. I s measu emen in hese pa icula en i onmen s is
de ined a PHY o MAC laye s and o e s he a e o success-
ully deli e ed bi s o packe s.
The e o a e me ics desc ibed in his sec ion a e used o
e alua e he indus ial wi eless sys ems pe o mance, whe e
he desi ed pe o mances a e achie able using FEC and e-
ansmission echniques. Some examples a e bi e o a e
(BER), block e o a e (BLER), packe e o a e (PER),
packe loss a e (PLR), and connec ion e o a e (CER). The
e ms BLER, PER, and PLR a e in e changeable in hese
scena ios. Commonly, BLER is associa ed wi h 5G NR, while
PER o IEEE 802 s anda ds o bo h PHY and MAC laye .
PLR only e e s o MAC-laye pe o mances. CER e alua es
he eliabili y pe o mance in he p esence o mul iple connec-
ions among de ices, and hus, is no included in his s udy.
Th ee main me ics ha e been de ec ed and de ined. BER is
commonly used o e alua e he decoding pe o mance a he
PHY laye , indica ing he p obabili y o an e oneous bi ans-
mission. BLER is de ined exclusi ely a he PHY laye and
ep esen s he a io be ween he e oneous packe s ecei ed
and he o ali y o ansmi ed packe s. Finally, PLR conside s
680 VOLUME 3, 2022
he e oneous ansmission in he case o con iguous packe s,
e alua ing he eliabili y a he MAC laye .
In [20], he au ho s compa e he BER/BLER o di e en
FEC candida es o high- h oughpu communica ions wi hin
ac o ies, esul ing om p e ious s udies. While in [32], BER
is used as a h eshold o es ing he Wi elessHP PHY laye
wi h di e en low-o de modula ions a di e en commu-
nica ions dis ances. A BLER h eshold is de ined in [33]
o compa e di e en FEC candida es’ pe o mance wi h he
IEEE 802.11be PHY laye , assuming di e en indus ial chan-
nel models. In [34], [35], and [36], BLER and PLR a e an
uppe bound o es ing he IEEE 802.11 PHY laye pe o -
mance assuming de e minis ic p o ocols.
Gene ally, in indus ial communica ions and FA, a sys em
is conside ed eliable i i p o ides only one communica ion
ailu e du ing housand yea s [7]. This assump ion is based
on he ecommenda ion IEC 61784, whe e he communica-
ion ailu e should compose a mos 1% o he Mean ime o
ailu e, in his case o housand yea s [37].
A communica ion ailu e is caused when he ecei e lacks
he co ec packe ecep ion, and his depends on one o he
h ee ollowing e en s.
1) The ecei e does no ecei e he packe .
2) The ecei ed packe con ains e oneous bi s.
3) The packe is ecei ed ou side he la ency equi emen .
Among he di e en me ics used o he eliabili y es i-
ma ion, PER and BLER p o ide e o a e alues assuming
he communica ion ailu e. Ne e heless, only BLER is o-
cused on e alua ing he pe o mance a he PHY laye , and
hus, is ecommendable o e alua ing he FEC echniques.
Fo ai compa isons be ween di e en BLER esul s shown
in di e en publica ions, addi ional elemen s such as SNR,
channel ypology, and channel p ope ies mus be included in
he analysis.
2) LATENCY: DECODING LATENCY
In indus ial communica ions, la ency is gene ally exp essed
as cycle ime [4], [7], [36]. This me ic exp esses he la ency
be ween he da a ansmission and i s ecep ion. Th ee main
p ocesses a ec his me ic. The i s one is he ansmi e
la ency, which exp esses he ime elapsed be ween he da a
a ailable a he MAC laye and i s subsequen ansmission
by he PHY laye . Coding and modula ion p ocesses a e pa s
o his pe iod. Second, p opaga ion la ency ep esen s he
associa ed delay o he channel. Finally, he ecei e la ency
conside s he equi ed ime o demodula ion and decoding.
Mo eo e , o he c i icali y o he p ocesses in ol ed wi hin
he indus ial en i onmen , cycle ime is commonly bounded
by a maximum alue Tmax, which is hal o he upda e a e pe-
iod o he senso s and ac ua o s included in he ne wo k [7].
An accu a e es ima ion o he impac o he FEC on he
la ency pe o mance o he wi eless sys em is a complex
measu emen . Di e en and unco ela ed ac o s mus be con-
side ed, such as he decode a chi ec u e, he p og amming
language, he in e p e a ion o he algo i hm’s pseudocode,
and he ha dwa e pe o mance. In consequence, he compa i-
son among di e en p oposals is no s aigh o wa d.
FEC con ibu es no ably o he ecei e decoding la-
ency [22]. In many wo ks, i is desc ibed as he a io be ween
he clock cycles equi ed by he decoding la ency and he
clock equency o he ha dwa e used o he implemen a-
ion [33], [38], [39]
Decoding La ency =Requi ed Clock Cycles
Decode Clock F equency.(1)
IV. CHANNEL CODING: A TAXONOMY
The li e a u e includes many examples o FEC echniques
sui able o sho packe communica ion scena ios, and such
choices ha e isen o e he yea s. FEC can be add essed as
memo y-based and memo yless FEC (o Block Codes). This
sec ion aims o p o ide a s a e-o - he-a o hem, mo eo e
sugges ing some FEC candida es o FA wi eless sys ems.
A. BLOCK CODES
Block codes a e a class o FEC in which he da a s eam u ns
in o a block o Kbi s; subsequen ly, by using a gene a ing
ma ix, u he N−Kbi s, known as edundancy bi s, ha e
been included. The code a e R=K
Nspeci ies he numbe o
hese bi s.
A p ima y classi ica ion p oposed o hese echniques
consis s o dis inguishing be ween linea and nonlinea ech-
niques. Linea block codes a e less complex han nonlinea
ones and o e commonly good decoding pe o mances. The
nonlinea block codes a e cha ac e ized by a e y high com-
plexi y ha does no allow hei conside a ion in low la ency
communica ions nowadays [40]. On he con a y, he e-
spec i e coun e pa shows many applica i e examples in
nume ous s anda ds.
The linea block codes can be classi ied as a unc ion
o he gene a ing ma ixes and a ainable pe o mance. On
his basis, he linea block codes a e g ouped as ollows:
LDPC, algeb aic, oun ain, and comp essi e sensing based.
Table 5 compa es he block code echniques using eliabili y
in sho packe egime and pa allel decoding capabili y. Pa al-
lel decoding is a c ucial pa ame e o achie ing he s ingen
la ency equi emen s o FA.
LDPC codes we e disco e ed by Gallage in he 60s [41],
and edisco e ed in he la e 90s by Mackay and Da ey [42].
The ema kable decoding pe o mance o his amily ha e
os e ed hei use in many s anda ds since he i s decade
o XXI cen u y. Some examples a e IEEE 802.11 [43],
WiMax [44], 5G NR [45], ATSC3.0 [46], 10GBase-T [47],
WiGig [48], DVB-T2 [49], [50], DVB-S2 [51], and Con-
sul a i e Commi ee o Space Da a Sys ems (CCSDS) [52].
Gene ally he LDPC a e classi iable in o h ee main sub am-
ilies: Random LDPC [41], Quasi-Cyclic (QC) LDPC [53],
and Cyclic LDPC [54], among hese QC-LDPC a e sui able
o communica ions in FA scena ios; indeed, he possi-
bili y o a ull pa alleliza ion secu es low la encies. Ne -
e heless, QC-LDPC shows e o loo s in BLER-based
VOLUME 3, 2022 681
FANARI ET AL.: SURVEY ON FEC TECHNIQUES FOR INDUSTRIAL WIRELESS COMMUNICATIONS
TAB LE 5. Block Codes and FEC Compa ison
analysis [20] in sho packe ansmissions. This p ob-
lem can be pa ially sol ed by he combina ion wi h
CRC [55], [56].
Algeb aic codes include a wide se o FEC echniques ha ,
due o hei ma hema ical p ope ies, exhibi wo main ad-
an ages: easy implemen a ion and gene ally high decoding
pe o mance [20]. WPAN [57], DVB-T [58], DVB-T2 [50],
IEEE 802.11ad [59], CCSDS [60], [61], MediaFLO [62], and
5G NR [45] a e examples o s anda ds ha employ his FEC
amily. Among he se e al FEC g ouped as algeb aic, he au-
ho s o his a icle ha e iden i ied ou main sub amilies: he
Hamming codes [63], Golay codes [64], he BCH codes [65],
[66], [67], and he Reed–Mulle codes [68]. Among he mos
well-known Algeb aic echniques, he e a e Reed–Solomon
(RS) [69], and Gabidulin [70] ha belong o BCH, whe eas
he Reed–Mulle sub amily includes he ecen ly de eloped
Pola codes [71]. Rega ding he algeb aic codes in he sho
packe egime, on he one hand, hei decoding pe o mance
wo sens [20]. On he o he hand, he use o pa allel decoding
is possible [20]. Howe e , a ew excep ions, sui able o sho
packe ansmissions, ha e been in oduced ecen ly in he
li e a u e, as he cases o Pola codes [72], [73], [74], and BCH
codes wi h OSD decoding [75]. A nega i e aspec conce ned
OSD decoding is he inc eased decoding la ency [75].
Foun ain codes we e in oduced in he la e 90s by Baye s
e al. [76] o p opose an e icien solu ion in mul icas commu-
nica ions, in pa icula , o enhance he e iciency o ARQ [77].
Indeed s anda ds employed in mul icas and b oadcas com-
munica ions, such as 3GPP MBMS [78], and ATSC3.0 [79]
use hese FECs. The la ge numbe o Foun ain echniques
de eloped o e he yea s can be ca ego ized in o h ee main
sub amilies: he LT codes [80], he Rap o codes [81], and
he To nado codes [82], [83]. Foun ain codes p esen a high
complexi y [84] which p e en s hei use in URLLC and espe-
cially o FA [20]. Howe e , ecen e sions o Foun ain ha e
been p oposed o URLLC scena ios, such as in [85] and [86],
whe e he ansmission scheme is signi ican ly simpli ied. The
p oposed scheme in [86] does no o e e o loo s o BLER
alues below 10−7.
Spa se ec o codes (SVC) a e a no el y wi hin he wo ld
o FEC echniques. Based on comp essi e sensing [87], hei
s udies s a ed a ound 2017. The i s esul s a e p omising o
ul asmall alues o K. In pa icula , o Kbelow 100 bi s, hey
show compa able pe o mance wi h Pola codes [88], [89],
682 VOLUME 3, 2022
TAB LE 9. Ha dwa e Implemen a ion Pa I
on ASIC and p o ide BLER o 10−6 o SNRclose o4dB.
E can in 2020 o e s an al e na i e o SCL by in oducing
he SCF algo i hm, which p o ides simila eliabili y o Lin
and Fan models, wi h a educed complexi y N/3P[171]. The
E can model is cu en ly he i s implemen a ion o SCF. In
he speci ic, an ASIC has been used o he model [171]. Also,
he implemen a ion o he Sphe e algo i hm [148], [172],
[173] e eals p omising o educed block leng hs. Howe e ,
he in o ma ion on he ha dwa e implemen a ion o his ap-
p oach is sca ce. Simila ly add essed is he use o he OSD
VOLUME 3, 2022 689

FANARI ET AL.: SURVEY ON FEC TECHNIQUES FOR INDUSTRIAL WIRELESS COMMUNICATIONS
TABLE 10. Ha dwa e Implemen a ion Pa II
690 VOLUME 3, 2022
TABLE 11. P oposed Decoding Algo i hm
FIGURE 3. Reliabili y esul s o R=1/3.
algo i hm [16]. Among he a ious p oposals examined, he
BP algo i hm [174] appea s o be he leas e icien o Po-
la codes. In conclusion, SCL-based implemen a ions a e he
mos e icien in complexi y and eliabili y. Ne e heless, SCF
is jus a p omise, and u he in es iga ion ega ding his no -
el y is necessa y.
C. PARALLEL CONCATENATED CONVOLUTIONAL CODES
(PCCC)
PCCC code implemen a ions suppo he use o Log-MAP-
based algo i hms ha enable i e a i e decoding. Gene ally,
all o he models allow semipa allel decoding, wi h com-
plexi ies ending o 2N/P. Such models a e Bouga d’s [175],
Wong’s [176], and Xiang’s [177]. Fu he implemen a ions
a e Shin’s model, wi h complexi y ending o N/P[178], and
Maunde ’s model [150] esul ing so a he only p oposed ull
pa allel decoding o PCCC. Bo h models implemen MAP.
Among he di e en models, Wong’s model pe o ms be e in
e ms o eliabili y due o an ASIC implemen a ion ensu ing a
BLER o 10−5a SNR o 1.75, 2.25, and 3 dB, o 512-, 256-,
and 128-bi block sizes, espec i ely.
D. TAILBITING CONVOLUTIONAL CODES (TBCC)
In he TBCC case, i e a i e algo i hms such as WAVA [179]
[180], CVA [181], and OSD [182] a e p oposed o sho
packe ansmissions. Howe e , pe o mance esul s a e only
a ailable o WAVA-based p oposals. In pa icula , he ZTE
model sugges ed o he 5G NR s anda d p o ides a semipa -
allel a chi ec u e wi h a complexi y pe i e a ion ending o
N/P[179].
VII. RELIABILITY AND LATENCY PERFORMANCE
COMPARISONS FOR THE FEC CANDIDATES
This sec ion compa es he candida e codes p esen ed in
Sec ion III, i.e., QC-LDPC, Pola , TBCC, and PCCC. The
analysis is based on a compa ison o hei eliabili y and
la ency pe o mances. Reliabili y is analyzed using MATLAB
simula ions based on BLER me ics. Finally, la ency is e al-
ua ed as decoding la ency, ollowing he app oach p oposed
by p e ious wo ks [33], [38], [39]. The decoding algo i hms
we e p e iously sugges ed in Sec ion IV.
A. PRELIMINARIES
The sugges ed me ics a e applicable o compa isons among
di e en FEC echniques, o e ing eliabili y and la ency pe -
o mances o a ious payload sizes. The BLER ep esen s
he eliabili y me ic. Fo he la ency e alua ion, he decoding
la ency is op imal o ocusing on he PHY laye pe o mance.
Finally, he p oposed payload leng hs a e 16, 32, and 64 B.
Conce ning he decoding la ency e alua ion, i s calcula ion is
a ailable by coun ing he numbe o clocks equi ed in he
decoding complexi y. Fo his analysis, he esul s o e ed in
Sec ion VI a e he e e ence. The FEC candida es compa ed
in his sec ion a e QC-LDPC, CA-POLAR, LTE TURBO, and
TBCC. QC-LDPC and CA-POLAR a e in he 5G NR s an-
da d, while TURBO and TBCC a e pa o LTE. Fu he mo e,
QC-LDPC has coupled o he Belie P opaga ion algo i hm,
CA-Pola o an SCL wi h L=2, and a CRC o 24 bi s, while
LTE Tu bo uses Log-MAP inally, TBCC wi h WAVA.
B. RELIABILITY
The eliabili y analysis discussed in his sec ion aims o e al-
ua e he pe o mance o he candida es exp essed in e ms
o BLER a di e en payload leng hs. The BLER h eshold
alue is aken by he eliabili y compa isons p oposed in [20],
which su eyed and analyzed di e en FEC echniques candi-
da es o Wi elessHP. BLER alues ha e been ob ained wi h a
speci ically de eloped MATLAB wo kbench, which p o ides
simula ion esul s o compa e di e en FEC echniques wi h
code a es 1/3 and 1/2. The code a e a 1/2 is a well-known
con igu a ion o indus ial communica ions [20], whe eas he
VOLUME 3, 2022 691
FANARI ET AL.: SURVEY ON FEC TECHNIQUES FOR INDUSTRIAL WIRELESS COMMUNICATIONS
FIGURE 4. Reliabili y esul s o R=1/2.
case o 1/3 is a con igu a ion p oposed o 5G NR o he sig-
naling ansmission o he Physical B oadcas Channel [183],
also a ge ed o sho packe communica ions. In his case,
he da a size a ies be ween 40 and 100 bi s. The simula ions
assume QPSK modula ion o e an AWGN channel. Fu he
simula ion pa ame e s a e he numbe o ansmissions pe
simula ion poin (3 ·106 o ob ain a BLER h eshold o 10−6).
The SNR cu e is ob ained wi h a s ep o 0.25 dB. Figs. 3 and
4 display he simula ion esul s. The cu es show he a ia ion
o eliabili y as a unc ion o he payload size. The e ical axis
ep esen s he payload alues, while he ho izon al axis shows
he SNR alues ob ained o each BLER h eshold.
Fig. 3 p esen s he h eshold alues o code a e 1/3. The
igu e shows how he SNR o di e en payload sizes a ies
acco ding o he FEC employed. I is possible o obse e how
o he ange 16–32 B QC-LDPC, and CA-POLAR p o ide
simila pe o mance, while CA-POLAR is be e o 16-B
payloads. CA-POLAR lacks he h eshold o 64 B due o
i s speci ic design in he 5G NR s anda d. In he 64-B case,
QC-LDPC and LTE TURBO ha e compa able pe o mance.
Finally, analyzing TBCC, a cons an h eshold can be ob-
se ed as a unc ion o he di e en payload leng hs because
i is a CC ype.
Fig. 4 shows he h eshold alues o code a e 1/2. Fi s , is
is obse ed ha CA-POLAR p o ides he bes pe o mance
in all conside ed anges. Howe e , QC-LDPC ge s close
when he payload is 64 B. LTE TURBO o e s 16 dB lowe
pe o mance han CA-POLAR, whe eas TBCC only o e s
compa able pe o mance o LTE TURBO o 16 B.
The mos ele an conclusions deduc ed om he esul s
a e he ollowing. Fi s , CA-Pola and QC-LDPC ou pe o m
he o he candida es. Ne e heless, CA-Pola shows sligh ly
be e pe o mances. Among he candida es, TBCC o e s he
wo s decoding pe o mance. Second, he a ia ion o payload
sizes a ec s he decoding pe o mances o he candida es,
excep o TBCC.
C. LATENCY
Decoding la ency is de ined using (1). Howe e , his de ini ion
equi es a p e ious s ep, which ega ds he es ima ion o he
algo i hmic complexi y in e ms o cycle clocks. Table 11
shows equi ed clock cycles associa ed wi h he decoding
algo i hm choices (I and Pco espond o he numbe o
i e a ions and pa allel p ocesses, espec i ely). BP and Log-
MAP enable ull pa allel decoding, while SCL and WAVA
only allow semipa allel decoding. Fo CA-POLAR, P=32
was assumed o payloads o 16 B, since [170] does no
conside such low payload sizes. Table 12 shows bo h he
coun o clocks equi ed by he decoding algo i hm and he
co esponding decoding la encies. The numbe o clock cy-
cles espec s he alues o he pa ame e s shown in Table 11.
The decoding la ency calcula ion is pe o med as de ined
in [39].The clock equency is conside ed a 300 MHz. This
choice is mo i a ed by he simila clock equencies pe -
o med by he FPGA models used in [10] and [32]. In [32] a
Spa an DS610 is used, whe eas [10] p oposes a Xilinx 7035i
Zynq SoC.
The esul s show ha QC-LDPC and LTE TURBO p o ide
e y low decoding la ency due o he ull pa allel decoding,
ensu ing cons an alues as he block leng h a ies. QC-LDPC
p o ides a decoding la ency o 0.017µs and 0.01µs, espec-
i ely, o code a es o 1/2 and 1/3, while LTE TURBO
p o ides a cons an decoding la ency o 0.053 µs. Al hough
CA-POLAR does no o e a ully pa allel a chi ec u e, i
allows low la ency decoding o 16 and 32 B. In he case
o 16 B, i gua an ees 0.027µs o code a e 1/2 and 0.13µs
o code a e 1/3, while o 32 B, i o e s 0.05 and 0.13 µs
espec i ely. Finally, in he case o 64 B, he decoding la ency
ob ained is 0.11µs. In conclusion, he bes pe o ming choice
in e ms o la ency is he QC-LDPC.
VIII. FUTURE CHALLENGES
Nowadays, cu en indus ial wi eless sys ems adop classical
FEC echniques wi h educed complexi y, such as CC and
RS. Ne e heless, he nume ous con ibu ions in sho packe
communica ions isen in URLLC ha e in oduced alid al e -
na i es o hese scena ios. Many o hese p oposals achie e
he decoding la ency pe o mance o hese classic solu ions
due o he p ope y o pa allel decoding ypical o he adop ed
decoding algo i hms. Examples a e LDPC and Pola codes
applied in 5G NR and TBCC and Tu bo applied in LTE
as obse ed in Sec ion V-C. Mo eo e , he ecen no el ies
SVC [88], [91], [92] and PAC Pola [139], whose esea ch
is in a p elimina y phase, could o e mo e al e na i es o
URLLC and FA u u e de elopmen s.
The e o e, based on he esul s ob ained in his s udy, we
discuss some open issues ha eme ged o FEC echniques in
FA en i onmen s as ollows.
1) MAC laye aspec s: Wi eless sys ems o FA need o
ensu e s ingen pe o mance a he MAC laye . Due o
he cha ac e is ics o indus ial en i onmen s, he MAC
mus p o ide de e minis ic communica ions wi h a e-
duced numbe o e ansmissions o ensu e low la encies
and high eliabili y, pa icula ly o sa e y applica ions,
as discussed in Sec ion I-A. In his case, a wi eless
692 VOLUME 3, 2022
TABLE 12. Decoding La ency Resul s o a Decoding Clock F equency o 300 MHz
sys em design ha combines a educed numbe o e-
ansmissions a he MAC laye wi h high-pe o man
FECs a he PHY laye could achie e he desi ed pe -
o mance o c i ical scena ios.
2) FEC candida es: Fu u e di ec ions a e add essed he e
o he FEC candida es. The ma hema ical p ope y
o QC-LDPCs allows high pe o mance (as obse ed
in [53]) and a educed decoding la ency due o he ull
pa allel decoding. The li e a u e mainly o e s p oposals
based on MIN-SUM and BP ega ding decoding algo-
i hms o sho packe s. The esul s p oposed wi hin
he su ey a e p oposed o AWGN channels, p oposing
bo h implemen a ions on FPGAs and ASICs.CA-Pola s
show high pe o mance o sho packe s when SCL
is adop ed. The p oposals su eyed in his wo k allow
semipa allel decoding and educed decoding la encies.
Howe e , he decoding la encies a e highe han QC-
LDPC. Nume ous ials published in he li e a u e adop
ASIC [22]. Mo eo e , new decoding algo i hms o
CA-Pola ha e been p oposed ecen ly, o e ing in e -
es ing esul s (SCF, Sphe e) [148], [171], [172], [184].
Howe e , only p elimina y esul s a e p o ided.The
p oposed Log-Map decoding algo i hm o Tu bo codes
in [150] o e s a ull-pa allel solu ion o he i s ime
in hese FECs. Finally, TBCC wi h WAVA seem o cope
wi h he high decoding la encies cha ac e is ic o his
FEC echnique [179].The au ho s ha e de ec ed he ol-
lowing u u e di ec ions o he p oposed solu ions. On
he one hand, he combina ion wi h he FEC and he
sugges ed algo i hms mus be es ed wi h simula ions
o e alua e hei pe o mance wi h indus ial channels.
On he o he hand, ield ials wi hin indus ial en i on-
men s mus be conduc ed.
3) No eloneous decoding algo i hms o he FEC candi-
da es: CA-Pola is a ho opic conce ning he coding
heo y due o i s demons a ed pe o mance o sho
packe ansmissions. T adi ionally, SCL is he decod-
ing algo i hm adop ed wi h his FEC. Ne e heless,
no el ies such as SCF [171] and sphe e decoding al-
go i hms [148], [172], [184] could achie e SCL pe o -
mance wi h lowe la encies. The e o e, u he s udies
in his di ec ion a e needed. Analyzing he con en s
o hese a icles is possible add essing he ollowing
challenges. Fo [148], [171], and [172] he algo i hms
s uc u e is desc ibed, and p elimina y esul s ob ained
by simula ions a e gi en. The e o e, he subsequen
ha dwa e implemen a ion o hese p oposals mus be
p oposed conside ing FPGA o ASIC o compa e wi h
he p e ious p oposals’ esul s. Finally, he au ho s
in [184] o e a de ailed desc ip ion o he p oposal wi h
a guideline o i s ha dwa e implemen a ion. Ne e he-
less, his wo k lacks compa able esul s; consequen ly,
p elimina y s udies mus be conduc ed o e alua e he
algo i hm’s pe o mance wi h simula ions, conside ing
AWGN and indus ial channel models.
4) No el ies on FEC echniques: SVC has ecen ly
eme ged as a po en ial FEC echnique o ex emely
sho packe ansmission (payloads below 100 bi s), o -
e ing pe o mance compa able o CA-Pola [88], [89],
[90], [91], [92]. P elimina y s udies show ha SVC has
limi a ions in code a e alues (lowe o equal han 1/4)
and modula ions. Ne e heless, SVC could be consid-
e ed an excellen candida e o u u e FA applica ions,
pa icula ly in sa e y communica ions. The e o e, i s
ha dwa e implemen a ion owa d ul alow la ency com-
munica ions is a u u e challenge.
PAC, ecen ly in oduced by A ikan [139], also
p esen s capabili ies as a u u e candida e o FA com-
munica ions, po en ially ou pe o ming CA-Pola . Ne -
e heless, he s udies p esen ed a e p elimina y, showing
a ew con ibu ions ocused on decoding algo i hms.
Po en ially, PAC could be a po en ial FA candida e i
combined wi h decoding algo i hms designed o low-
la ency communica ions. The e o e, he de elopmen o
decoding algo i hms will be a ho opic and aise in e es
in u u e s udies.
5) Towa d he use o nonlinea codes in FA applica-
ions: The bina iza ion o he P epa a a and Ke dock
codes combined wi h low complex decoding algo i hms
add esses u u e challenges o low la ency commu-
nica ions [40]. In his i s p oposal, only he MAP
decoding algo i hm has been conside ed. The e o e, he
ollowing challenges ha e been de ec ed. Fi s , a ha d-
wa e implemen a ion mus be conduc ed as i could
open new on ie s o low la ency communica ions
and FA. Second, di e en decoding algo i hms sui -
able o FA en i onmen s, such as BP o SCL, mus
be es ed and compa ed wi h he esul s o adop ing
MAP, as his esea ch opic shows only his p elimina y
con ibu ion.
VOLUME 3, 2022 693
FANARI ET AL.: SURVEY ON FEC TECHNIQUES FOR INDUSTRIAL WIRELESS COMMUNICATIONS
IX. CONCLUSION
FEC echniques wi hin FA wi eless sys ems a e c ucial o
mee ing FA equi emen s. Se e al a icles on URLLC iden i y
FEC as he ool o ensu ing high eliabili y and low la ency
wi eless communica ions when sho payloads a e ansmi -
ed. Howe e , he e is a gap in he li e a u e on he me hod
o applying FEC echniques o FA communica ions, which,
compa ed o URLLC, ha e mo e demanding equi emen s.
In his wo k, he aim was o sa is y his need. This a icle
has s udied he FA backg ound a a high le el and se e al
p oposals ela ed o he design o wi eless sys ems o FA.
Subsequen ly, he s udy ocused on a gene al o e iew o he
use cases p oposed. One ele an conclusion is he lack o
ocus on he PHY laye . As a esul , he use cases exclu-
si ely o e equi emen s o he MAC laye . Howe e , he
PHY laye design is no negligible in his pa icula amily o
wi eless communica ions. The p ope ies o he p opaga ion
model ypical o he indus ial channel models complica e he
exclusi e use o e ansmission echniques o ul ill he FA
equi emen s. Such equi emen s e e o he inhe en c i ical-
i y o indus ial p ocesses, whe e he p o ec ion o wo ke s,
machine y, and p oduc ion is essen ial.
A e discussing he p oblems ela ed o he FA equi e-
men s, he ocus shi s o he in-dep h s udy conce ning he
FEC echniques. The i s pa o his s udy has consolida ed
a comp ehensi e s a e-o - he-a o FEC echniques. The p o-
posed echniques a e conside ed he mos sui able o sho
packe communica ions. The chosen pa ame e s a e pa allel
decoding, which bene i s he la ency pe o mance and high e-
liabili y in sho packe communica ions. The iden i ied FEC
candida es a e QC-LDPC, POLAR, TBCC, and PCCC. In
pa icula , in POLAR, CA-POLAR is conside ed, while LTE
TURBO o he case o PCCC.
Ano he ele an aspec ega ding he FEC echniques is he
choice o decoding algo i hms. These me hodologies s ongly
in luence he PHY laye pe o mance and a e essen ial o
mee he equi emen s. The sugges ed combina ions a e BP
o QC-LDPC, SCL o CA-POLAR, WAVA o TBCC, and
Log-MAP o LTE TURBO. These choices a ise om he
pe o mance analysis o se e al p oposals encoun e ed in he
li e a u e.
A u he elemen esul ing om his wo k is he absence o
speci ic me ics in he analysis o FEC o sho packe com-
munica ion scena ios. Consequen ly, he desi ed PHY laye
pe o mance o FA use cases is no p ecise. One esul o
his wo k is he p oposals o PHY laye me ics. I was hen
possible o compa e he FEC candida es h ough hei use.
The esul s show ha QC-LDPC and CA-POLAR a e sui able
o mee ing he FA equi emen s. In pa icula , QC-LDPC
is a po en ial candida e o c i ical communica ions, while
CA-POLAR o sa e y communica ions.
Finally, based on he s udy p oposed in his su ey, we ha e
poin ed ou u he u u e esea ch o de eloping FEC ech-
niques in sho packe ansmissions, and pa icula ly, o FA
scena ios. On he one hand, we ha e add essed he s udies o
he p oposed candida es. On he o he hand, we ha e de ec ed
he no el ies ecen ly in oduced in he li e a u e po en ially
applicable o he conside ed scena ios.
REFERENCES
[1] M. Wollschlaege , T. Sau e , and J. Jaspe nei e, “The u u e o indus-
ial communica ion: Au oma ion ne wo ks in he e a o he In e ne
o Things and indus y 4.0,” IEEE Ind. Elec on. Mag., ol. 11, no. 1,
pp. 17–27, Ma . 2017.
[2] J. Ake be g, M. Gidlund, and M. Bjö kman, “Fu u e esea ch chal-
lenges in wi eless senso and ac ua o ne wo ks a ge ing indus ial
au oma ion,” in P oc. IEEE 9 h In . Con . Ind. In o m., Jul. 2011,
pp. 410–415.
[3] R. Candell and M. Kashe , “Indus ial wi eless: P oblem space,
success conside a ions, echnologies, and u u e di ec ion,” in P oc.
Resilience Week, Sep. 2017, pp. 133–139.
[4] M. Lu iso o, Z. Pang, and D. Dzung, “High-pe o mance wi eless
ne wo ks o indus ial con ol applica ions: New a ge s and easibil-
i y,” P oc. IEEE, ol. 107, no. 6, pp. 1074–1093, Jun. 2019.
[5] D. Ca alcan i, J. Pe ez-Rami ez, M. M. Rashid, J. Fang, M. Galee ,
and K. B. S an on, “Ex ending accu a e ime dis ibu ion and ime-
liness capabili ies o e he ai o enable u u e wi eless indus ial
au oma ion sys ems,” P oc. IEEE, ol. 107, no. 6, pp. 1132–1152,
Jun. 2019.
[6] G. J. Su on e al., “Enabling echnologies o ul a- eliable and
low la ency communica ions: F om PHY and MAC laye pe spec-
i es,” IEEE Commun. Su eys Tu s., ol. 21, no. 3, pp. 2488–2524,
Jul.–Sep. 2019.
[7] K. Mon gome y, R. Candell, Y. Liu, and M. Hany, “Wi eless use
equi emen s o he ac o y wo kcell,” Feb. 2021. [Online]. A ailable:
h ps://n lpubs.nis .go /nis pubs/ams/NIST.AMS.300-8 1-upd.pd
[8] P. Schulz e al., “La ency c i ical IoT applica ions in 5G: Pe spec i e
on he design o adio in e ace and ne wo k a chi ec u e,” IEEE Com-
mun. Mag., ol. 55, no. 2, pp. 70–78, Feb. 2017.
[9] S. Die ich, G. May, O. We e , H. Hee en, and G. Fohle , “Pe o -
mance indica o s and use case analysis o wi eless ne wo ks in ac o y
au oma ion,” in P oc. IEEE 22nd In . Con . Eme g. Technol. Fac o y
Au oma ., Sep. 2017, pp. 1–8.
[10] O. Seijo, J. A. López-Fe nández, and I. Val, “w-SHARP: Implemen-
a ion o a high-pe o mance wi eless ime-sensi i e ne wo k o low
la ency and ul a-low cycle ime indus ial applica ions,” IEEE T ans.
Ind. In o m., ol. 17, no. 5, pp. 3651–3662, May 2021.
[11] M. Zhan, Z. Pang, M. Xiao, M. Lu iso o, and D. Dzung, “Wi eless
high-pe o mance communica ions: Imp o ing e ec i eness and c e-
a ing ul ahigh eliabili y wi h channel coding,” IEEE Ind. Elec on.
Mag., ol. 12, no. 3, pp. 32–37, Sep. 2018.
[12] F. T ama in, S. Vi u i, M. Lu iso o, and A. Zanella, “On he use
o IEEE 802.11n o indus ial communica ions,” IEEE T ans. Ind.
In o m., ol. 12, no. 5, pp. 1877–1886, Oc . 2016.
[13] M. Sybis, K. Wesolowski, K. Jayasinghe, V. Venka asub amanian, and
V. Vukadino ic, “Channel coding o ul a- eliable low-la ency com-
munica ion in 5G sys ems,” in P oc. IEEE 84 h Veh. Technol. Con .,
2016, pp. 1–5.
[14] G. Li a, L. Gaudio, T. Ninacs, and T. Je ko i s, “Code design o sho
blocks: A su ey,” 2016, a Xi :1610.00873 1.
[15] O. Iscan, D. Len ne , and W. Xu, “A compa ison o channel coding
schemes o 5G sho message ansmission,” in P oc. IEEE Globecom
Wo kshops, 2016, pp. 1–6.
[16] D. Wu, Y. Li, X. Guo, and Y. Sun, “O de ed s a is ic decoding o
sho pola codes,” IEEE Commun. Le ., ol. 20, no. 6, pp. 1064–1067,
Jun. 2016.
[17] G. Tzimp agos, C. Kach is, I. B. Djo dje ic, M. C ije ic, D. Soud is,
and I. Tomkos, “A su ey on FEC codes o 100 G and beyond op ical
ne wo ks,” IEEE Commun. Su eys Tu s., ol. 18, no. 1, pp. 209–221,
Oc .–Dec. 2016.
[18] M. Shi animoghaddam e al., “Sho block-leng h codes o ul a-
eliable low la ency communica ions,” IEEE Commun. Mag., ol. 57,
no. 2, pp. 130–137, Feb. 2019.
[19] W. Qiao, D. Liu, and S. Liu, “QFEC ASIP: A lexible quad-mode FEC
ASIP o pola , LDPC, u bo, and con olu ional code decoding,” IEEE
Access, ol. 6, pp. 72189–72200, 2018.
[20] M. Zhan, Z. Pang, D. Dzung, and M. Xiao, “Channel coding o
high pe o mance wi eless con ol in c i ical applica ions: Su ey and
analysis,” IEEE Access, ol. 6, pp. 29648–29664, 2018.
694 VOLUME 3, 2022

[21] Z. R. M. Hajiya , A. Sali, M. Mokh a , and F. Hashim, “Channel
coding scheme o 5G mobile communica ion sys em o sho leng h
message ansmission,” Wi eless Pe s. Commun., ol. 106, no. 2,
pp. 377–400, 2019. [Online]. A ailable: h p://link.sp inge .com/10.
1007/s11277-019-06167-7
[22] S. Shao e al., “Su ey o u bo, LDPC, and pola decode ASIC
implemen a ions,” IEEE Commun. Su eys Tu s., ol. 21, no. 3,
pp. 2309–2333, Jul.–Sep. 2019.
[23] A. Ahmed, A. Al-Dweik, Y. I aqi, H. Mukh a , M. Naeem, and
E. Hossain, “Hyb id au oma ic epea eques (HARQ) in wi eless
communica ions sys ems and s anda ds: A con empo a y su ey,”
IEEE Commun. Su eys Tu s., ol. 23, no. 4, pp. 2711–2752, Oc .–
Dec. 2021.
[24] S. Habib, A. Beeme , and J. Kliewe , “Belie p opaga ion decoding o
sho g aph-based channel codes ia ein o cemen lea ning,” IEEE J.
Sel. A eas In . Theo y, ol. 2, no. 2, pp. 627–640, Jun. 2021.
[25] B. Lian and F. R. Kschischang, “Sequen ial decoding o sho leng h
bina y codes: Pe o mance e sus complexi y,” IEEE Commun. Le .,
ol. 25, no. 10, pp. 3195–3198, Oc . 2021.
[26] O. Fe az e al., “A su ey on high- h oughpu non-bina y LDPC
decode s: ASIC, FPGA, and GPU a chi ec u es,” IEEE Commun. Su -
eys Tu s., ol. 24, no. 1, pp. 524–556, Jan.–Ma . 2022.
[27] Z. Wu, C. Gong, and D. Liu, “Compu a ional complexi y analysis o
FEC decoding on SDR pla o ms,” J. Signal P ocess. Sys ., ol. 89,
no. 2, pp. 209–224, 2017. [Online]. A ailable: h ps://doi.o g/10.1007/
s11265-016-1184-8
[28] M. J. Page e al., “The PRISMA 2020 s a emen : An upda ed guideline
o epo ing sys ema ic e iews,” BMJ, ol. 372, 2021, A . no. n71.
[Online]. A ailable: h ps://www.bmj.com/con en /372/bmj.n71
[29] C. E. Shannon, “A ma hema ical heo y o communica ion,” Bell Sys .
Tech. J., ol. 27, no. 3, pp. 379–423, 1948.
[30] G. Du isi, T. Koch, and P. Popo ski, “Towa ds massi e, ul a- eliable,
and low-la ency wi eless communica ion wi h sho packe s,” P oc.
IEEE, ol. 104, no. 9, pp. 1711–1726, Sep. 2016.
[31] Y. Polyanskiy, H. V. Poo , and S. Ve du, “Channel coding a e in he
ini e blockleng h egime,” IEEE T ans. In . Theo y, ol. 56, no. 5,
pp. 2307–2359, May 2010.
[32] M. Lu iso o, Z. Pang, D. Dzung, M. Zhan, and X. Jiang, “Physical
laye design o high-pe o mance wi eless ansmission o c i i-
cal con ol applica ions,” IEEE T ans. Ind. In o m., ol. 13, no. 6,
pp. 2844–2854, Dec. 2017.
[33] L. Fana i, E. I adie , I. Bilbao, R. Cab e a, J. Mon alban, and P.
Anguei a, “Compa ison be ween di e en channel coding echniques
o IEEE 802.11be wi hin ac o y au oma ion scena ios,” Senso s,
ol. 21, no. 21, 2021, A . no. 7209. [Online]. A ailable: h ps://www.
mdpi.com/1424-8220/21/21/7209
[34] J. Mon alban, E. I adie , P. Anguei a, O. Seijo, and I. Val, “NOMA-
based 802.11n o indus ial au oma ion,” IEEE Access, ol.8,
pp. 168546–168557, 2020.
[35] E. I adie e al., “Analysis o NOMA-based e ansmission
schemes o ac o y au oma ion applica ions,” IEEE Access, ol.9,
pp. 29541–29554, 2021.
[36] O. Seijo, Z. Fe nández, I. Val, and J. A. López-Fe nández, “SHARP:
A no el hyb id a chi ec u e o indus ial wi eless senso and ac ua o
ne wo ks,” in P oc. IEEE 14 h In . Wo kshop Fac o y Commun. Sys .,
Jun. 2018, pp. 1–10.
[37] H. Gall, “Func ional sa e y IEC 61508 / IEC 61511 he impac o
ce i ica ion and he use ,” in P oc. IEEE/ACS In . Con . Compu . Sys .
Appl., 2008, pp. 1027–1031.
[38] L. Fana i, E. I adie , J. Mon alban, P. Anguei a, O. Seijo, and I. Val,
“PEG-LDPC coding o c i ical communica ions in ac o y au oma-
ion,” in P oc. IEEE 25 h In . Con . Eme g. Technol. Fac o y Au oma .,
Sep. 2020, pp. 1135–1138.
[39] Samsung, “Discussion on la ency o channel codes o NR,” 3GPP
TSG RAN WG1 86bis, R1-1609073, Lisbon, Po ugal, Oc . 10–14,
2016. [Online]. A ailable: h ps://www.3gpp.o g/dyna epo ?code=
TDocExM g--R1-86b--31664.h m
[40] A. Minja and V. Šenk, “SISO decoding o Z4 linea Ke dock
and P epa a a codes,” IEEE T ans. Commun., ol. 70, no. 3,
pp. 1497–1507, Ma . 2022.
[41] R. Gallage , “Low-densi y pa i y-check codes,” IRE T ans. In . The-
o y, ol. 8, no. 1, pp. 21–28, Jan. 1962.
[42] M. C. Da ey and D. MacKay, “Low-densi y pa i y check codes o e
GF(q),” IEEE Commun. Le ., ol. 2, no. 6, pp. 165–167, Jun. 1998.
[43] ISO/IEC/IEEE In e na ional S anda d - In o ma ion Technology–
Telecommunica ions and In o ma ion Exchange Be ween Sys ems
Local and Me opoli an A ea Ne wo ks-Speci ic Requi emen s Pa
11: Wi eless LAN Medium Access Con ol (MAC) and Physical
Laye (PHY) Speci ica ions,” ISO/IEC/IEEE In e na ional S anda d,
ISO/IEC/IEEE 8802-11:2012(E) (Re ison o ISO/IEC/IEEE 8802-11-
2005 and Amendmen s), pp. 1–2798, No . 2012.
[44] K. H. Teo, Z. Tao, and J. Zhang, “The mobile b oadband WiMAX
s anda d [s anda ds in a nu shell],” IEEE Signal P ocess. Mag., ol. 24,
no. 5, pp. 144–148, Sep. 2007.
[45] 3GPP, “Digi al cellula elecommunica ions sys em (Phase 2)
(GSM); Uni e sal Mobile Telecommunica ions Sys em (UMTS);
LTE; 5G,” 3 d Gene a ion Pa ne ship P ojec (3GPP), Tech.
Rep. 121 915, e sion 15.0.0, Oc . 2019. [Online]. A ail-
able: h ps://www.e si.o g/deli e /e si_ /121900_121999/121915/15.
00.00_60/ _121915 150000p.pd
[46] K.-J. Kim e al., “Low-densi y pa i y-check codes o ATSC 3.0,”
IEEE T ans. B oadcas ., ol. 62, no. 1, pp. 189–196, Ma . 2016.
[47] J. R. Wes a e al., “Design conside a ions o low-powe analog on
ends in ull-duplex 10GBASE-T anscei e s,” in P oc. IEEE Cus om
In eg . Ci cui s Con ., 2014, pp. 1–10.
[48] C. J. Hansen, “WiGiG: Mul i-gigabi wi eless communica ions in he
60 GHz band,” IEEE Wi eless Commun., ol. 18, no. 6, pp. 6–7,
Dec. 2011.
[49] I. Eizmendi e al., “DVB-T2: The second gene a ion o e es ial
digi al ideo b oadcas ing sys em,” IEEE T ans. B oadcas ., ol. 60,
no. 2, pp. 258–271, Jun. 2014.
[50] L. Vangelis a e al., “Key echnologies o nex -gene a ion e es ial
digi al ele ision s anda d DVB-T2,” IEEE Commun. Mag., ol. 47,
no. 10, pp. 146–153, Oc . 2009.
[51] A. Mo ello and V. Mignone, “DVB-S2: The second gene a ion s an-
da d o sa elli e b oad-band se ices,” P oc. IEEE, ol. 94, no. 1,
pp. 210–227, Jan. 2006.
[52] D. Theodo opoulos, N. K ani is, A. Tsigkanos, and A. Paschalis, “E -
icien a chi ec u es o mul igigabi CCSDS LDPC encode s,” IEEE
T ans. Ve y La ge Scale In eg . Sys ., ol. 28, no. 5, pp. 1118–1127,
May 2020.
[53] M. P. C. Fosso ie , “Quasicyclic low-densi y pa i y-check codes om
ci culan pe mu a ion ma ices,” IEEE T ans. In . Theo y, ol. 50,
no. 8, pp. 1788–1793, Aug. 2004.
[54] K. S. Kim, S.-H. Lee, Y. H. Kim, and J. Ahn, “Design o bina y LDPC
code using cyclic shi ma ices,” Elec on. Le ., ol. 40, pp. 325–326,
Ap . 2004.
[55] S. Gounai and T. Oh suki, “Lowe ing e o loo o i egula LDPC
codes by CRC and OSD algo i hm,” IEICE T ans. Commun., ol. E89-
B, pp. 1–10, 2006.
[56] M. Baldi, N. Ma u o, G. Ricciu elli, and F. Chia aluce, “On he e o
de ec ion capabili y o combined LDPC and CRC codes o space
elecommand ansmissions,” in P oc. IEEE Symp. Compu . Commun.,
Jun. 2016, pp. 1058–1065.
[57] “IEEE S anda d o In o ma ion Technology- Local and Me opoli-
an A ea Ne wo ks- Speci ic Requi emen s- Pa 15.1a: Wi eless
Medium Access Con ol (MAC) and Physical Laye (PHY) Spec-
i ica ions o Wi eless Pe sonal A ea Ne wo ks (WPAN),” IEEE
S anda d 802.15.1-2005 (Re ision o IEEE S anda d 802.15.1-2002),
pp. 1–700, Jun. 2005.
[58] M. Poggioni, L. Rugini, and P. Banelli, “DVB-T/H and T-DMB: Phys-
ical laye pe o mance compa ison in as mobile channels,” IEEE
T ans. B oadcas ., ol. 55, no. 4, pp. 719–730, Dec. 2009.
[59] IEEE S anda d o In o ma ion Technology–Telecommunica ions and
In o ma ion Exchange Be ween Sys ems-Local and Me opoli an A ea
Ne wo ks-Speci ic Requi emen s-Pa 11: Wi eless LAN Medium Ac-
cess Con ol (MAC) and Physical Laye (PHY) Speci ica ions Amend-
men 3: Enhancemen s o Ve y High Th oughpu in he 60 GHz
Band, IEEE S anda d 802.11ad-2012 (Amendmen o IEEE S anda d
802.11-2012, as amended by IEEE S anda d 802.11ae-2012 and IEEE
S d 802.11aa-2012), pp. 1–628, Dec. 2012.
[60] S. A unkuma and T. Kalai ani, “FPGA implemen a ion o CCSDS
BCH (63, 56) o sa elli e communica ion,” in P oc. IEEE In . Con .
Elec on. Des. Sys . Appl., No . 2012, pp. 248–253.
[61] CCSDS Sec e a ia , “TM synch oniza ion and channel coding,” 131.0-
B-2 Blue Book, 2011. [Online]. A ailable: h ps://cwe.ccsds.o g/sls/
docs/SLS-CandS/Mee ing%20Public%20Ma e ials/2009/200904.
Colo adoSp ings/LDPC%20pink%20JPL%204-20-09%20m g.pd
VOLUME 3, 2022 695
FANARI ET AL.: SURVEY ON FEC TECHNIQUES FOR INDUSTRIAL WIRELESS COMMUNICATIONS
[62] M. R. Cha i e al., “FLO physical laye : An o e iew,” IEEE T ans.
B oadcas ., ol. 53, no. 1, pp. 145–160, Ma . 2007.
[63] R. W. Hamming, “E o de ec ing and e o co ec ing codes,” Bell
Sys . Tech. J., ol. 29, no. 2, pp. 147–160, Ap . 1950.
[64] M. J. E. Golay, “The logic o bidi ec ional bina y coun e s,” IRE T ans.
Elec on. Compu ., ol. EC-6, no. 1, pp. 1–4, Ap . 1957.
[65] A. Hocquenghem, “Codes co ec eu s d’e eu s,” Chi e s,
ol. 2, pp. 147–156. [Online]. A ailable: h ps://ci.nii.ac.jp/naid/
10016152997/
[66] R. C. Bose and D. K. Ray-Chaudhu i, “On a class o e o co ec ing
bina y g oup codes,” In . Con ol, ol. 3, no. 1, pp. 68–79, 1960.
[Online]. A ailable: h p://www.sciencedi ec .com/science/a icle/pii/
S0019995860902874
[67] R. C. Bose and D. K. Ray-Chaudhu i, “Fu he esul s on e o co ec -
ing bina y g oup codes,” In . Con ol, ol. 3, no. 3, pp. 279–290, 1960.
[Online]. A ailable: h p://www.sciencedi ec .com/science/a icle/pii/
S0019995860908706
[68] D. E. Mulle , “Applica ion o boolean algeb a o swi ching ci cui de-
sign and o e o de ec ion,” T ans. IRE P o essional G oup Elec on.
Compu ., ol. EC-3, no. 3, pp. 6–12, Sep. 1954.
[69] I. S. Reed and G. Solomon, “Polynomial codes o e ce ain ini e
ields,” J. Soc. Ind. Appl. Ma h., ol. 8, no. 2, pp. 300–304, 1960.
[Online]. A ailable: h ps://www.js o .o g/s able/2098968
[70] E. M. Gabidulin, “Theo y o codes wi h maximum ank dis ance,”
P oblems In . T ansmiss., ol. 21, no. 1, pp. 1–12, 1985.
[71] E. A ikan, “A pe o mance compa ison o pola codes and eed-mulle
codes,” IEEE Commun. Le ., ol. 12, no. 6, pp. 447–449, Jun. 2008.
[72] I. Tal and A. Va dy, “Lis decoding o pola codes,” IEEE T ans. In .
Theo y, ol. 61, no. 5, pp. 2213–2226, May 2015.
[73] K. Niu and K. Chen, “CRC-aided decoding o pola codes,” IEEE
Commun. Le ., ol. 16, no. 10, pp. 1668–1671, Oc . 2012.
[74] A. Bala soukas-S imming, M. B. Pa izi, and A. Bu g, “LLR-based
successi e cancella ion lis decoding o pola codes,” IEEE T ans.
Signal P ocess., ol. 63, no. 19, pp. 5165–5179, Oc . 2015.
[75] O. Pa k, G. Y. Pa k, and Y. H. Lee, “Imp o emen o o de ed s a is ics
decoding o low- a e BCH codes,” in P oc. In . Con . In . Commun.
Technol. Con e gence, 2019, pp. 837–839.
[76] J. W. Bye s, M. Luby, M. Mi zenmache , and A. Rege, “A digi al
oun ain app oach o eliable dis ibu ion o bulk da a,” in P oc. ACM
SIGCOMM Con . Appl. Technol. A chi ec u es P o oc. Compu . Com-
mun., 1998, pp. 56–67. [Online]. A ailable: h ps://doi.o g/10.1145/
285237.285258
[77] W. Ryan and S. Lin, Channel Codes Classical and Mode n.Cam-
b idge, U.K.: Camb idge Uni . P ess, 2009.
[78] L. He, K. Lai, J. Lei, and Y. Huang, “A as encoding o 3GPP MBMS
ap o codes based on ope a ion ins uc ion,” IEEE Commun. Le .,
ol. 24, no. 1, pp. 3–6, Jan. 2020.
[79] L. Fay, L. Michael, D. Gómez-Ba que o, N. Amma , and M. W.
Caldwell, “An o e iew o he ATSC 3.0 physical laye speci ica ion,”
IEEE T ans. B oadcas ., ol. 62, no. 1, pp. 159–171, Ma . 2016.
[80] M. Luby, “LT codes,” in P oc. IEEE 43 d Annu. Symp. Found. Com-
pu . Sci., 2002, pp. 271–280.
[81] A. Kha el and L. Cao, “Analysis and design o physical laye ap o
codes,” IEEE Commun. Le ., ol. 22, no. 3, pp. 450–453, Ma . 2018.
[82] J. W. Bye s, M. Luby, M. Mi zenmache , and A. Rege, “A dig-
i al oun ain app oach o eliable dis ibu ion o bulk da a,” SIG-
COMM Compu . Commun. Re ., ol. 28, no. 4, pp. 56–67, Oc . 1998,
doi: 10.1145/285243.285258.
[83] M. G. Luby, M. Mi zenmache , M. A. Shok ollahi, and D. A. Spiel-
man, “E icien e asu e co ec ing codes,” IEEE T ans. In . Theo y,
ol. 47, no. 2, pp. 569–584, Feb. 2001.
[84] Y. Ma, D. Yuan, and H. Zhang, “Foun ain codes and applica ions o
eliable wi eless b oadcas sys em,” in P oc. IEEE In . Theo y Wo k-
shop, 2006, pp. 66–70.
[85] K. Zhang, J. Jiao, Z. Huang, S. Wu, and Q. Zhang, “Fini e block-leng h
analog oun ain codes o ul a- eliable low la ency communica ions,”
IEEE T ans. Commun., ol. 68, no. 3, pp. 1391–1404, Ma . 2020.
[86] R. Abbas, M. Shi animoghaddam, T. Huang, Y. Li, and B. Vuce ic,
“No el design o sho analog oun ain codes,” IEEE Commun. Le .,
ol. 23, no. 8, pp. 1306–1309, Aug. 2019.
[87] E. J. Candes and M. B. Wakin, “An in oduc ion o comp essi e
sampling,” IEEE Signal P ocess. Mag., ol. 25, no. 2, pp. 21–30,
Ma . 2008.
[88] H. Ji, S. Kim, and B. Shim, “Spa se ec o coding o ul a sho packe
ansmission,” in P oc. In . Theo y Appl. Wo kshop, 2018, pp. 1–9.
[89] H. Ji, S. Pa k, and B. Shim, “Spa se ec o coding o 5G ul a- eliable
and low la ency communica ions,” in P oc. IEEE In . Con . Commun.,
2018, pp. 1–6.
[90] H. Ji and B. Shim, “Spa se ec o coding o sho packe ansmission
in massi e machine ype communica ions,” in P oc. 24 h Asia-Paci ic
Con . Commun., 2018, pp. 137–140.
[91] R. Zhang, B. Shim, Y. Lou, S. Jia, and W. Wu, “Spa se ec o cod-
ing aided ul a- eliable and low-la ency communica ions in mul i-use
massi e MIMO sys ems,” IEEE T ans. Veh. Technol., ol. 70, no. 1,
pp. 1019–1024, Jan. 2021.
[92] W. Kim, S. K. Banda i, and B. Shim, “Enhanced spa se ec o coding
o ul a- eliable and low la ency communica ions,” IEEE T ans. Veh.
Technol., ol. 69, no. 5, pp. 5698–5702, May 2020.
[93] F. Zeng, “Nonlinea codes: Rep esen a ion, cons uc ions, minimum
dis ance compu a ion and decoding,” TDX (Tesis Doc o als en Xa xa),
No . 27, 2014. [Online]. A ailable: h p://www. dx.ca /handle/10803/
284241
[94] F. P. P epa a a, “A class o op imum nonlinea double-e o -
co ec ing codes,” In . Con ol, ol. 13, no. 4, pp. 378–400, 1968.
[Online]. A ailable: h p://www.sciencedi ec .com/science/a icle/pii/
S0019995868908747
[95] A. M. Ke dock, “A class o low- a e nonlinea bina y codes,” In .
Con ol, ol. 20, no. 2, pp. 182–187, 1972. [Online]. A ailable: h p:
//www.sciencedi ec .com/science/a icle/pii/S0019995872903762
[96] P. Delsa e and J. Goe hals, “Al e na ing bilinea o ms o e
GF(q),” J. Combina o ial Theo y Se . A, ol. 19, no. 1, pp. 26–50,
1975. [Online]. A ailable: h ps://linkinghub.else ie .com/ e ie e/pii/
0097316575900904
[97] P. Elias, “Coding o noisy channels,” IRE Con . Rec., ol.3,
no. 4, pp. 37–46, 1955. [Online]. A ailable: h ps://ci.nii.ac.jp/naid/
10016153224/en/
[98] A. Sp inge and R. Weigel, UMTS: The Physical Laye o he Uni-
e sal Mobile Telecommunica ions Sys em. Be lin, Ge many:Sp inge ,
2002.
[99] H. Mousa i, I. S. Ami i, M. Mos a a i, and C. Choon, “LTE physical
laye : Pe o mance analysis and e alua ion,” Appl. Compu . In o m.,
ol. 15, no. 1, pp. 34–44, 2019. [Online]. A ailable: h ps://www.
sciencedi ec .com/science/a icle/pii/S2210832717301990
[100] D. Johns on, J. E. G a , R. W. Zu ek, H. J. Eisen, and B. Jai, “The
Ma s econnaissance o bi e mission,” in P oc. IEEE Ae osp. Con .
P oc., 2003, pp. 1–204.
[101] H. Ma and J. Wol , “On ail bi ing con olu ional codes,” IEEE T ans.
Commun., ol. 34, no. 2, pp. 104–111, Feb. 1986.
[102] A. Z. Ramdani and T. Adiono, “A no el algo i hm o ail bi ing
con olu ional code decode o low cos ha dwa e implemen a ion,”
in P oc. In . Symp. In ell. Signal P ocess. Commun. Sys ., 2015,
pp. 241–245.
[103] C. Be ou, A. Gla ieux, and P. Thi imajshima, “Nea Shannon limi
e o -co ec ing coding and decoding: Tu bo-codes. 1,” in P oc. IEEE
In . Con . Commun., 1993, pp. 1064–1070.
[104] C. Be ou and A. Gla ieux, “Nea op imum e o co ec ing coding
and decoding: Tu bo-codes,” IEEE T ans. Commun., ol. 44, no. 10,
pp. 1261–1271, Oc . 1996.
[105] H. Mukh a , A. Al-Dweik, and A. Shami, “Tu bo p oduc codes: Ap-
plica ions, challenges, and u u e di ec ions,” IEEE Commun. Su eys
Tu s., ol. 18, no. 4, pp. 3052–3069, Oc .–Dec. 2016.
[106] S. Benede o, D. Di sala , G. Mon o si, and F. Polla a, “Se ial conca e-
na ion o in e lea ed codes: Pe o mance analysis, design, and i e a i e
decoding,” IEEE T ans. In . Theo y, ol. 44, no. 3, pp. 909–926,
May 1998.
[107] T. Abe, G. Bauch, and C. Hausl, “A compa ison o a e compa i-
ble PCCC and SCCC o nex gene a ion wi eless communica ion
sys ems,” in P oc. 3 d In . Symp. Wi eless Commun. Sys ., 2006,
pp. 766–770.
[108] Z. Li, M. Miao, and Z. Wang, “Pa allel coding scheme wi h u bo
p oduc code o mobile mul imedia ansmission in MIMO-FBMC
sys em,” IEEE Access, ol. 8, pp. 3772–3780, 2020.
[109] Y. Sun and J. R. Ca alla o, “E icien ha dwa e implemen a ion o a
highly-pa allel 3GPP LTE/LTE-ad ance u bo decode ,” In eg a ion,
ol. 44, no. 4, pp. 305–315, 2011. [Online]. A ailable: h ps://www.
sciencedi ec .com/science/a icle/pii/S0167926010000374
696 VOLUME 3, 2022
[110] R. Sh es ha and A. Sha ma, “VLSI-a chi ec u e o adix-2/4/8 SISO
decode o u bo decoding a mul iple da a- a es,” in P oc. IEEE/IFIP
In . Con . Ve y La ge Scale In eg ., 2018, pp. 131–136.
[111] C. Deng e al., “IEEE 802.11be-Wi-Fi 7: New challenges and oppo -
uni ies,” IEEE Commun. Su eys Tu s., ol. 22, no. 4, pp. 2136–2166,
Oc .–Dec. 2020.
[112] E. Kho o , A. Ki yano , A. Lyakho , and G. Bianchi, “A u o ial
on IEEE 802.11ax high e iciency WLANs,” IEEE Commun. Su eys
Tu s., ol. 21, no. 1, pp. 197–216, Jan.–Ma . 2019.
[113] D. Lopez-Pe ez, A. Ga cia-Rod iguez, L. Gala i-Gio dano, M.
Kasslin, and K. Dopple , “IEEE 802.11be ex emely high h oughpu :
The nex gene a ion o Wi-Fi echnology beyond 802.11ax,” IEEE
Commun. Mag., ol. 57, no. 9, pp. 113–119, Sep. 2019.
[114] R. Cos a, J. Lau, P. Po ugal, F. Vasques, and R. Mo aes, “Handling
eal- ime communica ion in in as uc u ed IEEE 802.11 wi eless ne -
wo ks: The RT-WiFi app oach,” J. Commun. Ne w., ol. 21, no. 3,
pp. 319–334, Jun. 2019.
[115] A. Mahmood, T. Sau e , H. T sek, and R. Exel, “Me hods and pe o -
mance aspec s o wi eless clock synch oniza ion in IEEE 802.11 o
he IoT,” in P oc. IEEE Wo ld Con . Fac o y Commun. Sys ., 2016,
pp. 1–4.
[116] W. Shen, T. Zhang, F. Ba ac, and M. Gidlund, “P io i yMAC: A
p io i y-enhanced MAC p o ocol o c i ical a ic in indus ial wi e-
less senso and ac ua o ne wo ks,” IEEE T ans. Ind. In o m., ol. 10,
no. 1, pp. 824–835, Feb. 2014.
[117] A. Aijaz, “High-pe o mance indus ial wi eless: Achie ing eliable
and de e minis ic connec i i y o e IEEE 802.11 WLANs,” IEEE
Open J. Ind. Elec on. Soc., ol. 1, pp. 28–37, 2020.
[118] O. Seijo, Z. Fe nández, I. Val, and J. A. López-Fe nández, “SHARP:
Towa ds he in eg a ion o ime-sensi i e communica ions in legacy
LAN/WLAN,” in P oc. IEEE Globecom Wo kshops, 2018, pp. 1–7.
[119] IEEE S anda d o In o ma ion Technology- Local and Me opoli an
A ea Ne wo ks- Speci ic Requi emen s- Pa 15.4: Wi eless Medium
Access Con ol (MAC) and Physical Laye (PHY) Speci ica ions o
Low Ra e Wi eless Pe sonal A ea Ne wo ks (WPANS), IEEE S an-
da d 802.15.4-2006 (Re ision o IEEE S anda d 802.15.4-2003),
pp. 1–320, Sep. 2006.
[120] P. Losco e al., “Analysis o he IEEE 802.15.4a UWB PHY laye o
op imizing he powe consump ion o he ansmi e ,” in P oc. IEEE
In . Con . Ul a-Wideband, 2013, pp. 189–194.
[121] V. Niemelä, J. Haapola, M. Hämäläinen, and J. Iina i, “An ul a wide-
band su ey: Global egula ions and impulse adio esea ch based on
s anda ds,” IEEE Commun. Su eys Tu s., ol. 19, no. 2, pp. 874–890,
Ap .–Jun. 2017.
[122] E. Ka apis oli, F.-N. Pa lidou, I. G agopoulos, and I. Tse sinas, “An
o e iew o he IEEE 802.15.4a s anda d,” IEEE Commun. Mag.,
ol. 48, no. 1, pp. 47–53, Jan. 2010.
[123] IEEE S anda d o Low-Ra e Wi eless Ne wo ks–Amendmen 1: En-
hanced Ul a Wideband (UWB) Physical Laye s (PHYS) and Asso-
cia ed Ranging Techniques, IEEE S anda d 802.15.4z-2020 (Amend-
men o IEEE S anda d 802.15.4-2020), pp. 1–174, Aug. 2020.
[124] M. A. Im an, S. Hussain, and Q. H. Abbasi, “Indus ial wi eless senso
ne wo ks o e iew,” in Wi eless Au oma ion as an Enable o he Nex
Indus ial Re olu ion. Hoboken, NJ, USA: Wiley, 2020, pp. 1–17.
[Online]. A ailable: h ps://ieeexplo e.ieee.o g/documen /8958928
[125] Z. Pang, M. Lu iso o, and D. Dzung, “Wi eless high-pe o mance
communica ions: The challenges and oppo uni ies o a new a ge ,”
IEEE Ind. Elec on. Mag., ol. 11, no. 3, pp. 20–25, Sep. 2017.
[126] M. Zhan, Z. Pang, D. Dzung, M. Lu iso o, K. Yu, and M. Xiao,
“Towa ds high-pe o mance wi eless con ol: 10−7packe e o a e
in eal ac o y en i onmen s,” IEEE T ans. Ind. In o m., ol. 16, no. 8,
pp. 5554–5564, Aug. 2020.
[127] J. Sachs, G. Wiks om, T. Dudda, R. Baldemai , and K. Ki ichokechai,
“5G adio ne wo k design o ul a- eliable low-la ency communica-
ion,” IEEE Ne w., ol. 32, no. 2, pp. 24–31, Ma ./Ap . 2018.
[128] X. Jiang, M. Lu iso o, Z. Pang, and C. Fischione, “La ency pe o -
mance o 5G new adio o c i ical indus ial con ol sys ems,” in
P oc. IEEE 24 h In . Con . Eme g. Technol. Fac o y Au oma ., 2019,
pp. 1135–1142.
[129] L. Lopacinski, M. B zozowski, J. Nol e, R. K aeme , and S. Buech-
ne , “Pa allel RS e o co ec ion s uc u es dedica ed o 100 Gbps
wi eless da a link laye ,” in P oc. IEEE In . Con . Ubiqui ous Wi eless
B oadband, 2015, pp. 1–6.
[130] C. Rachinge , J. B. Hube , and R. R. Mülle , “Compa ison o con-
olu ional and block codes o low s uc u al delay,” IEEE T ans.
Commun., ol. 63, no. 12, pp. 4629–4638, Dec. 2015.
[131] IEEE S anda d o In o ma ion Technology–Telecommunica ions and
In o ma ion Exchange Be ween Sys ems Local and Me opoli an A ea
Ne wo ks-speci ic Requi emen s Pa 11: Wi eless LAN Medium Ac-
cess Con ol (MAC) and Physical Laye (PHY) Speci ica ions,IEEE
S anda d 802.11-2012 (Re ision o IEEE S anda d 802.11-2007),
pp. 1–2793, 2012.
[132] D. Hui, S. Sandbe g, Y. Blankenship, M. Ande sson, and L. G osjean,
“Channel coding in 5G new adio: A u o ial o e iew and pe o -
mance compa ison wi h 4G LTE,” IEEE Veh. Technol. Mag., ol. 13,
no. 4, pp. 60–69, Dec. 2018.
[133] X.-Y. Hu, E. Ele he iou, and D. M. A nold, “Regula and i egula
p og essi e edge-g ow h anne g aphs,” IEEE T ans. In . Theo y,
ol. 51, no. 1, pp. 386–398, Jan. 2005.
[134] Y. Fang, G. Bi, Y. L. Guan, and F. C. M. Lau, “A su ey on p o og aph
LDPC codes and hei applica ions,” IEEE Commun. Su eys Tu s.,
ol. 17, no. 4, pp. 1989–2016, Oc .–Dec. 2015.
[135] H. Li, B. Bai, X. Mu, J. Zhang, and H. Xu, “Algeb a-assis ed con-
s uc ion o quasi-cyclic LDPC codes o 5G new adio,” IEEE Access,
ol. 6, pp. 50229–50244, 2018.
[136] A. Abbas a , D. Di sala , and K. Yao, “Accumula e- epea -accumula e
codes,” IEEE T ans. Commun., ol. 55, no. 4, pp. 692–702, Ap . 2007.
[137] S. Abu-Su a, D. Di sala , and W. E. Ryan, “Enume a o s o
p o og aph-based ensembles o LDPC and gene alized LDPC codes,”
IEEE T ans. In . Theo y, ol. 57, no. 2, pp. 858–886, Feb. 2011.
[138] E. A ikan, “Channel pola iza ion: A me hod o cons uc ing capaci y-
achie ing codes o symme ic bina y-inpu memo yless channels,”
IEEE T ans. In . Theo y, ol. 55, no. 7, pp. 3051–3073, Jul. 2009.
[139] E. A ıkan, “F om sequen ial decoding o channel pola iza ion and
back again,” a Xi :1908.09594. [Online]. A ailable: h p://a xi .o g/
abs/1908.09594
[140] K. R. Na ayanan and G. L. S ube , “A no el ARQ echnique using he
u bo coding p inciple,” IEEE Commun. Le ., ol. 1, no. 2, pp. 49–51,
Ma . 1997.
[141] T. Rod igues, R. D. Souza, and M. E. Pellenz, “Hyb id ARQ scheme
based on ecu si e con olu ional codes and u bo decoding,” in P oc.
IEEE In . Con . Commun., 2007, pp. 995–1000.
[142] 3GPP, “3 d gene a ion pa ne ship p ojec ; echnical speci ica ion
g oup adio access ne wo k; e ol ed uni e sal e es ial adio ac-
cess (E-UTRA); mul iplexing and channel coding ( elease 10),” 3GPP
TS 36.212, Dec. 2010. [Online]. A ailable: [online] A ailable: h p:
//www.3gpp.o g/FTP/Specs/h ml-in o/26346.h m
[143] K. R. Du y, A. Solomon, K. M. Konwa , and M. Méda d, “5G NR
CA-pola maximum likelihood decoding by GRAND,” in P oc. 54 h
Annu. Con . In . Sci. Sys ., 2010, pp. 1–5.
[144] Y. Sama awick ama and V. Cionca, “Impac o pilo leng hs o PSAM
on pola code pe o mance in Ricean ading o ealis ic indus ial
channels,” in P oc. In . Con . Commun. Sys . Ne w., 2021, pp. 525–530.
[145] Y. Sama awick ama, V. Cionca, S. Rea, and A. McGibney, “Op imiza-
ion o pola code designs o indus ial wi eless communica ions,” in
P oc. In . Con . Commun. Sys . Ne w., 2021, pp. 363–365.
[146] H. Chen, R. G. Maunde , and L. Hanzo, “A su ey and u o ial
on low-complexi y u bo coding echniques and a holis ic hyb id
ARQ design example,” IEEE Commun. Su eys Tu s., ol. 15, no. 4,
pp. 1546–1566, Oc .–Dec. 2013.
[147] T. Kaila h, “A gene al likelihood- a io o mula o andom signals in
Gaussian noise,” IEEE T ans. In . Theo y, ol. 15, no. 3, pp. 350–361,
May 1969, doi: 10.1109/TIT.1969.1054307.
[148] C. Husmann, P. C. Nikolaou, and K. Niki opoulos, “Reduced la ency
ML pola decoding ia mul iple sphe e-decoding ee sea ches,” IEEE
T ans. Veh. Technol., ol. 67, no. 2, pp. 1835–1839, Feb. 2018.
[149] K. A o a, J. Singh, and Y. S. Randhawa, “A su ey on channel
coding echniques o 5G wi eless ne wo ks,” Telecommun. Sys .,
ol. 73, pp. 637–663, 2020. [Online]. A ailable: h ps://doi.o g/10.
1007/s11235-019-00630-3
[150] R. G. Maunde , “A ully-pa allel u bo decoding algo i hm,” IEEE
T ans. Commun., ol. 63, no. 8, pp. 2762–2775, Aug. 2015.
[151] J. B oulím, P. B oulím, J. Moldaschl, V. Geo gie , and R. Šalom,
“Fully pa allel FPGA decode o i egula LDPC codes,” in P oc.
23 d Telecommun. Fo um Tel o (TELFOR), 2015, pp. 309–312,
doi: 10.1109/TELFOR.2015.7377471.
VOLUME 3, 2022 697
FANARI ET AL.: SURVEY ON FEC TECHNIQUES FOR INDUSTRIAL WIRELESS COMMUNICATIONS
[152] A. Bala soukas-S imming and A. Dollas, “FPGA-based design and
implemen a ion o a mul i-GBPS LDPC decode ,” in P oc. 22nd In .
Con . Field P og ammable Log. Appl., 2012, pp. 262–269.
[153] H. Li, Y. S. Pa k, and Z. Zhang, “Recon igu able a chi ec u e and au-
oma ed design low o apid FPGA-based LDPC code emula ion,” in
P oc. ACM/SIGDA In . Symp. Field P og ammable Ga e A ays, 2012,
A . no. 167. [Online]. A ailable: h p://dl.acm.o g/ci a ion.c m?doid=
2145694.2145722
[154] S. Yesil and M. A slan, “Dual po am based laye ed decoding o
mul i a e quasi-cyclic LDPC codes,” in P oc. 12 h In . Con . Signal
P ocess., 2014, pp. 1524–1530.
[155] S. Yen, S. Hung, C. Chen, H. Chang, S. Jou, and C. Lee, “A 5.79-Gb/s
ene gy-e icien mul i a e LDPC codec chip o IEEE 802.15.3c appli-
ca ions,” IEEE J. Solid-S a e Ci cui s, ol. 47, no. 9, pp. 2246–2257,
Sep. 2012.
[156] Y. S. Pa k, D. Blaauw, D. Syl es e , and Z. Zhang, “Low-
powe high- h oughpu LDPC decode using non- e esh embedded
DRAM,” IEEE J. Solid-S a e Ci cui s, ol. 49, no. 3, pp. 783–794,
Ma . 2014.
[157] B. Xiang, D. Bao, S. Huang, and X. Zeng, “An 847–955 Mb/s 342–
397 mW dual-pa h ully-o e lapped QC-LDPC decode o WiMAX
sys em in 0.13 µm CMOS,” IEEE J. Solid-S a e Ci cui s, ol. 46, no. 6,
pp. 1416–1432, Jun. 2011.
[158] V. A. Chand ase y and S. M. Aziz, “Resou ce e icien LDPC
decode s o mul imedia communica ion,” In eg a ion, ol. 48,
pp. 213–220, 2015. [Online]. A ailable: h ps://www.sciencedi ec .
com/science/a icle/pii/S0167926014000613
[159] V. L. Pe o i´
c, M. M. Ma ko i´
c, D. M. E. Mezeni, L. V. Sa ano ac,
and A. Radoše i´
c, “Flexible high h oughpu QC-LDPC decode wi h
pe ec pipeline con lic s esolu ion and e icien ha dwa e u iliza-
ion,” IEEE T ans. Ci cui s Sys . I, Reg. Pape s, ol. 67, no. 12,
pp. 5454–5467, Dec. 2020.
[160] Y. Xu e al., “Va iable LLR scaling in min-sum decoding o i egula
LDPC codes,” IEEE T ans. B oadcas ., ol. 60, no. 4, pp. 606–613,
Dec. 2014.
[161] D. Kam, H. Yoo, and Y. Lee, “Ul alow-la ency successi e cancella ion
pola decoding a chi ec u e using ee-le el pa allelism,” IEEE T ans.
Ve y La ge Scale In eg . (VLSI) Sys ., ol. 29, no. 6, pp. 1083–1094,
Jun. 2021.
[162] F. E can, C. Condo, and W. J. G oss, “Reduced-memo y high-
h oughpu as -SSC pola code decode a chi ec u e,” in P oc. IEEE
In . Wo kshop Signal P ocess. Sys ., 2017, pp. 1–6.
[163] C. Le oux, A. J. Raymond, G. Sa kis, and W. J. G oss, “A semi-
pa allel successi e-cancella ion decode o pola codes,” IEEE T ans.
Signal P ocess., ol. 61, no. 2, pp. 289–299, Jan. 2013.
[164] B. Yuan and K. K. Pa hi, “Low-la ency successi e-cancella ion pola
decode a chi ec u es using 2-bi decoding,” IEEE T ans. Ci cui s Sys .
I, Reg. Pape s, ol. 61, no. 4, pp. 1241–1254, Ap . 2014.
[165] P. Gia d, A. Bala soukas-S imming, G. Sa kis, C. Thibeaul , and W.
J. G oss, “Fas low-complexi y decode s o low- a e pola codes,” J.
Signal P ocess. Sys ., ol. 90, pp. 675–685, 2018. [Online]. A ailable:
h p://a xi .o g/abs/1603.05273
[166] B. Yuan and K. K. Pa hi, “Low-la ency successi e-cancella ion lis
decode s o pola codes wi h mul ibi decision,” IEEE T ans. Ve y
La ge Scale In eg . (VLSI) Sys ., ol. 23, no. 10, pp. 2268–2280,
Oc . 2015.
[167] A. Bala soukas-S imming, A. J. Raymond, W. J. G oss, and A. Bu g,
“Ha dwa e a chi ec u e o lis successi e cancella ion decoding o
pola codes,” IEEE T ans. Ci cui s Sys . II, Exp. B ie s, ol. 61, no. 8,
pp. 609–613, Aug. 2014.
[168] C. Xiong, J. Lin, and Z. Yan, “A mul i-mode a ea-e icien SCL pola
decode ,” 2016, a Xi :1510.07510 1.
[169] J. Lin and Z. Yan, “An e icien lis decode a chi ec u e o pola
codes,” IEEE T ans. Ve y La ge Scale In eg. (VLSI) Sys ., ol. 23,
no. 11, pp. 2508–2518, No . 2015.
[170] Y. Fan e al., “A low-la ency lis successi e-cancella ion decoding
implemen a ion o pola codes,” IEEE J. Sel. A eas Commun., ol. 34,
no. 2, pp. 303–317, Feb. 2016.
[171] F. E can, T. Tonnellie , N. Doan, and W. J. G oss, “P ac i-
cal dynamic SC- lip pola decode s: Algo i hm and implemen a-
ion,” IEEE T ans. Signal P ocess., ol. 68, pp. 5441–5456, 2020,
doi: 10.1109/TSP.2020.3023582.
[172] J. Piao, J. Dai, and K. Niu, “CRC-aided sphe e decoding o sho pola
codes,” IEEE Commun. Le ., ol. 23, no. 2, pp. 210–213, Feb. 2019.
[173] S. A. Hashemi, C. Condo, and W. J. G oss, “A as pola code lis
decode a chi ec u e based on sphe e decoding,” IEEE T ans. Ci cui s
Sys . I, Reg. Pape s, ol. 63, no. 12, pp. 2368–2380, Dec. 2016.
[174] S. Tajima, T. Takahashi, S. Ibi, and S. Sampei, “I e a i e decoding
based on conca ena ed belie p opaga ion o CRC-aided pola codes,”
in P oc. Asia-Paci ic Signal In . P ocess. Assoc. Annu. Summi Con .,
2018, pp. 1411–1415.
[175] B. Bouga d e al., “A scalable 8.7nJ/bi 75.6Mb/s pa allel conca ena ed
con olu ional ( u bo-) CODEC,” in P oc. IEEE In . Solid-S a e Ci -
cui s Con . Dig. Tech. Pape s, 2003, pp. 152–484.
[176] C.-C. Wong, Y.-Y. Lee, and H.-C. Chang, “A 188-size 2.1mm2 econ-
igu able u bo decode chip wi h pa allel a chi ec u e o 3GPP LTE
sys em,” in P oc. Symp. VLSI Ci cui s, 2009, pp. 288–289.
[177] L. Xiang, M. F. B ejza, R. G. Maunde , B. M. Al-Hashimi, and L.
Hanzo, “A bi a ily pa allel u bo decoding o ul a- eliable low la-
ency communica ion in 3GPP LTE,” IEEE J. Sel. A eas Commun.,
ol. 37, no. 4, pp. 826–838, Ap . 2019.
[178] M.-C. Shin and I.-C. Pa k, “SIMD p ocesso -based u bo decode
suppo ing mul iple hi d-gene a ion wi eless s anda ds,” IEEE T ans.
La ge Scale In eg . (VLSI) Sys ., ol. 15, no. 7, pp. 801–810, Jul. 2007.
[179] ZTE Co p., ZTE Mic oelec onics, “Th oughpu and la ency analysis
on new channel coding candida es o NR,” 3GPP TSG RAN WG1
85, Nanjing, China, Tech. Rep. R1-164279, May 23–27, 2016.
[Online]. A ailable: h ps://www.3gpp.o g/dyna epo ?code=
TDocExM g--R1-85--31662.h m
[180] E. Liang, H. Yang, D. Di sala , and R. D. Wesel, “Lis -decoded ail-
bi ing con olu ional codes wi h dis ance-spec um op imal CRCS o
5G,” in P oc. IEEE Glob. Commun. Con ., 2019, pp. 1–6. [Online].
A ailable: h ps://ieeexplo e.ieee.o g/documen /9013767/
[181] X. Wang, H. Qian, J. Xu, Y. Yang, and F. Wang, “An e icien CVA-
based decoding algo i hm o ail-bi ing codes,” in P oc. IEEE Glob.
Telecommun. Con ., 2011, pp. 1–5.
[182] H. Zhou, W. J. G oss, Z. Zhang, X. You, and C. Zhang, “E icien
sphe e pola decoding ia synch onous de e mina ion,” IEEE T ans.
Veh. Technol., ol. 69, no. 6, pp. 6777–6781, Jun. 2020.
[183] In e Digi al Inc., “Channel codes o PBCH,” 3GPP TSG RAN WG1
Mee ing #89, Hangzhou, P.R. China, Tech. Rep. R1-1708359, May
15–19, 2017. [Online]. A ailable: h ps://www.3gpp.o g/dyna epo ?
code=TDocExM g--R1-89--17065.h m
[184] S. A. Hashemi, C. Condo, and W. J. G oss, “Fas and lexible
successi e-cancella ion lis decode s o pola codes,” IEEE T ans.
Signal P ocess., ol. 65, no. 21, pp. 5756–5769, No . 2017.
LORENZO FANARI (G adua e S uden Membe ,
IEEE) ecei ed he B.Sc. deg ee in elec ical and
elec onic enginee ing and he M.Sc. deg ee in
elecommunica ion enginee ing om he Uni e -
si y o Caglia i, Caglia i, I aly, in 2015 and 2018,
espec i ely. He is cu en ly wo king owa d he
Ph.D. deg ee wi h he Uni e si y o Basque Coun-
y, Bilbao, Spain.
His esea ch in e es s include coding heo y and
wi eless communica ions.
ENEKO IRADIER (Membe , IEEE) ecei ed he
M.S. and Ph.D. deg ees in elecommunica ions
enginee ing om he Uni e si y o he Basque
Coun y, Bilbao, Spain, in 2018 and 2021,
espec i ely.
In 2017 and o a yea and a hal , he wo ked
as a S uden Resea che wi h IK4-Ike lan Tech-
nology Cen e , whe e he de eloped ul a eliable
low la ency communica ions communica ions and
ul alow consump ion sys ems. Since 2015, he has
been pa o he TSR Resea ch G oup, Uni e si y
o he Basque Coun y, whe e he is cu en ly a Pos doc o al Resea che . He
did an in e nship wi h he Communica ions Resea ch Cen e Canada, O awa,
ON, Canada, du ing his doc o al s udies. His cu en esea ch in e es s in-
clude designing and de eloping new echnologies o he u u e physical laye
o communica ion sys ems and wi eless solu ions o Indus y 4.0.
D . I adie has se ed as a Re iewe o se e al enowned in e na ional
jou nals and con e ences in wi eless communica ions.
698 VOLUME 3, 2022