<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.4 20241031//EN"
        "https://jats.nlm.nih.gov/publishing/1.4/JATS-journalpublishing1-4.dtd">
<article  article-type="research-article"        dtd-version="1.4">
            <front>

                <journal-meta>
                                                                <journal-id>cujse</journal-id>
            <journal-title-group>
                                                                                    <journal-title>Cankaya University Journal of Science and Engineering</journal-title>
            </journal-title-group>
                                        <issn pub-type="epub">2564-7954</issn>
                                                                                            <publisher>
                    <publisher-name>Cankaya University</publisher-name>
                </publisher>
                    </journal-meta>
                <article-meta>
                                        <article-id/>
                                                                <article-categories>
                                            <subj-group  xml:lang="en">
                                                            <subject>Engineering</subject>
                                                    </subj-group>
                                            <subj-group  xml:lang="tr">
                                                            <subject>Mühendislik</subject>
                                                    </subj-group>
                                    </article-categories>
                                                                                                                                                        <title-group>
                                                                                                                                                            <article-title>High Performance Low Latency Parallel Successive Cancelation Decoder Structures for Polar Codes</article-title>
                                                                                                    </title-group>
            
                                                    <contrib-group content-type="authors">
                                                                        <contrib contrib-type="author">
                                                                    <contrib-id contrib-id-type="orcid">
                                        https://orcid.org/0000-0002-1714-5818</contrib-id>
                                                                <name>
                                    <surname>Alrtaimi</surname>
                                    <given-names>Abdelkareim</given-names>
                                </name>
                                                                    <aff>CANKAYA UNIVERSITY</aff>
                                                            </contrib>
                                                    <contrib contrib-type="author">
                                                                    <contrib-id contrib-id-type="orcid">
                                        https://orcid.org/0000-0001-5328-7955</contrib-id>
                                                                <name>
                                    <surname>Gazi</surname>
                                    <given-names>Orhan</given-names>
                                </name>
                                                                    <aff>ÇANKAYA ÜNİVERSİTESİ</aff>
                                                            </contrib>
                                                                                </contrib-group>
                        
                                        <pub-date pub-type="pub" iso-8601-date="20201101">
                    <day>11</day>
                    <month>01</month>
                    <year>2020</year>
                </pub-date>
                                        <volume>17</volume>
                                        <issue>2</issue>
                                        <fpage>128</fpage>
                                        <lpage>136</lpage>
                        
                        <history>
                                    <date date-type="received" iso-8601-date="20201011">
                        <day>10</day>
                        <month>11</month>
                        <year>2020</year>
                    </date>
                                                    <date date-type="accepted" iso-8601-date="20201019">
                        <day>10</day>
                        <month>19</month>
                        <year>2020</year>
                    </date>
                            </history>
                                        <permissions>
                    <copyright-statement>Copyright © 2009, Cankaya University Journal of Science and Engineering</copyright-statement>
                    <copyright-year>2009</copyright-year>
                    <copyright-holder>Cankaya University Journal of Science and Engineering</copyright-holder>
                </permissions>
            
                                                                                                                        <abstract><p>Polar codes are decoded using successive cancellation (SC) algorithm where likelihood ratios (LRs) for data bits are calculated in a sequential manner, and decisions are made using the calculated LRs. During the decoding of an information bit, the decision results for the predecessor bits are used, and a wrongly decided predecessor bit has negative effect on the accurate calculation of the LR for the information bit being decoded. In SC algorithm, when LR=1, the information bit is decoded as u ̂_i=0, however, such a decision has 50% of chance of being correct. In this paper, we propose improved polar decoders utilizing a number of SC decoders. We consider the case of LR=1, and propose polar decoder structures for the more accurate calculation of the LRs of the successor bits.</p></abstract>
                                                            
            
                                                                                        <kwd-group>
                                                    <kwd>Multi-Parallel SCD</kwd>
                                                    <kwd>  Polar Coding</kwd>
                                                    <kwd>  BEC</kwd>
                                            </kwd-group>
                            
                                                                                                                                                    </article-meta>
    </front>
    <back>
                            <ref-list>
                                    <ref id="ref1">
                        <label>1</label>
                        <mixed-citation publication-type="journal">[1] E. Arıkan, “Channel Polarization: A Method for Constructing Capacity Achieving Codes for Symmetric Binary-Input Memoryless Channels,” IEEE Transactions on Information Theory, vol. 55, no. 7, pp. 3051–3073, 2009.</mixed-citation>
                    </ref>
                                    <ref id="ref2">
                        <label>2</label>
                        <mixed-citation publication-type="journal">[2] I. Tal and A. Vardy, “List Decoding of Polar Codes,” IEEE Transactions on Information Theory, vol. 61, no. 5, pp. 2213–2226, 2015.</mixed-citation>
                    </ref>
                                    <ref id="ref3">
                        <label>3</label>
                        <mixed-citation publication-type="journal">[3] K. Niu and K. Chen, “CRC-aided decoding of polar codes,” IEEE Communications Letters, vol. 16, no. 10, pp. 1668-1671, 2012.</mixed-citation>
                    </ref>
                                    <ref id="ref4">
                        <label>4</label>
                        <mixed-citation publication-type="journal">[4] P. Koopman and T. Chakravarty, “Cyclic redundancy code (CRC) polynomial selection for embedded networks,” in Proc. IEEE International.Conference Advanced Information Networking and Applications, pp.145-154, 2004.</mixed-citation>
                    </ref>
                                    <ref id="ref5">
                        <label>5</label>
                        <mixed-citation publication-type="journal">[5] G. Sarkis, P. Giard, A. Vardy, C. Thibeault, and W. Gross, “Fast polar decoders: Algorithm and implementation,” IEEE Journal on Selected Areas in Communications, vol. 32, no. 5, pp. 946–957, 2014.</mixed-citation>
                    </ref>
                                    <ref id="ref6">
                        <label>6</label>
                        <mixed-citation publication-type="journal">[6] G. Sarkis, P. Giard, A. Vardy, C. Thibeault, and W. J. Gross, “Fast list Decoders for polar codes,” IEEE Journal on Selected Areas in Communications, vol.34, no. 2, pp. 318–328, 2016.</mixed-citation>
                    </ref>
                            </ref-list>
                    </back>
    </article>
