
In this paper, we show that encoding operation for the polar codes can be achieved without the employment of the generator matrix, and all the polar code bits can be generated at the same time using a number of tree-encoding structures running in parallel. Since encoding matrix is not used in the implementation of the polar encoders in digital electronic devices, hardware space is saved, and low complexity hardware applications are achieved. Besides, we also proposed a method for the calculation of split channel parameters, such as Bhattacharyya bounds or average-bit-error probabilities of the transmitted bits using a tree-based structure. Moreover, the proposed structure enables to calculate the probability of bit-error values of all the transmitted bits at the same time in a parallel manner and decide the locations of data and frozen bits very rapidly.
Engineering, Polar codes;encoding algorithm;generator matrix transformation;tree structure;FPGA., Mühendislik
Engineering, Polar codes;encoding algorithm;generator matrix transformation;tree structure;FPGA., Mühendislik
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
