Successive cancellation decoding is a lot like eating a box of chocolates: If you accidentally choose a very flavorful one somewhere in the middle of the consumption, the rest of the chocolates will taste dull.
For PAC codes to work well, we need to abandon the CRC (in favor of a better code-rate) but still can use list decoding. With a list size of just L=64, we come dangerously close to OSD decoding of BCH codes! We also need to replace the Polar code construction (the selection of frozen bits) with something that gives us better distance properties over better polarization properties. Here the Reed Muller based construction comes in handy and is super simple to compute, as you can see in the screenshot.
Ahmet Inan
Someone made a PWA out of my Android Robot36 SSTV Decoder:
github.com/smolgroot/sstv-decoder
1 week ago | [YT] | 3
View 0 replies
Ahmet Inan
Makes me real happy to see my OFDM modem doing well
4 weeks ago | [YT] | 3
View 0 replies
Ahmet Inan
Took a couple of prompts and it still feels not right. Also did some editing as it refused to delete the last redundant frame. Ah well.
1 month ago | [YT] | 2
View 0 replies
Ahmet Inan
Robot36 or Rattlegram wouldn't have existed if I would have sabotaged myself
1 month ago | [YT] | 1
View 0 replies
Ahmet Inan
How to make a simple audio cable yourself for Robot36 and Rattlegram
1 month ago | [YT] | 1
View 0 replies
Ahmet Inan
Another cable for Robot36 and Rattlegram. Excellent!
1 month ago | [YT] | 1
View 0 replies
Ahmet Inan
Successive cancellation decoding is a lot like eating a box of chocolates: If you accidentally choose a very flavorful one somewhere in the middle of the consumption, the rest of the chocolates will taste dull.
3 months ago | [YT] | 1
View 0 replies
Ahmet Inan
Is it just me or are the fscking fireworks getting louder each year?
3 months ago | [YT] | 1
View 0 replies
Ahmet Inan
For PAC codes to work well, we need to abandon the CRC (in favor of a better code-rate) but still can use list decoding. With a list size of just L=64, we come dangerously close to OSD decoding of BCH codes! We also need to replace the Polar code construction (the selection of frozen bits) with something that gives us better distance properties over better polarization properties. Here the Reed Muller based construction comes in handy and is super simple to compute, as you can see in the screenshot.
3 months ago | [YT] | 3
View 3 replies
Ahmet Inan
HoHoHo, merry xmas!
3 months ago | [YT] | 3
View 0 replies
Load more