A novel semi-folded parallel successive cancellation-based polar decoder for optimal-register allocation
Efficient compression and reliable data transmission are the major areas in the information theory that governs various applications in mobile communication, Internets and modern digital technology. The exploitation of data patterns and redundancies offers better compression without loss of user inf...
Saved in:
| Published in | The Journal of supercomputing Vol. 75; no. 11; pp. 7037 - 7052 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
New York
Springer US
01.11.2019
Springer Nature B.V |
| Subjects | |
| Online Access | Get full text |
| ISSN | 0920-8542 1573-0484 |
| DOI | 10.1007/s11227-018-2519-y |
Cover
| Abstract | Efficient compression and reliable data transmission are the major areas in the information theory that governs various applications in mobile communication, Internets and modern digital technology. The exploitation of data patterns and redundancies offers better compression without loss of user information. The trade-off between the storage and the quality is the major requirement to apply the coding scheme in very large-scale integration. Alternatively, the reliable transmission in the presence of noise requires the prior addition of redundancy to the data. Polar codes are the practical codes suitable for channel coding and optimal performance achievement under lossy compression and complexity-based communication environment. This paper focuses on the novel architecture of successive cancellation (SC)-based polar decoding for an effective communication. The coefficient weight computation during the register update consumes a number of components in traditional SC decoding architectures. This paper proposes the semi-folded parallel successive cancellation (SFPSC) algorithm that modifies the coefficient weight computation process for register update resulting in a 4-folded polar decoding architecture to retrieve the information from the transmitted symbols with reduced resource utilization. The performance characteristics of SFPSC algorithm based on FPGA implementation are presented. The decoder architecture based on SFPSC algorithm achieves an efficient resource utilization. The reduction in a number of components efficiently reduces the time consumption. The comparative analysis between the SFPSC-based decoder with the existing SC schemes regarding the number of look up tables, FFs and memory assures the effectiveness of SFPSC in resource utilization. |
|---|---|
| AbstractList | Efficient compression and reliable data transmission are the major areas in the information theory that governs various applications in mobile communication, Internets and modern digital technology. The exploitation of data patterns and redundancies offers better compression without loss of user information. The trade-off between the storage and the quality is the major requirement to apply the coding scheme in very large-scale integration. Alternatively, the reliable transmission in the presence of noise requires the prior addition of redundancy to the data. Polar codes are the practical codes suitable for channel coding and optimal performance achievement under lossy compression and complexity-based communication environment. This paper focuses on the novel architecture of successive cancellation (SC)-based polar decoding for an effective communication. The coefficient weight computation during the register update consumes a number of components in traditional SC decoding architectures. This paper proposes the semi-folded parallel successive cancellation (SFPSC) algorithm that modifies the coefficient weight computation process for register update resulting in a 4-folded polar decoding architecture to retrieve the information from the transmitted symbols with reduced resource utilization. The performance characteristics of SFPSC algorithm based on FPGA implementation are presented. The decoder architecture based on SFPSC algorithm achieves an efficient resource utilization. The reduction in a number of components efficiently reduces the time consumption. The comparative analysis between the SFPSC-based decoder with the existing SC schemes regarding the number of look up tables, FFs and memory assures the effectiveness of SFPSC in resource utilization. |
| Author | Aarthi, V. P. M. B. Ramesh, M. Indumathi, G. |
| Author_xml | – sequence: 1 givenname: G. surname: Indumathi fullname: Indumathi, G. organization: Department of Electronics and Communication Engineering, Mepco Schlenk Engineering College – sequence: 2 givenname: V. P. M. B. surname: Aarthi fullname: Aarthi, V. P. M. B. email: vpmb2aarthi@gmail.com organization: Department of Electronics and Communication Engineering, Mepco Schlenk Engineering College – sequence: 3 givenname: M. surname: Ramesh fullname: Ramesh, M. organization: Department of Electronics and Communication Engineering, Kamaraj College of Engineering and Technology |
| BookMark | eNp1kEtrwzAQhEVJoUnaH9CboWe1etlWjiH0BYFe2rOQpVXqoFiu5ATy7yvXhZ562mWZmR2-BZp1oQOEbim5p4TUD4lSxmpMqMSspCt8vkBzWtYcEyHFDM3JihEsS8Gu0CKlPSFE8JrP0ee66MIJfJHg0GIXvAVb9Dpq78fj0RhIqT1BYXRnwHs9tKHDjU6jLHgdCwsmWIiFC7EI_dAetMcRdm0a8jHHBPPjuUaXTvsEN79ziT6eHt83L3j79vy6WW-xYZUccOMABK2csaBzRU6sAcltAwy4EDIvzmhm6xXlrKxAV5UjNXdQMdlwRixforspt4_h6whpUPtwjF1-qRingklKSpZVdFKZGFKK4FQfc_N4VpSoEaiagKoMVI1A1Tl72ORJWdvtIP4l_2_6BrSxfXw |
| Cites_doi | 10.1109/TSP.2015.2486750 10.1109/TCSI.2013.2283779 10.1109/LCOMM.2015.2514279 10.1109/TCSII.2013.2291065 10.1109/TSP.2014.2347262 10.1049/iet-com.2014.0988 10.1109/TVLSI.2014.2359793 10.1109/LCOMM.2013.021213.121633 10.1109/JSAC.2014.140515 10.1109/TCSI.2016.2525020 10.1109/JSAC.2015.2504318 10.1109/JSAC.2014.140514 10.1109/ICC.2012.6364209 10.1109/SiPS.2014.6986086 10.1109/TCOMM.2013.012313.110692 10.1016/j.compeleceng.2017.04.026 10.1109/JSAC.2015.2504321 10.1109/TSP.2012.2223693 10.1109/LCOMM.2014.010214.131826 10.1109/TCOMM.2013.090513.130433 10.1109/TVLSI.2014.2378992 10.1109/TIT.2012.2228295 10.1109/TCOMM.2014.2345069 10.1109/TIT.2009.2021379 10.1109/TIT.2014.2341919 |
| ContentType | Journal Article |
| Copyright | Springer Science+Business Media, LLC, part of Springer Nature 2018 Copyright Springer Nature B.V. 2019 |
| Copyright_xml | – notice: Springer Science+Business Media, LLC, part of Springer Nature 2018 – notice: Copyright Springer Nature B.V. 2019 |
| DBID | AAYXX CITATION JQ2 |
| DOI | 10.1007/s11227-018-2519-y |
| DatabaseName | CrossRef ProQuest Computer Science Collection |
| DatabaseTitle | CrossRef ProQuest Computer Science Collection |
| DatabaseTitleList | ProQuest Computer Science Collection |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science Architecture |
| EISSN | 1573-0484 |
| EndPage | 7052 |
| ExternalDocumentID | 10_1007_s11227_018_2519_y |
| GroupedDBID | -4Z -59 -5G -BR -EM -Y2 -~C .4S .86 .DC .VR 06D 0R~ 0VY 123 199 1N0 1SB 2.D 203 28- 29L 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5QI 5VS 67Z 6NX 78A 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYOK AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDBF ABDPE ABDZT ABECU ABFTD ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACUHS ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADMLS ADQRH ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHSBF AHYZX AI. AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARCSS ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN B-. B0M BA0 BBWZM BDATZ BGNMA BSONS CAG COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 EAD EAP EAS EBD EBLON EBS EDO EIOEI EJD EMK EPL ESBYG ESX F5P FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GXS H13 HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ H~9 I-F I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ KDC KOV KOW LAK LLZTM M4Y MA- N2Q N9A NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM OVD P19 P2P P9O PF0 PT4 PT5 QOK QOS R4E R89 R9I RHV RNI ROL RPX RSV RZC RZE RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TEORI TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW VH1 W23 W48 WH7 WK8 YLTOR Z45 Z7R Z7X Z7Z Z83 Z88 Z8M Z8N Z8R Z8T Z8W Z92 ZMTXR ~8M ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG ADKFA AEZWR AFDZB AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION JQ2 |
| ID | FETCH-LOGICAL-c268t-bfee416fcdea04330dce83dbe2e3448dbefca2d7913256ea66f073fe628b320d3 |
| IEDL.DBID | U2A |
| ISSN | 0920-8542 |
| IngestDate | Thu Sep 25 00:47:58 EDT 2025 Wed Oct 01 03:43:47 EDT 2025 Fri Feb 21 02:27:38 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 11 |
| Keywords | Resource utilization Very large-scale integration Polar coder Semi-folded Successive cancellation |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c268t-bfee416fcdea04330dce83dbe2e3448dbefca2d7913256ea66f073fe628b320d3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| PQID | 2314281052 |
| PQPubID | 2043774 |
| PageCount | 16 |
| ParticipantIDs | proquest_journals_2314281052 crossref_primary_10_1007_s11227_018_2519_y springer_journals_10_1007_s11227_018_2519_y |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2019-11-01 |
| PublicationDateYYYYMMDD | 2019-11-01 |
| PublicationDate_xml | – month: 11 year: 2019 text: 2019-11-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationSubtitle | An International Journal of High-Performance Computer Design, Analysis, and Use |
| PublicationTitle | The Journal of supercomputing |
| PublicationTitleAbbrev | J Supercomput |
| PublicationYear | 2019 |
| Publisher | Springer US Springer Nature B.V |
| Publisher_xml | – name: Springer US – name: Springer Nature B.V |
| References | ZhangCParhiKLatency analysis and architecture design of simplified SC polar decodersIEEE Trans Circuits Syst II Express Briefs20146111511910.1109/TCSII.2013.2291065 EslamiAPishro-NikHOn finite-length performance of polar codes: stopping sets, error floor, and concatenated designIEEE Trans Commun20136191992910.1109/TCOMM.2013.012313.110692 YuanBParhiKLow latency successive cancellation list decoders for polar codes architecture with 2 bit decodingIEEE Trans Circuits Syst2014231241125410.1109/TCSI.2013.2283779 SarkisGGrossWJIncreasing the throughput of polar decodersIEEE Commun Lett20131772572810.1109/LCOMM.2013.021213.121633 HassaniSHAlishahiKUrbankeRFinite length scaling of polar codesIEEE Trans Inf Theory20146058755898326500110.1109/TIT.2014.2341919 RaymondAGrossWA scalable successive cancellation decoder for polar codesIEEE Trans Signal Proces20146253395347326811610.1109/TSP.2014.2347262 Balatsoukas-Stimming A, Raymond AJ, Gross WJ, Burg A (2013) Hard- ware architecture for list SC decoding of polar codes. arXiv preprint arXiv:1303.7127 Bonik G, Goreinov S, Zamarashkin N (2012) Construction and analysis of polar and concatenated polar codes: practical approach. arXiv preprint arXiv:1207.4343 XiongCLinJYanZSymbol-decision successive cancellation list decoder for polar codesIEEE Trans Signal Proces201664675687345334410.1109/TSP.2015.2486750 YuanBParhiKKLow-latency successive-cancellation list decoders for polar codes with multibit decisionIEEE Tran Very Large Scale Integr (VLSI) Syst2015232268228010.1109/TVLSI.2014.2359793 TianKLiuRWangRJoint successive cancellation decoding for bit-interleaved polar coded modulationIEEE Commun Lett20132022410.1109/LCOMM.2015.2514279 FanYXiaCChenJTsuiC-YJinJShenHLiBA low-latency list successive-cancellation decoding implementation for polar codesIEEE J Sel Areas Commun20163430331710.1109/JSAC.2015.2504318 LerouxCRaymondAJSarkisGGrossWJA semi-parallel successive-cancellation decoder for polar codesIEEE Trans Signal Proces201361289299300912410.1109/TSP.2012.2223693 MondelliMHassaniSHUrbankeRLFrom polar to Reed–Muller codes: a technique to improve the finite-length performanceIEEE Trans Commun2014623084309110.1109/TCOMM.2014.2345069 SarkisGGiardPVardyAThibeaultCGrossWJFast polar decoders: algorithm and implementationIEEE J Sel Areas Commun20143294695710.1109/JSAC.2014.140514 LinJYanZA efficient list decoder architecture for polar codesIEEE Trans VLSI2015232508251810.1109/TVLSI.2014.2378992 SeidlMSchenkAStierstorferCHuberJBPolar-coded modulationIEEE Trans Commun2013614108411910.1109/TCOMM.2013.090513.130433 HassaniSHMoriRTanakaTUrbankeRLRate-dependent analysis of the asymptotic behavior of channel polarizationIEEE Trans Inf Theory20135922672276304379610.1109/TIT.2012.2228295 DizdarOArikanEA high-throughput energy-efficient implementation of successive cancellation decoder for polar codes using combinational logicIEEE Trans Circuits Syst I Regul Pap201663436447348884510.1109/TCSI.2016.2525020 GanesanIBalasubramanianAAAMuthusamyRAn efficient implementation of novel paillier encryption with polar encoder for 5G systems in VLSIComput Electr Eng20186515316410.1016/j.compeleceng.2017.04.026 ZhangZZhangLWangXZhongCPoorHVA split-reduced successive cancellation list decoder for polar codesIEEE J Sel Areas Commun20163429230210.1109/JSAC.2015.2504321 Zhang C, Yuan B, Parhi KK (2012) Reduced-latency SC polar decoder architectures. In: IEEE International Conference on Communications (ICC), pp 3471–3475 NiuKChenKLinJLow-complexity sphere decoding of polar codes based on optimum path metricIEEE Commun Lett20141833233510.1109/LCOMM.2014.010214.131826 Yuan B (2015) Algorithm and VLSI Architecture for Polar Codes Decoder, Ph.D. thesis, University of Minnesota Xiong C, Lin J, Yan Z (2014) Symbol-based successive cancellation list decoder for polar codes. IEEE Workshop. In: Signal Processing Systems (SiPS), pp 1–6 (2014) FayyazUUBarryJRLow-complexity soft-output decoding of polar codesIEEE J Sel Areas Commun20143295896610.1109/JSAC.2014.140515 ZhongCPingLZhangZWangXZhangLSimplified successive-cancellation decoding using information set reselection for polar codes with arbitrary block lengthIET Commun201591380138710.1049/iet-com.2014.0988 YunHLeeHSimplified merged processing element for successive cancellation polar decoderIET Commun201652270272 ArikanEChannel polarization: a method for constructing capacity- achieving codes for symmetric binary-input memoryless channelsIEEE Trans Inf Theory20095530513073259800510.1109/TIT.2009.2021379 E Arikan (2519_CR29) 2009; 55 B Yuan (2519_CR5) 2014; 23 Z Zhang (2519_CR8) 2016; 34 C Zhong (2519_CR25) 2015; 9 2519_CR14 M Mondelli (2519_CR13) 2014; 62 B Yuan (2519_CR22) 2015; 23 G Sarkis (2519_CR7) 2014; 32 G Sarkis (2519_CR15) 2013; 17 O Dizdar (2519_CR27) 2016; 63 C Leroux (2519_CR16) 2013; 61 C Zhang (2519_CR23) 2014; 61 H Yun (2519_CR6) 2016; 52 2519_CR1 2519_CR28 SH Hassani (2519_CR9) 2013; 59 2519_CR21 2519_CR20 M Seidl (2519_CR11) 2013; 61 K Niu (2519_CR19) 2014; 18 C Xiong (2519_CR26) 2016; 64 Y Fan (2519_CR4) 2016; 34 J Lin (2519_CR2) 2015; 23 A Raymond (2519_CR17) 2014; 62 I Ganesan (2519_CR3) 2018; 65 UU Fayyaz (2519_CR18) 2014; 32 A Eslami (2519_CR10) 2013; 61 SH Hassani (2519_CR12) 2014; 60 K Tian (2519_CR24) 2013; 20 |
| References_xml | – reference: DizdarOArikanEA high-throughput energy-efficient implementation of successive cancellation decoder for polar codes using combinational logicIEEE Trans Circuits Syst I Regul Pap201663436447348884510.1109/TCSI.2016.2525020 – reference: SarkisGGiardPVardyAThibeaultCGrossWJFast polar decoders: algorithm and implementationIEEE J Sel Areas Commun20143294695710.1109/JSAC.2014.140514 – reference: GanesanIBalasubramanianAAAMuthusamyRAn efficient implementation of novel paillier encryption with polar encoder for 5G systems in VLSIComput Electr Eng20186515316410.1016/j.compeleceng.2017.04.026 – reference: Zhang C, Yuan B, Parhi KK (2012) Reduced-latency SC polar decoder architectures. In: IEEE International Conference on Communications (ICC), pp 3471–3475 – reference: NiuKChenKLinJLow-complexity sphere decoding of polar codes based on optimum path metricIEEE Commun Lett20141833233510.1109/LCOMM.2014.010214.131826 – reference: HassaniSHAlishahiKUrbankeRFinite length scaling of polar codesIEEE Trans Inf Theory20146058755898326500110.1109/TIT.2014.2341919 – reference: FanYXiaCChenJTsuiC-YJinJShenHLiBA low-latency list successive-cancellation decoding implementation for polar codesIEEE J Sel Areas Commun20163430331710.1109/JSAC.2015.2504318 – reference: Bonik G, Goreinov S, Zamarashkin N (2012) Construction and analysis of polar and concatenated polar codes: practical approach. arXiv preprint arXiv:1207.4343 – reference: ZhangCParhiKLatency analysis and architecture design of simplified SC polar decodersIEEE Trans Circuits Syst II Express Briefs20146111511910.1109/TCSII.2013.2291065 – reference: Balatsoukas-Stimming A, Raymond AJ, Gross WJ, Burg A (2013) Hard- ware architecture for list SC decoding of polar codes. arXiv preprint arXiv:1303.7127 – reference: XiongCLinJYanZSymbol-decision successive cancellation list decoder for polar codesIEEE Trans Signal Proces201664675687345334410.1109/TSP.2015.2486750 – reference: FayyazUUBarryJRLow-complexity soft-output decoding of polar codesIEEE J Sel Areas Commun20143295896610.1109/JSAC.2014.140515 – reference: ArikanEChannel polarization: a method for constructing capacity- achieving codes for symmetric binary-input memoryless channelsIEEE Trans Inf Theory20095530513073259800510.1109/TIT.2009.2021379 – reference: ZhangZZhangLWangXZhongCPoorHVA split-reduced successive cancellation list decoder for polar codesIEEE J Sel Areas Commun20163429230210.1109/JSAC.2015.2504321 – reference: LerouxCRaymondAJSarkisGGrossWJA semi-parallel successive-cancellation decoder for polar codesIEEE Trans Signal Proces201361289299300912410.1109/TSP.2012.2223693 – reference: YuanBParhiKKLow-latency successive-cancellation list decoders for polar codes with multibit decisionIEEE Tran Very Large Scale Integr (VLSI) Syst2015232268228010.1109/TVLSI.2014.2359793 – reference: Yuan B (2015) Algorithm and VLSI Architecture for Polar Codes Decoder, Ph.D. thesis, University of Minnesota – reference: LinJYanZA efficient list decoder architecture for polar codesIEEE Trans VLSI2015232508251810.1109/TVLSI.2014.2378992 – reference: YuanBParhiKLow latency successive cancellation list decoders for polar codes architecture with 2 bit decodingIEEE Trans Circuits Syst2014231241125410.1109/TCSI.2013.2283779 – reference: MondelliMHassaniSHUrbankeRLFrom polar to Reed–Muller codes: a technique to improve the finite-length performanceIEEE Trans Commun2014623084309110.1109/TCOMM.2014.2345069 – reference: TianKLiuRWangRJoint successive cancellation decoding for bit-interleaved polar coded modulationIEEE Commun Lett20132022410.1109/LCOMM.2015.2514279 – reference: RaymondAGrossWA scalable successive cancellation decoder for polar codesIEEE Trans Signal Proces20146253395347326811610.1109/TSP.2014.2347262 – reference: SarkisGGrossWJIncreasing the throughput of polar decodersIEEE Commun Lett20131772572810.1109/LCOMM.2013.021213.121633 – reference: SeidlMSchenkAStierstorferCHuberJBPolar-coded modulationIEEE Trans Commun2013614108411910.1109/TCOMM.2013.090513.130433 – reference: ZhongCPingLZhangZWangXZhangLSimplified successive-cancellation decoding using information set reselection for polar codes with arbitrary block lengthIET Commun201591380138710.1049/iet-com.2014.0988 – reference: HassaniSHMoriRTanakaTUrbankeRLRate-dependent analysis of the asymptotic behavior of channel polarizationIEEE Trans Inf Theory20135922672276304379610.1109/TIT.2012.2228295 – reference: EslamiAPishro-NikHOn finite-length performance of polar codes: stopping sets, error floor, and concatenated designIEEE Trans Commun20136191992910.1109/TCOMM.2013.012313.110692 – reference: Xiong C, Lin J, Yan Z (2014) Symbol-based successive cancellation list decoder for polar codes. IEEE Workshop. In: Signal Processing Systems (SiPS), pp 1–6 (2014) – reference: YunHLeeHSimplified merged processing element for successive cancellation polar decoderIET Commun201652270272 – volume: 64 start-page: 675 year: 2016 ident: 2519_CR26 publication-title: IEEE Trans Signal Proces doi: 10.1109/TSP.2015.2486750 – volume: 23 start-page: 1241 year: 2014 ident: 2519_CR5 publication-title: IEEE Trans Circuits Syst doi: 10.1109/TCSI.2013.2283779 – volume: 20 start-page: 224 year: 2013 ident: 2519_CR24 publication-title: IEEE Commun Lett doi: 10.1109/LCOMM.2015.2514279 – volume: 61 start-page: 115 year: 2014 ident: 2519_CR23 publication-title: IEEE Trans Circuits Syst II Express Briefs doi: 10.1109/TCSII.2013.2291065 – volume: 62 start-page: 5339 year: 2014 ident: 2519_CR17 publication-title: IEEE Trans Signal Proces doi: 10.1109/TSP.2014.2347262 – volume: 9 start-page: 1380 year: 2015 ident: 2519_CR25 publication-title: IET Commun doi: 10.1049/iet-com.2014.0988 – volume: 23 start-page: 2268 year: 2015 ident: 2519_CR22 publication-title: IEEE Tran Very Large Scale Integr (VLSI) Syst doi: 10.1109/TVLSI.2014.2359793 – volume: 17 start-page: 725 year: 2013 ident: 2519_CR15 publication-title: IEEE Commun Lett doi: 10.1109/LCOMM.2013.021213.121633 – volume: 32 start-page: 958 year: 2014 ident: 2519_CR18 publication-title: IEEE J Sel Areas Commun doi: 10.1109/JSAC.2014.140515 – volume: 63 start-page: 436 year: 2016 ident: 2519_CR27 publication-title: IEEE Trans Circuits Syst I Regul Pap doi: 10.1109/TCSI.2016.2525020 – volume: 34 start-page: 303 year: 2016 ident: 2519_CR4 publication-title: IEEE J Sel Areas Commun doi: 10.1109/JSAC.2015.2504318 – ident: 2519_CR1 – volume: 32 start-page: 946 year: 2014 ident: 2519_CR7 publication-title: IEEE J Sel Areas Commun doi: 10.1109/JSAC.2014.140514 – ident: 2519_CR14 doi: 10.1109/ICC.2012.6364209 – ident: 2519_CR21 doi: 10.1109/SiPS.2014.6986086 – volume: 61 start-page: 919 year: 2013 ident: 2519_CR10 publication-title: IEEE Trans Commun doi: 10.1109/TCOMM.2013.012313.110692 – ident: 2519_CR20 – volume: 65 start-page: 153 year: 2018 ident: 2519_CR3 publication-title: Comput Electr Eng doi: 10.1016/j.compeleceng.2017.04.026 – volume: 34 start-page: 292 year: 2016 ident: 2519_CR8 publication-title: IEEE J Sel Areas Commun doi: 10.1109/JSAC.2015.2504321 – volume: 61 start-page: 289 year: 2013 ident: 2519_CR16 publication-title: IEEE Trans Signal Proces doi: 10.1109/TSP.2012.2223693 – volume: 18 start-page: 332 year: 2014 ident: 2519_CR19 publication-title: IEEE Commun Lett doi: 10.1109/LCOMM.2014.010214.131826 – volume: 61 start-page: 4108 year: 2013 ident: 2519_CR11 publication-title: IEEE Trans Commun doi: 10.1109/TCOMM.2013.090513.130433 – volume: 23 start-page: 2508 year: 2015 ident: 2519_CR2 publication-title: IEEE Trans VLSI doi: 10.1109/TVLSI.2014.2378992 – volume: 59 start-page: 2267 year: 2013 ident: 2519_CR9 publication-title: IEEE Trans Inf Theory doi: 10.1109/TIT.2012.2228295 – volume: 62 start-page: 3084 year: 2014 ident: 2519_CR13 publication-title: IEEE Trans Commun doi: 10.1109/TCOMM.2014.2345069 – ident: 2519_CR28 – volume: 55 start-page: 3051 year: 2009 ident: 2519_CR29 publication-title: IEEE Trans Inf Theory doi: 10.1109/TIT.2009.2021379 – volume: 60 start-page: 5875 year: 2014 ident: 2519_CR12 publication-title: IEEE Trans Inf Theory doi: 10.1109/TIT.2014.2341919 – volume: 52 start-page: 270 year: 2016 ident: 2519_CR6 publication-title: IET Commun |
| SSID | ssj0004373 |
| Score | 2.182452 |
| Snippet | Efficient compression and reliable data transmission are the major areas in the information theory that governs various applications in mobile communication,... |
| SourceID | proquest crossref springer |
| SourceType | Aggregation Database Index Database Publisher |
| StartPage | 7037 |
| SubjectTerms | Algorithms Architecture Cancellation Coding Communication Compilers Computation Computer Science Data compression Data transmission Decoding Information retrieval Information theory Interpreters Lookup tables Mobile communication systems Processor Architectures Programming Languages Redundancy Register allocation Resource utilization Very large scale integration Weight |
| Title | A novel semi-folded parallel successive cancellation-based polar decoder for optimal-register allocation |
| URI | https://link.springer.com/article/10.1007/s11227-018-2519-y https://www.proquest.com/docview/2314281052 |
| Volume | 75 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVEBS databaseName: EBSCOhost Academic Search Ultimate customDbUrl: https://search.ebscohost.com/login.aspx?authtype=ip,shib&custid=s3936755&profile=ehost&defaultdb=asn eissn: 1573-0484 dateEnd: 20241102 omitProxy: true ssIdentifier: ssj0004373 issn: 0920-8542 databaseCode: ABDBF dateStart: 20030501 isFulltext: true titleUrlDefault: https://search.ebscohost.com/direct.asp?db=asn providerName: EBSCOhost – providerCode: PRVEBS databaseName: Inspec with Full Text customDbUrl: eissn: 1573-0484 dateEnd: 20241102 omitProxy: false ssIdentifier: ssj0004373 issn: 0920-8542 databaseCode: ADMLS dateStart: 19870101 isFulltext: true titleUrlDefault: https://www.ebsco.com/products/research-databases/inspec-full-text providerName: EBSCOhost – providerCode: PRVLSH databaseName: SpringerLink Journals customDbUrl: mediaType: online eissn: 1573-0484 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004373 issn: 0920-8542 databaseCode: AFBBN dateStart: 19970101 isFulltext: true providerName: Library Specific Holdings – providerCode: PRVAVX databaseName: SpringerLINK - Czech Republic Consortium customDbUrl: eissn: 1573-0484 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004373 issn: 0920-8542 databaseCode: AGYKE dateStart: 19970101 isFulltext: true titleUrlDefault: http://link.springer.com providerName: Springer Nature – providerCode: PRVAVX databaseName: SpringerLink Journals (ICM) customDbUrl: eissn: 1573-0484 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0004373 issn: 0920-8542 databaseCode: U2A dateStart: 19970101 isFulltext: true titleUrlDefault: http://www.springerlink.com/journals/ providerName: Springer Nature |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwELagXVh4IwoFeWACWWqcxE3GFLVUIDpRqUyRE58FUtqgPpD677nLQxEIBqZEsePh7PN95_N9x9gNWgid9D1PyFAqdFA8KzTpVRJoZdCgIuSmo4HniRpPvceZP6vyuFf1bfc6JFns1E2ymyMlXZPEmUXYIba7rO0Tmxcu4qmMmmRItwwrh-gXBb4n61Dmb0N8N0YNwvwRFC1szeiQ7VcgkUflrB6xHVgcs4O6AAOv9PGEvUV8kX9Cxlcwfxc2zwwYTmTeWUYfN0UxRNzOeEpzm5XX3gQZLuxGPi03QDntS47Qlee4e8x1JqhWA9EncIrJlyd6p2w6Gr7cj0VVOkGkUgVrkVgAhFo2NaCJoqxnUghck4AEFx0yfLGplqYfojPqK9BKWdR1C0oGiSt7xj1jrUW-gHPGpQbPt05KPPueVQ7-5vTTwNUQGBfBVofd1jKMP0qGjLjhQiaBxyjwmAQebzusW0s5rpRlFSPERCcIgZ7ssLta8k3zn4Nd_Kv3JdtDsBOWeYRd1lovN3CFgGKdXLN2NBoMJvR8eH0aXhcL6gvez8en |
| linkProvider | Springer Nature |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT8MwDI5gHODCGzGeOXACRVrTNmuPE2IasO20SbtVaeMIpK5FeyDt32P3oQoEB25Vm-Zgx_HnOP7M2B16CB13PU_IUCoMUDwrNNlVHGhl0KEi5KajgdFYDabey8yfVXXcy_q2e52SLHbqptjNkZKuSaJmEXaIzTbbIf4qIsyfyl5TDOmWaeUQ46LA92Sdyvxtiu_OqEGYP5Kiha_pH7L9CiTyXqnVI7YF2TE7qBsw8MoeT9hbj2f5J6R8CfN3YfPUgOFE5p2m9HJdNEPE7YwnpNu0vPYmyHHhMIppuQGqaV9whK48x91jrlNBvRqIPoFTTr480Ttl0_7T5HEgqtYJIpEqWInYAiDUsokBTRRlHZNA4JoYJLgYkOGDTbQ03RCDUV-BVsqirVtQMohd2THuGWtleQbnjEsNnm-dhHj2Pasc_M3pJoGrITAugq02u69lGH2UDBlRw4VMAo9Q4BEJPNq02VUt5agylmWEEBODIAR6ss0eask3n_-c7OJfo2_Z7mAyGkbD5_HrJdtD4BOWNYVXrLVarOEawcUqvikW0xfYq8eD |
| linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT8MwDI5gSIgLb8RgQA6cQNFY2mbtcQKm8Zo4MGm3Km0cgdS109Yh7d9jr60qEBy4VW2agx3Hn-P4M2OX6CF01HVdIQOpMEBxrdBkV5GvlUGHipCbjgZehmowch_H3rjsczqvbrtXKcmipoFYmtK8PTW2XRe-daSkK5OoZYQgYrnONlziScAFPZK9ujDSKVLMAcZIvufKKq352xTfHVONNn8kSFd-p7_LtkvAyHuFhvfYGqT7bKdqxsBL2zxg7z2eZp-Q8DlMPoTNEgOGE7F3ktDLxaoxIm5tPCY9J8UVOEFODIdRfMsNUH37jCOM5RnuJBOdCOrbQFQKnPLzxeneIRv1799uB6JsoyBiqfxcRBYAYZeNDWiiK7sxMfiOiUCCg8EZPthYS9MNMDD1FGilLNq9BSX9yJE3xjlijTRL4ZhxqcH1bCcmzn3Xqg7-1unGvqPBNw4Crya7qmQYTgu2jLDmRSaBhyjwkAQeLpusVUk5LA1nHiLcxIAIQZ9ssutK8vXnPyc7-dfoC7b5etcPnx-GT6dsCzFQUJQXtlgjny3gDHFGHp2v1tIXb1PLvw |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+novel+semi-folded+parallel+successive+cancellation-based+polar+decoder+for+optimal-register+allocation&rft.jtitle=The+Journal+of+supercomputing&rft.au=Indumathi%2C+G&rft.au=V.+P.+M.+B.+Aarthi&rft.au=Ramesh%2C+M&rft.date=2019-11-01&rft.pub=Springer+Nature+B.V&rft.issn=0920-8542&rft.eissn=1573-0484&rft.volume=75&rft.issue=11&rft.spage=7037&rft.epage=7052&rft_id=info:doi/10.1007%2Fs11227-018-2519-y&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0920-8542&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0920-8542&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0920-8542&client=summon |