Modified Iterative Decoding Algorithm for Polar Code Using Maximum Likelihood Estimation

The key challenges in real time voice communication in long term evolution mobile are reduction in complexity and latency. Efficient encoding and decoding algorithms can cater to these. The implementation of such polar code based efficient algorithms is proposed in this paper. The overall latency of...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Wireless personal communications Ročník 98; číslo 2; s. 1821 - 1833
Hlavní autoři:	Jadhav, Makarand Mohan, Sapkal, Ashok M., Pattarkine, Ram, Patil, R. A.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.01.2018 Springer Nature B.V
Témata:	Algorithms Bit error rate Codes Communications Engineering Computer Communication Networks Decoding Engineering Experimentation Hyperbolic functions Iterative methods Maximum likelihood decoding Maximum likelihood estimation Networks Signal,Image and Speech Processing Voice communication mID AWGN LTE SNR BER
ISSN:	0929-6212, 1572-834X
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Abstract	The key challenges in real time voice communication in long term evolution mobile are reduction in complexity and latency. Efficient encoding and decoding algorithms can cater to these. The implementation of such polar code based efficient algorithms is proposed in this paper. The overall latency of 3.8 ms is needed to process 8 bit block length. The novel sub-matrix near to identity matrix is presented. This resulted into minimization of loops among least reliable bits due to iterated parity check matrix. Look-up table based memory mapping is used in encoder to reduce latency while Euclidian decoding technique is used in decoder. The number of iterations is reduced by 50%. The experimentation is performed with additive white Gaussian noise and QPSK modulation. The proposed modified iterative decoding algorithm requires SNR of 5.5 dB and 192 computations for targeted bit error rate of 10 −4 . The second proposed method needs 9 dB, 2 iterations for 384 computations. The penalty paid is quantization error of 0.63% due to restricting computations to fourth order series of hyperbolic function with same 8 bit block length.
AbstractList	The key challenges in real time voice communication in long term evolution mobile are reduction in complexity and latency. Efficient encoding and decoding algorithms can cater to these. The implementation of such polar code based efficient algorithms is proposed in this paper. The overall latency of 3.8 ms is needed to process 8 bit block length. The novel sub-matrix near to identity matrix is presented. This resulted into minimization of loops among least reliable bits due to iterated parity check matrix. Look-up table based memory mapping is used in encoder to reduce latency while Euclidian decoding technique is used in decoder. The number of iterations is reduced by 50%. The experimentation is performed with additive white Gaussian noise and QPSK modulation. The proposed modified iterative decoding algorithm requires SNR of 5.5 dB and 192 computations for targeted bit error rate of 10−4. The second proposed method needs 9 dB, 2 iterations for 384 computations. The penalty paid is quantization error of 0.63% due to restricting computations to fourth order series of hyperbolic function with same 8 bit block length. The key challenges in real time voice communication in long term evolution mobile are reduction in complexity and latency. Efficient encoding and decoding algorithms can cater to these. The implementation of such polar code based efficient algorithms is proposed in this paper. The overall latency of 3.8 ms is needed to process 8 bit block length. The novel sub-matrix near to identity matrix is presented. This resulted into minimization of loops among least reliable bits due to iterated parity check matrix. Look-up table based memory mapping is used in encoder to reduce latency while Euclidian decoding technique is used in decoder. The number of iterations is reduced by 50%. The experimentation is performed with additive white Gaussian noise and QPSK modulation. The proposed modified iterative decoding algorithm requires SNR of 5.5 dB and 192 computations for targeted bit error rate of 10 −4 . The second proposed method needs 9 dB, 2 iterations for 384 computations. The penalty paid is quantization error of 0.63% due to restricting computations to fourth order series of hyperbolic function with same 8 bit block length.
Author	Jadhav, Makarand Mohan Pattarkine, Ram Patil, R. A. Sapkal, Ashok M.
Author_xml	– sequence: 1 givenname: Makarand Mohan surname: Jadhav fullname: Jadhav, Makarand Mohan email: makj123@yahoo.com organization: Government College of Engineering – sequence: 2 givenname: Ashok M. surname: Sapkal fullname: Sapkal, Ashok M. organization: Government College of Engineering – sequence: 3 givenname: Ram surname: Pattarkine fullname: Pattarkine, Ram organization: College of Engineering and Technology – sequence: 4 givenname: R. A. surname: Patil fullname: Patil, R. A. organization: Government College of Engineering
BookMark	eNp9kMFOAjEQhhuDiYA-gLcmnlfb7na7PRJEJYHoQRJuTdm2UNzdYrsY5ektrgdjopeZZGa--Wf-Aeg1rtEAXGJ0jRFiNwFjwliCMEsynrHkcAL6mDKSFGm27IE-4oQnOcHkDAxC2CIUKU76YDl3yhqrFZy22svWvml4q8tYbNZwVK2dt-2mhsZ5-OQq6eHYKQ0X4diey3db72s4sy-6shvnFJyE1tZxi2vOwamRVdAX33kIFneT5_FDMnu8n45Hs6RMcd7GKFOCKKWmLExmZFGkKZZMmxWmGKlixVGhECpzsyI5zhnhktKMK5MzpaTk6RBcdXt33r3udWjF1u19EyUF5gVDiGY0jVO4myq9C8FrI3Y-Huo_BEbiaKDoDBTRQHE0UBwiw34xpW2_fmu9tNW_JOnIEFWatfY_bvoT-gQYZYfP
CitedBy_id	crossref_primary_10_1016_j_comcom_2022_06_031
Cites_doi	10.1109/LCOMM.2015.2506568 10.1007/s11276-014-0879-7 10.1007/s11276-015-0942-z 10.1109/TCOMM.2016.2574996 10.1109/LCOMM.2015.2497220 10.1109/JSAC.2015.2504318 10.1561/9781601985972 10.1109/LCOMM.2016.2605106 10.1109/LCOMM.2011.061611.110862 10.1109/LCOMM.2008.080017 10.1002/j.1538-7305.1948.tb01338.x 10.1109/JRPROC.1952.273898 10.1007/s11277-015-2691-9 10.1109/TCOMM.2012.081512.110872
ContentType	Journal Article
Copyright	Springer Science+Business Media, LLC 2017 Copyright Springer Science & Business Media 2018
Copyright_xml	– notice: Springer Science+Business Media, LLC 2017 – notice: Copyright Springer Science & Business Media 2018
DBID	AAYXX CITATION JQ2
DOI	10.1007/s11277-017-4947-z
DatabaseName	CrossRef ProQuest Computer Science Collection
DatabaseTitle	CrossRef ProQuest Computer Science Collection
DatabaseTitleList	ProQuest Computer Science Collection
DeliveryMethod	fulltext_linktorsrc
Discipline	Journalism & Communications Engineering
EISSN	1572-834X
EndPage	1833
ExternalDocumentID	10_1007_s11277_017_4947_z
GroupedDBID	-5B -5G -BR -EM -Y2 -~C .4S .86 .DC .VR 06D 0R~ 0VY 123 1N0 1SB 2.D 203 28- 29R 29~ 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5QI 5VS 67Z 6NX 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA 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 ACREN ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADMLS ADRFC ADTPH ADURQ ADYFF ADYOE ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEGXH AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFLOW AFQWF AFWTZ AFYQB AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGWIL AGWZB AGYKE AHAVH AHBYD AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMTXH AMXSW AMYLF AMYQR AOCGG ARCEE ARCSS ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN B-. BA0 BBWZM BDATZ BGNMA BSONS CAG COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 EBLON EBS EDO EIOEI EJD ESBYG FD6 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~ I-F I09 IHE IJ- IKXTQ ITG ITH 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 P9P PF0 PT4 PT5 QOK QOS R4E R89 R9I RHV RIG RNI RNS ROL RPX RSV RZC RZE RZK S16 S1Z S26 S27 S28 S3B SAP SCLPG SCV SDH SDM SEG SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TEORI TSG TSK TSV TUC TUS U2A U5U UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 Z7R Z7S Z7X Z7Z Z81 Z83 Z88 Z8M Z8N Z8R Z8T Z8U Z8W Z92 ZMTXR _50 ~A9 ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABJCF ABRTQ ACSTC ADHKG AEZWR AFDZB AFFHD AFHIU AFKRA AFOHR AGQPQ AHPBZ AHWEU AIXLP ARAPS ATHPR AYFIA BENPR BGLVJ CCPQU CITATION HCIFZ K7- M7S PHGZM PHGZT PQGLB PTHSS JQ2
ID	FETCH-LOGICAL-c316t-c3a320555fc8f4fa88331a7efb1510d8b908d00c6fb2616729a5549df67ddaa93
IEDL.DBID	RSV
ISICitedReferencesCount	2
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000419945500011&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0929-6212
IngestDate	Thu Sep 25 00:39:16 EDT 2025 Tue Nov 18 21:05:09 EST 2025 Sat Nov 29 05:18:05 EST 2025 Fri Feb 21 02:40:26 EST 2025
IsPeerReviewed	true
IsScholarly	true
Issue	2
Keywords	mID AWGN LTE SNR BER
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c316t-c3a320555fc8f4fa88331a7efb1510d8b908d00c6fb2616729a5549df67ddaa93
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
PQID	1987005453
PQPubID	2043826
PageCount	13
ParticipantIDs	proquest_journals_1987005453 crossref_primary_10_1007_s11277_017_4947_z crossref_citationtrail_10_1007_s11277_017_4947_z springer_journals_10_1007_s11277_017_4947_z
PublicationCentury	2000
PublicationDate	20180100 2018-1-00 20180101
PublicationDateYYYYMMDD	2018-01-01
PublicationDate_xml	– month: 1 year: 2018 text: 20180100
PublicationDecade	2010
PublicationPlace	New York
PublicationPlace_xml	– name: New York – name: Dordrecht
PublicationSubtitle	An International Journal
PublicationTitle	Wireless personal communications
PublicationTitleAbbrev	Wireless Pers Commun
PublicationYear	2018
Publisher	Springer US Springer Nature B.V
Publisher_xml	– name: Springer US – name: Springer Nature B.V
References	YangWZhangLYangZA unified design of channel coding for LTE uplink control informationWireless Networks201521516611667333413010.1007/s11276-014-0879-7 ShanonCEA mathematical theory of communicationBell System Technical Journal1948273794232628610.1002/j.1538-7305.1948.tb01338.x ArikanESystematic polar codingIEEE Communications Letters201115886086210.1109/LCOMM.2011.061611.110862 SasogluEPolarization and polar codes2011Hanover, MANow Publishers Inc1278.94032 HuffmanDAA method for the construction of minimum-redundancy codesProceedings of the IRE19524091098110110.1109/JRPROC.1952.2738980137.13605 ArikanEA performance comparison of polar codes and Reed-MullerIEEE Communication Letters200812644744910.1109/LCOMM.2008.080017 ChenKLiBShenHReduce the complexity of list decoding of polar codes by tree-pruningIEEE Communications Letters201620220420710.1109/LCOMM.2015.2506568 NiuYLiYJinDA survey of millimeter wave communications (mmWave) for 5G: Opportunities and challengesWireless Networks20152182657267610.1007/s11276-015-0942-z LiYLiuRWangRA low-complexity SNR estimation algorithm based on frozen bits of polar codesIEEE Communications Letters201620122354235710.1109/LCOMM.2016.2605106 Krishna, R. N., Jiang, J., & Nangare, N. A. (2009). Inventors; Iterative soft-input-soft-output decoding of Reed–Solomon codes by adapting the parity check matrix. US patent 7519898 B2, April 2009. FanYXiaCChenJA low-latency list successive-cancellation decoding implementation for polar codesIEEE Journal on Selected Areas in Communications201634230331710.1109/JSAC.2015.2504318 AroraMSinghSSimulative analysis of Turbo codes over AWGN channel for BPSK modulation schemeEuropean’s Journal of Advances in Engineering and Technology2015262936 HooshmandRArefMREghlidosTSecret key cryptosystem based on non-systematic polar codesWireless Pearson Communications20158421345137310.1007/s11277-015-2691-9 ChenGTZhangZZhongCZhangLA low complexity encoding algorithm for systematic polar codesIEEE Communications Letters201620712771280 VangalaHHongYViterboEEfficient algorithms for systematic polar encodingIEEE Communications Letters2016201172010.1109/LCOMM.2015.2497220 TrifonovPEfficient design and decoding of polar codesIEEE Transactions on Communications201260113221322710.1109/TCOMM.2012.081512.110872 LathiBPDingZModern digital and analog communication systems20114OxfordOxford University Press SarkisGTalIGiardPVardyAFlexible and low-complexity encoding and decoding of systematic polar codesIEEE Transactions on Communications20166472732274510.1109/TCOMM.2016.2574996 ProakisJGDigital communications20145New YorkMcGraw-Hill Education0292.94002 K Chen (4947_CR6) 2016; 20 P Trifonov (4947_CR14) 2012; 60 E Arikan (4947_CR16) 2011; 15 E Sasoglu (4947_CR1) 2011 E Arikan (4947_CR15) 2008; 12 M Arora (4947_CR13) 2015; 2 4947_CR17 R Hooshmand (4947_CR10) 2015; 84 Y Fan (4947_CR8) 2016; 34 H Vangala (4947_CR9) 2016; 20 DA Huffman (4947_CR18) 1952; 40 BP Lathi (4947_CR3) 2011 JG Proakis (4947_CR2) 2014 W Yang (4947_CR12) 2015; 21 G Sarkis (4947_CR7) 2016; 64 Y Niu (4947_CR11) 2015; 21 Y Li (4947_CR5) 2016; 20 GT Chen (4947_CR4) 2016; 20 CE Shanon (4947_CR19) 1948; 27
References_xml	– reference: Krishna, R. N., Jiang, J., & Nangare, N. A. (2009). Inventors; Iterative soft-input-soft-output decoding of Reed–Solomon codes by adapting the parity check matrix. US patent 7519898 B2, April 2009. – reference: ArikanEA performance comparison of polar codes and Reed-MullerIEEE Communication Letters200812644744910.1109/LCOMM.2008.080017 – reference: HooshmandRArefMREghlidosTSecret key cryptosystem based on non-systematic polar codesWireless Pearson Communications20158421345137310.1007/s11277-015-2691-9 – reference: TrifonovPEfficient design and decoding of polar codesIEEE Transactions on Communications201260113221322710.1109/TCOMM.2012.081512.110872 – reference: VangalaHHongYViterboEEfficient algorithms for systematic polar encodingIEEE Communications Letters2016201172010.1109/LCOMM.2015.2497220 – reference: ChenKLiBShenHReduce the complexity of list decoding of polar codes by tree-pruningIEEE Communications Letters201620220420710.1109/LCOMM.2015.2506568 – reference: SasogluEPolarization and polar codes2011Hanover, MANow Publishers Inc1278.94032 – reference: LiYLiuRWangRA low-complexity SNR estimation algorithm based on frozen bits of polar codesIEEE Communications Letters201620122354235710.1109/LCOMM.2016.2605106 – reference: LathiBPDingZModern digital and analog communication systems20114OxfordOxford University Press – reference: HuffmanDAA method for the construction of minimum-redundancy codesProceedings of the IRE19524091098110110.1109/JRPROC.1952.2738980137.13605 – reference: ArikanESystematic polar codingIEEE Communications Letters201115886086210.1109/LCOMM.2011.061611.110862 – reference: ProakisJGDigital communications20145New YorkMcGraw-Hill Education0292.94002 – reference: FanYXiaCChenJA low-latency list successive-cancellation decoding implementation for polar codesIEEE Journal on Selected Areas in Communications201634230331710.1109/JSAC.2015.2504318 – reference: ShanonCEA mathematical theory of communicationBell System Technical Journal1948273794232628610.1002/j.1538-7305.1948.tb01338.x – reference: AroraMSinghSSimulative analysis of Turbo codes over AWGN channel for BPSK modulation schemeEuropean’s Journal of Advances in Engineering and Technology2015262936 – reference: SarkisGTalIGiardPVardyAFlexible and low-complexity encoding and decoding of systematic polar codesIEEE Transactions on Communications20166472732274510.1109/TCOMM.2016.2574996 – reference: NiuYLiYJinDA survey of millimeter wave communications (mmWave) for 5G: Opportunities and challengesWireless Networks20152182657267610.1007/s11276-015-0942-z – reference: YangWZhangLYangZA unified design of channel coding for LTE uplink control informationWireless Networks201521516611667333413010.1007/s11276-014-0879-7 – reference: ChenGTZhangZZhongCZhangLA low complexity encoding algorithm for systematic polar codesIEEE Communications Letters201620712771280 – volume: 20 start-page: 204 issue: 2 year: 2016 ident: 4947_CR6 publication-title: IEEE Communications Letters doi: 10.1109/LCOMM.2015.2506568 – volume: 21 start-page: 1661 issue: 5 year: 2015 ident: 4947_CR12 publication-title: Wireless Networks doi: 10.1007/s11276-014-0879-7 – volume: 21 start-page: 2657 issue: 8 year: 2015 ident: 4947_CR11 publication-title: Wireless Networks doi: 10.1007/s11276-015-0942-z – volume-title: Modern digital and analog communication systems year: 2011 ident: 4947_CR3 – ident: 4947_CR17 – volume: 64 start-page: 2732 issue: 7 year: 2016 ident: 4947_CR7 publication-title: IEEE Transactions on Communications doi: 10.1109/TCOMM.2016.2574996 – volume: 20 start-page: 17 issue: 1 year: 2016 ident: 4947_CR9 publication-title: IEEE Communications Letters doi: 10.1109/LCOMM.2015.2497220 – volume: 2 start-page: 29 issue: 6 year: 2015 ident: 4947_CR13 publication-title: European’s Journal of Advances in Engineering and Technology – volume: 34 start-page: 303 issue: 2 year: 2016 ident: 4947_CR8 publication-title: IEEE Journal on Selected Areas in Communications doi: 10.1109/JSAC.2015.2504318 – volume-title: Digital communications year: 2014 ident: 4947_CR2 – volume-title: Polarization and polar codes year: 2011 ident: 4947_CR1 doi: 10.1561/9781601985972 – volume: 20 start-page: 2354 issue: 12 year: 2016 ident: 4947_CR5 publication-title: IEEE Communications Letters doi: 10.1109/LCOMM.2016.2605106 – volume: 15 start-page: 860 issue: 8 year: 2011 ident: 4947_CR16 publication-title: IEEE Communications Letters doi: 10.1109/LCOMM.2011.061611.110862 – volume: 12 start-page: 447 issue: 6 year: 2008 ident: 4947_CR15 publication-title: IEEE Communication Letters doi: 10.1109/LCOMM.2008.080017 – volume: 27 start-page: 379 year: 1948 ident: 4947_CR19 publication-title: Bell System Technical Journal doi: 10.1002/j.1538-7305.1948.tb01338.x – volume: 40 start-page: 1098 issue: 9 year: 1952 ident: 4947_CR18 publication-title: Proceedings of the IRE doi: 10.1109/JRPROC.1952.273898 – volume: 84 start-page: 1345 issue: 2 year: 2015 ident: 4947_CR10 publication-title: Wireless Pearson Communications doi: 10.1007/s11277-015-2691-9 – volume: 60 start-page: 3221 issue: 11 year: 2012 ident: 4947_CR14 publication-title: IEEE Transactions on Communications doi: 10.1109/TCOMM.2012.081512.110872 – volume: 20 start-page: 1277 issue: 7 year: 2016 ident: 4947_CR4 publication-title: IEEE Communications Letters
SSID	ssj0010092
Score	2.118571
Snippet	The key challenges in real time voice communication in long term evolution mobile are reduction in complexity and latency. Efficient encoding and decoding...
SourceID	proquest crossref springer
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	1821
SubjectTerms	Algorithms Bit error rate Codes Communications Engineering Computer Communication Networks Decoding Engineering Experimentation Hyperbolic functions Iterative methods Maximum likelihood decoding Maximum likelihood estimation Networks Signal,Image and Speech Processing Voice communication
Title	Modified Iterative Decoding Algorithm for Polar Code Using Maximum Likelihood Estimation
URI	https://link.springer.com/article/10.1007/s11277-017-4947-z https://www.proquest.com/docview/1987005453
Volume	98
WOSCitedRecordID	wos000419945500011&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1572-834X dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0010092 issn: 0929-6212 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8NAEB60etCDj6pYW2UP4kEJJN08j0VbFGwp-KC3sNnNarBppUlF-uudzcO2ooJecsnuEHY2M9_s7HwDcIo-QpoGx9iECUczKQu0wOOB1qRC0qYVMlu4WbMJp9dzBwOvX9RxJ-Vt9zIlmVnqebGbodKNyqqanulos1VYsxTZjArR7x4_UweKRSgj2FP3OtAwl6nM70QsO6M5wvySFM18TWf7X1-5A1sFtCStfC_swko4qsLmAuFgFerFoCiJyRlZKg5J9mDQHYtIIiYlNxnXMhpCcoXhqXJvpDV8Gk-i9DkmCHNJX0XEKECEJLt0QLrsPYqnMbmNXsJhpLiSSRutR14YuQ8Pnfb95bVWdF7QODXsFJ-MNhUVmOSuNCVTHYkN5oQyQICgCzfwdFfoOrdlgBGYjQCdISzxhLQdIRjz6AFURuNReAhEmnbIDWqj1UXwQ4VnSURoKFtgbOkERg30UgU-L2jJVXeMoT8nVFZL6uOS-mpJ_VkNzj-nvOacHL8NbpR69YvfM_HVSYsCqxatwUWpx4XXPwk7-tPoOmwgvHLzA5sGVNLJNDyGdf6WRsnkJNu1H7lL55k
linkProvider	Springer Nature
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT8JAEJ4omqgHH6gRQd2D8aBp0rKljyNRCEQgJKLh1my7XW2kYGgxhl_vbGl5GDXRSy_dnTQ725lvdna-AbhEHyF0zcPYhHFT0SlzFdf2XKVMuaDlis8MbiXNJsxOx-r37W5axx1lt92zlGRiqRfFbppMN0qrqtu6qUzXYUOXXXZkiP7wNE8dSBahhGBP3utAw5ylMr8TseqMFgjzS1I08TX1vX995T7sptCSVGd74QDW_GEedpYIB_NQTAcFUUiuyEpxSHQI_faIBwIxKWkmXMtoCMkdhqfSvZHq4Hk0DuKXkCDMJV0ZEaMA7pPk0gFps48gnISkFbz6g0ByJZMaWo9ZYeQRPNZrvduGknZeUDyqGTE-GS1LKjDhWUIXTHYk1pjpCxcBgsot11YtrqqeIVyMwAwE6Axhic2FYXLOmE2PITccDf0TIEI3fE-jBlpdBD-U2xWBCA1lc4wtTVcrgJqpwPFSWnLZHWPgLAiV5ZI6uKSOXFJnWoDr-ZS3GSfHb4NLmV6d9PeMHHnSIsFqhRbgJtPj0uufhJ3-afQFbDV67ZbTanbui7CNUMuaHd6UIBePJ_4ZbHrvcRCNz5Md_Amcsep9
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8NAEB60iujBt1jrYw_iQQlNumkeR7EtFm0pvugtbLJZDbZpaVKR_npn87CtqCBecsnuEHY3M9_szHwDcIo2Quiah74J46aiU-Yqru25SoVyQStVnxncSppNmO221e3anazPaZRnu-chybSmQbI0hXF5yEV5WvimydCj1LC6rZvKZBGWdHRkZE7X3f3TZxhBMgolZHsyxwOVdB7W_E7EvGGaos0vAdLE7jQ2_v3Fm7CeQU5ymZ6RLVjww21YmyEi3IZSNiiI-uSMzBWNRDvQbQ14IBCrkmbCwYwKktTQbZVmj1z2ngejIH7pE4S_pCM9ZRTAfZIkI5AWew_64z65DV79XiA5lEkdtUpaMLkLj436w9W1knVkUDyqGTE-Ga1IijDhWUIXTHYq1pjpCxeBg8ot11YtrqqeIVz0zAwE7gzhis2FYXLOmE33oBAOQn8fiNAN39OogdoYQRHldlUgckPZHH1O09WKoObb4XgZXbnsmtFzpkTLckkdXFJHLqkzKcL555RhytXx2-DDfI-d7LeNHHkDI0FslRbhIt_Tmdc_CTv40-gTWOnUGs5ts31TglVEYFZ6p3MIhXg09o9g2XuLg2h0nBzmDwCO82E
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=Modified+Iterative+Decoding+Algorithm+for+Polar+Code+Using+Maximum+Likelihood+Estimation&rft.jtitle=Wireless+personal+communications&rft.au=Jadhav%2C+Makarand+Mohan&rft.au=Sapkal%2C+Ashok+M&rft.au=Pattarkine%2C+Ram&rft.au=Patil%2C+R+A&rft.date=2018-01-01&rft.pub=Springer+Nature+B.V&rft.issn=0929-6212&rft.eissn=1572-834X&rft.volume=98&rft.issue=2&rft.spage=1821&rft.epage=1833&rft_id=info:doi/10.1007%2Fs11277-017-4947-z&rft.externalDBID=NO_FULL_TEXT
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0929-6212&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0929-6212&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0929-6212&client=summon