BEGIN:VCALENDAR
VERSION:2.0
PRODID:IEEE vTools.Events//EN
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:Australia/Melbourne
BEGIN:DAYLIGHT
DTSTART:20211003T030000
TZOFFSETFROM:+1000
TZOFFSETTO:+1100
RRULE:FREQ=YEARLY;BYDAY=1SU;BYMONTH=10
TZNAME:AEDT
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20220403T020000
TZOFFSETFROM:+1100
TZOFFSETTO:+1000
RRULE:FREQ=YEARLY;BYDAY=1SU;BYMONTH=4
TZNAME:AEST
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20220331T072037Z
UID:4532F06E-2410-4AE9-A3C3-B424A67C6F2A
DTSTART;TZID=Australia/Melbourne:20220331T170000
DTEND;TZID=Australia/Melbourne:20220331T180000
DESCRIPTION:Designing and optimizing short block length codes have been rec
 ently attracted for being implemented on memory or power-constrained devic
 es\, mainly in the context of the Internet of Things applications and serv
 ices. The rate matching procedure is crucial to support various requiremen
 ts and adapt to varying channel conditions. Existing rate compatible (RC) 
 codes are mainly constructed using puncturing and extending\, which are sh
 own to be sub-optimal for short block lengths. Designing RC codes for shor
 t messages that support bit-level granularity of the codeword size and mai
 ntain a large minimum Hamming weight at various rates is still open. In th
 is talk\, I will introduce primitive rateless (PR) codes\, which are mainl
 y characterized by a primitive polynomial of degree k over GF(2). We will 
 see that PR codes can be represented by using 1) linear-feedback shift-reg
 isters (LFSR) and 2) Boolean functions. We characterize PR codes' average 
 Hamming weight distribution and develop a lower bound on the minimum Hammi
 ng weight\, which is very close to the Gilbert-Varshamov bound. An interes
 ting result is that for any k\, there exists at least one PR code that can
  meet this bound. Simulation results show that the PR code with a properly
  chosen primitive polynomial can achieve a similar block error rate (BLER)
  performance as the eBCH code counterpart. This is because while PR codes 
 might have a slightly lower minimum Hamming weight than the eBCH code\, it
  has a lower number of low-weight codewords. PR codes can be designed for 
 any message length and arbitrary rate and perform close to finite block le
 ngth bounds. They are rate-compatible and have a very simple encoding stru
 cture\, unlike most rate-compatible codes designed based on puncturing a l
 ow-rate mother code\, with a sub-optimal performance at various rates.\n\n
 Speaker(s): Dr. Mahyar Shirvanimoghaddam \, \n\nMelbourne\, Victoria\, Aus
 tralia\, 3000\, Virtual: https://events.vtools.ieee.org/m/306655
LOCATION:Melbourne\, Victoria\, Australia\, 3000\, Virtual: https://events.
 vtools.ieee.org/m/306655
ORGANIZER:golnar.khomami@gmail.com
SEQUENCE:3
SUMMARY:Channel Code Design for Beyond 5G: Primitive Rateless Codes
URL;VALUE=URI:https://events.vtools.ieee.org/m/306655
X-ALT-DESC:Description: <br /><p style="margin: 0cm\; background: white\;">
 <span style="font-size: 11.0pt\; font-family: 'Calibri'\,sans-serif\; colo
 r: #201f1e\;">Designing and optimizing short block length codes have been 
 recently attracted for being implemented on memory or power-constrained de
 vices\, mainly in the context of the Internet of Things applications and s
 ervices.&nbsp\; The rate matching procedure is crucial to support various 
 requirements and adapt to varying channel conditions. Existing rate compat
 ible (RC) codes are mainly constructed using puncturing and extending\, wh
 ich are shown to be sub-optimal for short block lengths.&nbsp\; Designing 
 RC codes for short messages that support bit-level granularity of the code
 word size and maintain a large minimum Hamming weight at various rates is 
 still open. In this talk\, I will introduce primitive rateless (PR) codes\
 , which are mainly characterized by a primitive polynomial of degree k ove
 r GF(2). We will see that PR codes can be represented by using 1) linear-f
 eedback shift-registers (LFSR) and 2) Boolean functions. We characterize P
 R codes' average Hamming weight distribution and develop a lower bound on 
 the minimum Hamming weight\, which is very close to the Gilbert-Varshamov 
 bound. An interesting result is that for any k\, there exists at least one
  PR code that can meet this bound. Simulation results show that the PR cod
 e with a properly chosen primitive polynomial can achieve a similar block 
 error rate (BLER) performance as the eBCH code counterpart. This is becaus
 e while PR codes might have a slightly lower minimum Hamming weight than t
 he eBCH code\, it has a lower number of low-weight codewords. PR codes can
  be designed for any message length and arbitrary rate and perform close t
 o finite block length bounds. They are rate-compatible and have a very sim
 ple encoding structure\, unlike most rate-compatible codes designed based 
 on puncturing a low-rate mother code\, with a sub-optimal performance at v
 arious rates.</span></p>
END:VEVENT
END:VCALENDAR