Test vectors of the list-decoding for most probable messages of polar codes

Citation Author(s):
Sinan
Kahraman
Submitted by:
Sinan Kahraman
Last updated:
Wed, 10/30/2024 - 11:06
DOI:
10.21227/t1qs-n650
Data Format:
License:
79 Views
Categories:
Keywords:
0
0 ratings - Please login to submit your rating.

Abstract 

Test vectors are given as a part of the simulations on Gaussian noise channel. For all zero codeword transmission, a received noisy vector with length 128, the most probable L=49 messages with length 64 bit (in 16 hexadecimal), Euclidean distances and also the 64 bit indices in a 128 bit vector are provided.

Instructions: 

I.Received noisy signal vector with length :128

II.Most probable messages with length : 49 (64 bit messages shown as hexadecimal array.)

III.Euclidean distances with length : 49 (between modulated signal and the received vectors.)

IV.64 information indices for a vector with length 128.

There are also available as a table per non-binary level: In the first place, soroufar33.mat 648MB is for the table of metrics with size ~33mln. In the second place, sorouloc33.mat 697MB is for the table of candidate locations with the same size.

https://www.dropbox.com/scl/fi/p0fw709g3c23g6smktuct/soroufar33.mat?rlke...

https://www.dropbox.com/scl/fi/e456s9z7k2j4x8weu2hb2/sorouloc33.mat?rlke...

Dataset Files

    Files have not been uploaded for this dataset

    Documentation

    AttachmentSize
    File test_data (1).pdf27.46 KB