Algorithms for iterative decoding in the presence of strong phase noise

We present two new iterative decoding algorithms for channels affected by strong phase noise and compare them with the best existing algorithms proposed in the literature. The proposed algorithms are obtained as an application of the sum-product algorithm to the factor graph representing the joint a...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE journal on selected areas in communications Ročník 23; číslo 9; s. 1748 - 1757
Hlavní autori:	Colavolpe, G., Barbieri, A., Caire, G.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.09.2005 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Algorithms Channels Channels with memory Complexity Decoding Digital video broadcasting factor graphs (FGs) Fourier series Graphs Iterative algorithms Iterative decoding iterative detection/decoding Kalman filters low-density parity-check (LDPC) codes Mathematical analysis Mathematical models Noise Phase noise Probability density function Random variables Robustness Studies Sum product algorithm sum-product algorithm (SPA) Tikhonov parameterization
ISSN:	0733-8716, 1558-0008
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Abstract	We present two new iterative decoding algorithms for channels affected by strong phase noise and compare them with the best existing algorithms proposed in the literature. The proposed algorithms are obtained as an application of the sum-product algorithm to the factor graph representing the joint a posteriori probability mass function of the information bits given the channel output. In order to overcome the problems due to the presence in the factor graph of continuous random variables, we apply the method of canonical distributions . Several choices of canonical distributions have been considered in the literature. Well-known approaches consist of discretizing continuous variables or treating them as jointly Gaussian, thus obtaining a Kalman estimator. Our first new approach, based on the Fourier series expansion of the phase probability density function, yields better complexity/performance tradeoff with respect to the usual discretized-phase method. Our second new approach, based on the Tikhonov canonical distribution, yields near-optimal performance at very low complexity and is shown to be much more robust than the Kalman method to the placement of pilot symbols in the coded frame. We present numerical results for binary LDPC codes and LDPC-coded modulation, with particular reference to some phase-noise models and coded-modulation formats standardized in the next-generation satellite Digital Video Broadcasting (DVB-S2). These results show that our algorithms achieve near-coherent performance at very low complexity without requiring any change to the existing DVB-S2 standard.
AbstractList	We present two new iterative decoding algorithms for channels affected by strong phase noise and compare them with the best existing algorithms proposed in the literature. The proposed algorithms are obtained as an application of the sum-product algorithm to the factor graph representing the joint a posteriori probability mass function of the information bits given the channel output. In order to overcome the problems due to the presence in the factor graph of continuous random variables, we apply the method of canonical distributions . Several choices of canonical distributions have been considered in the literature. Well-known approaches consist of discretizing continuous variables or treating them as jointly Gaussian, thus obtaining a Kalman estimator. Our first new approach, based on the Fourier series expansion of the phase probability density function, yields better complexity/performance tradeoff with respect to the usual discretized-phase method. Our second new approach, based on the Tikhonov canonical distribution, yields near-optimal performance at very low complexity and is shown to be much more robust than the Kalman method to the placement of pilot symbols in the coded frame. We present numerical results for binary LDPC codes and LDPC-coded modulation, with particular reference to some phase-noise models and coded-modulation formats standardized in the next-generation satellite Digital Video Broadcasting (DVB-S2). These results show that our algorithms achieve near-coherent performance at very low complexity without requiring any change to the existing DVB-S2 standard. The proposed algorithms are obtained as an application of the sum-product algorithm to the factor graph representing the joint a posteriori probability mass function of the information bits given the channel output.
Author	Caire, G. Colavolpe, G. Barbieri, A.
Author_xml	– sequence: 1 givenname: G. surname: Colavolpe fullname: Colavolpe, G. organization: Dipt. di Ingegneria dell'Informazione, Univ. di Parma, Italy – sequence: 2 givenname: A. surname: Barbieri fullname: Barbieri, A. organization: Dipt. di Ingegneria dell'Informazione, Univ. di Parma, Italy – sequence: 3 givenname: G. surname: Caire fullname: Caire, G.
BookMark	eNqNkU2LFDEQhoOs4OzqXfASPOipx0rS-ToOw7qrLHhQzyHdU9nJ0pOMSWbBf283Iwh7WDzVoZ6niqr3klyknJCQtwzWjIH99PX7ZrvmAHJtpDBMvCArJqXpAMBckBVoITqjmXpFLmt9AGB9b_iK3Gym-1xi2x8qDbnQ2LD4Fh-R7nDMu5juaUy07ZEeC1ZMI9IcaG0lz53j3lekKceKr8nL4KeKb_7WK_Lz8_WP7W139-3my3Zz1429hNYJz8UwQNAalEU7cD8I5ftgdWChH5VmOwFDvzNMCtkrrjRqK2wwqOaOHMQV-Xieeyz51wlrc4dYR5wmnzCfqjNWMc25EDP54VmSG8sZE-w_QBBCygV8_wR8yKeS5nOdUZZxyfSyVp2hseRaCwY3xjZ_NKdWfJwcA7fk5Za83JKXO-c1i_BEPJZ48OX3c8q7sxIR8R8uobdgxB8r8qBM
CODEN	ISACEM
CitedBy_id	crossref_primary_10_1109_TCOMM_2022_3196685 crossref_primary_10_1109_JLT_2020_2981883 crossref_primary_10_1109_JLT_2019_2901908 crossref_primary_10_1109_TWC_2007_05270 crossref_primary_10_1109_TSP_2017_2709272 crossref_primary_10_1002_sat_1460 crossref_primary_10_1109_LPT_2011_2164521 crossref_primary_10_1155_2009_296028 crossref_primary_10_1109_JLT_2020_3019257 crossref_primary_10_1109_TCOMM_2008_060510 crossref_primary_10_1109_TWC_2009_12_081708 crossref_primary_10_1002_ett_1225 crossref_primary_10_1109_TWC_2009_080506 crossref_primary_10_1109_LCOMM_2015_2501360 crossref_primary_10_1109_TCOMM_2005_863730 crossref_primary_10_1109_LWC_2017_2742998 crossref_primary_10_1109_JSAC_2008_080409 crossref_primary_10_1109_JSAC_2021_3071841 crossref_primary_10_1109_JLT_2015_2443876 crossref_primary_10_1109_TCOMM_2022_3171809 crossref_primary_10_1109_TCOMM_2019_2937293 crossref_primary_10_1038_s41467_022_31884_2 crossref_primary_10_1109_TCOMM_2025_3538847 crossref_primary_10_1109_TWC_2010_120610_101513 crossref_primary_10_1109_TVT_2016_2570742 crossref_primary_10_1109_TWC_2017_2659724 crossref_primary_10_1109_TCOMM_2009_10_080200 crossref_primary_10_1109_JLT_2015_2477462 crossref_primary_10_1109_JLT_2015_2500608 crossref_primary_10_1109_TCOMM_2009_03_070068 crossref_primary_10_1002_sat_1036 crossref_primary_10_1109_TCOMM_2013_042313_120670 crossref_primary_10_1109_TCOMM_2013_102313_130131 crossref_primary_10_1155_2010_574607 crossref_primary_10_1109_TSP_2013_2243444 crossref_primary_10_1109_LCOMM_2013_091113_131850 crossref_primary_10_1109_JPROC_2007_896518 crossref_primary_10_1109_LSP_2024_3432048 crossref_primary_10_1109_JPROC_2007_896511 crossref_primary_10_1109_LPT_2013_2259476 crossref_primary_10_1109_COMST_2014_2320074 crossref_primary_10_1109_TCOMM_2017_2774803 crossref_primary_10_1186_s13638_018_1136_z crossref_primary_10_1109_JPHOT_2017_2740983 crossref_primary_10_1109_TCOMM_2013_112913_130206 crossref_primary_10_1109_TWC_2008_060358 crossref_primary_10_1109_TAES_2019_2909336 crossref_primary_10_1109_TVT_2015_2440300 crossref_primary_10_1109_JLT_2015_2448109 crossref_primary_10_1109_TCOMM_2007_908520 crossref_primary_10_1109_TSP_2006_890915 crossref_primary_10_1109_TSP_2006_887108 crossref_primary_10_1109_LCOMM_2021_3132965 crossref_primary_10_1109_TCOMM_2012_081412_110455 crossref_primary_10_1109_TCOMM_2018_2854164 crossref_primary_10_1049_iet_com_2016_0597 crossref_primary_10_1109_TCOMM_2015_2408605 crossref_primary_10_1109_JSAC_2025_3543543 crossref_primary_10_1109_TCOMM_2014_2338871 crossref_primary_10_1109_TWC_2006_1673087 crossref_primary_10_1109_TBC_2007_903603 crossref_primary_10_1155_2009_568570 crossref_primary_10_1109_TCOMM_2015_2506553 crossref_primary_10_1109_TCOMM_2011_120710_090467 crossref_primary_10_1109_TSP_2009_2021452 crossref_primary_10_1109_TWC_2016_2558188 crossref_primary_10_1109_TWC_2007_05237 crossref_primary_10_1049_iet_com_2011_0851 crossref_primary_10_1109_TCOMM_2015_2498163 crossref_primary_10_1109_JLT_2012_2187635 crossref_primary_10_1109_TWC_2007_05872 crossref_primary_10_1016_j_dsp_2016_12_011 crossref_primary_10_1109_TCOMM_2019_2909201 crossref_primary_10_1109_TCOMM_2006_887501 crossref_primary_10_1109_JPROC_2007_896497 crossref_primary_10_1109_ACCESS_2018_2867729 crossref_primary_10_1109_LSP_2016_2593917 crossref_primary_10_1109_TCOMM_2009_04_070310 crossref_primary_10_1109_TCOMM_2013_13_120698 crossref_primary_10_1109_TCOMM_2011_051311_100047 crossref_primary_10_1016_j_sigpro_2015_11_005 crossref_primary_10_1109_LPT_2021_3076414 crossref_primary_10_4018_jitn_2012070105 crossref_primary_10_1049_iet_com_2014_0900 crossref_primary_10_1109_TVT_2024_3519540 crossref_primary_10_1109_TCOMM_2020_3042265 crossref_primary_10_1109_TCSI_2013_2285698 crossref_primary_10_1109_LCOMM_2016_2615901 crossref_primary_10_1109_COMST_2023_3287431 crossref_primary_10_1109_TWC_2010_100510_100107 crossref_primary_10_1049_iet_com_2015_0453 crossref_primary_10_1109_TCOMM_2019_2912569 crossref_primary_10_1109_TCOMM_2013_052013_120494 crossref_primary_10_1109_TCOMM_2009_09_080028 crossref_primary_10_1109_TCOMM_2013_090213_120763 crossref_primary_10_1109_TCOMM_2015_2465389 crossref_primary_10_1109_JLT_2011_2164237 crossref_primary_10_1109_JLT_2019_2907311 crossref_primary_10_1109_LCOMM_2019_2955730 crossref_primary_10_1109_TCOMM_2019_2896190 crossref_primary_10_1049_iet_com_2013_0790 crossref_primary_10_1109_TBC_2007_912849 crossref_primary_10_1016_j_dsp_2011_07_003 crossref_primary_10_1109_TSP_2012_2202652 crossref_primary_10_1109_TCOMM_2021_3112216 crossref_primary_10_1155_2008_385421 crossref_primary_10_1109_TCOMM_2011_082011_100217 crossref_primary_10_1109_TSP_2015_2420533 crossref_primary_10_1109_JLT_2016_2593981 crossref_primary_10_1109_JLT_2019_2931987 crossref_primary_10_1002_sat_1006 crossref_primary_10_1109_TCOMM_2021_3139630 crossref_primary_10_1155_2009_645615 crossref_primary_10_3390_app10175800 crossref_primary_10_1109_TCOMM_2018_2829865
Cites_doi	10.1109/ICC.2004.1312603 10.1109/ICC.2003.1204575 10.1109/ICC.2002.997108 10.1109/TIT.1981.1056400 10.1109/TCOMM.2003.809286 10.1109/18.910595 10.1109/26.974260 10.1109/ISIT.2002.1023441 10.1109/TCOMM.2004.826353 10.1109/ISIT.2003.1228245 10.1002/0471200611 10.1155/wcn.2005.117 10.1109/TCOMM.2003.813258 10.1109/ICC.2005.1494446 10.1109/ICC.2003.1203994 10.1109/26.870016 10.1109/ISIT.2001.936098 10.1109/TCOMM.2003.818087 10.1109/ICC.2004.1312544 10.1049/ip-com:20000175 10.1109/18.910572 10.1007/BF02995452 10.1109/26.843126
ContentType	Journal Article
Copyright	Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2005
Copyright_xml	– notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2005
DBID	97E RIA RIE AAYXX CITATION 7SP 8FD L7M H8D F28 FR3
DOI	10.1109/JSAC.2005.853813
DatabaseName	IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE/IET Electronic Library CrossRef Electronics & Communications Abstracts Technology Research Database Advanced Technologies Database with Aerospace Aerospace Database ANTE: Abstracts in New Technology & Engineering Engineering Research Database
DatabaseTitle	CrossRef Technology Research Database Advanced Technologies Database with Aerospace Electronics & Communications Abstracts Aerospace Database Engineering Research Database ANTE: Abstracts in New Technology & Engineering
DatabaseTitleList	Technology Research Database Engineering Research Database Technology Research Database Technology Research Database
Database_xml	– sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering
EISSN	1558-0008
EndPage	1757
ExternalDocumentID	2361818591 10_1109_JSAC_2005_853813 1504908
Genre	orig-research
GroupedDBID	-~X .DC 0R~ 29I 3EH 4.4 41~ 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACGFO ACGFS ACIWK ACNCT ADRHT AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS EJD HZ~ H~9 IBMZZ ICLAB IES IFIPE IFJZH IPLJI JAVBF LAI M43 O9- OCL P2P RIA RIE RNS TN5 VH1 AAYXX CITATION 7SP 8FD L7M RIG H8D F28 FR3
ID	FETCH-LOGICAL-c450t-3a23bb0f77069e9b2ab36a4f97f1f4c671d30b4d8153546267e7939f8e61d35b3
IEDL.DBID	RIE
ISICitedReferencesCount	199
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000231693900007&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0733-8716
IngestDate	Sun Sep 28 05:20:06 EDT 2025 Sun Nov 09 12:45:45 EST 2025 Sun Sep 28 11:46:05 EDT 2025 Mon Jun 30 10:13:49 EDT 2025 Tue Nov 18 21:49:15 EST 2025 Sat Nov 29 08:06:35 EST 2025 Wed Aug 27 02:47:40 EDT 2025
IsPeerReviewed	true
IsScholarly	true
Issue	9
Language	English
License	https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c450t-3a23bb0f77069e9b2ab36a4f97f1f4c671d30b4d8153546267e7939f8e61d35b3
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 ObjectType-Article-2 ObjectType-Feature-1 content type line 23
PQID	869125173
PQPubID	23500
PageCount	10
ParticipantIDs	proquest_miscellaneous_28921131 proquest_miscellaneous_896172233 crossref_primary_10_1109_JSAC_2005_853813 proquest_miscellaneous_28033551 ieee_primary_1504908 crossref_citationtrail_10_1109_JSAC_2005_853813 proquest_journals_869125173
PublicationCentury	2000
PublicationDate	2005-09-01
PublicationDateYYYYMMDD	2005-09-01
PublicationDate_xml	– month: 09 year: 2005 text: 2005-09-01 day: 01
PublicationDecade	2000
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	IEEE journal on selected areas in communications
PublicationTitleAbbrev	J-SAC
PublicationYear	2005
Publisher	IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml	– name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References	ref13 ref12 ref34 ref15 ref14 ref30 ref11 ref33 ten Brink (ref31) 2000; 54 ref2 ref1 Oppenheim (ref27) 1989 ref17 ref16 ref19 Colavolpe (ref32) 2004 ref18 Ginesi (ref22) 2003 Benvenuti (ref23) Ferrari (ref25) 2004 ref24 Jin (ref10) ref21 Zhang (ref20) ref28 (ref29) 2003 ref8 ref7 ref9 ref4 ref3 ref6 ref5 Abramowitz (ref26) 1972
References_xml	– ident: ref14 doi: 10.1109/ICC.2004.1312603 – ident: ref17 doi: 10.1109/ICC.2003.1204575 – ident: ref15 doi: 10.1109/ICC.2002.997108 – volume-title: Proc. 41st Allerton Conf. ident: ref10 article-title: On iterative joint decoding and demodulation – ident: ref24 doi: 10.1109/TIT.1981.1056400 – ident: ref21 doi: 10.1109/TCOMM.2003.809286 – year: 2003 ident: ref22 article-title: Pilot-aided carrier synchronization techniques for broadband satellite transmissions – start-page: 87 volume-title: Proc. Int. Symp. Turbo Codes, Relat. Topics ident: ref20 article-title: Application of turbo principle to carrier phase recovery in turbo encoded bit-interleaved coded modulation system – ident: ref8 doi: 10.1109/18.910595 – ident: ref6 doi: 10.1109/26.974260 – ident: ref9 doi: 10.1109/ISIT.2002.1023441 – ident: ref16 doi: 10.1109/TCOMM.2004.826353 – ident: ref11 doi: 10.1109/ISIT.2003.1228245 – volume: 54 start-page: 389 issue: 6 year: 2000 ident: ref31 article-title: Designing iterative decoding schemes with the extrinsic information transfer chart publication-title: AEU Int. J. Electronic. Commun. – year: 2004 ident: ref32 article-title: Iterative joint detection and decoding for communications under random time-varying carrier phase – volume-title: Discrete- Time Signal Processing. year: 1989 ident: ref27 – ident: ref28 doi: 10.1002/0471200611 – volume-title: Detection Algorithms for Wireless Communications. year: 2004 ident: ref25 – ident: ref18 doi: 10.1155/wcn.2005.117 – ident: ref13 doi: 10.1109/TCOMM.2003.813258 – year: 2003 ident: ref29 article-title: Digital video broadcasting (DVB): Second generation framing structure, channel coding and modulation systems for broadcasting, interactive services, news gathering and other broadband satellite applications – ident: ref34 doi: 10.1109/ICC.2005.1494446 – ident: ref19 doi: 10.1109/ICC.2003.1203994 – ident: ref4 doi: 10.1109/26.870016 – ident: ref33 doi: 10.1109/ISIT.2001.936098 – ident: ref7 doi: 10.1109/TCOMM.2003.818087 – ident: ref12 doi: 10.1109/ICC.2004.1312544 – ident: ref2 doi: 10.1049/ip-com:20000175 – ident: ref1 doi: 10.1109/18.910572 – start-page: 177 volume-title: Proc. 8th Int. Workshop Signal Process. Space Commun. ident: ref23 article-title: Code-aware carrier phase noise compensation on turbo-coded spectrally-efficient highorder modulations – volume-title: D. J. C. MacKay. Regular LDPC ident: ref30 – ident: ref5 doi: 10.1007/BF02995452 – ident: ref3 doi: 10.1109/26.843126 – year: 1972 ident: ref26 article-title: Handbook of Mathematical Functions
SSID	ssj0014482
Score	2.2986119
Snippet	We present two new iterative decoding algorithms for channels affected by strong phase noise and compare them with the best existing algorithms proposed in the... The proposed algorithms are obtained as an application of the sum-product algorithm to the factor graph representing the joint a posteriori probability mass...
SourceID	proquest crossref ieee
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	1748
SubjectTerms	Algorithms Channels Channels with memory Complexity Decoding Digital video broadcasting factor graphs (FGs) Fourier series Graphs Iterative algorithms Iterative decoding iterative detection/decoding Kalman filters low-density parity-check (LDPC) codes Mathematical analysis Mathematical models Noise Phase noise Probability density function Random variables Robustness Studies Sum product algorithm sum-product algorithm (SPA) Tikhonov parameterization
Title	Algorithms for iterative decoding in the presence of strong phase noise
URI	https://ieeexplore.ieee.org/document/1504908 https://www.proquest.com/docview/869125173 https://www.proquest.com/docview/28033551 https://www.proquest.com/docview/28921131 https://www.proquest.com/docview/896172233
Volume	23
WOSCitedRecordID	wos000231693900007&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: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1558-0008 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014482 issn: 0733-8716 databaseCode: RIE dateStart: 19830101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3fT9swED4B4mE8jB8dorANP-wFiaxOHNvxY1WNIR4Q0obUtyhxzlAJkoq0-_s5O20HGqvEWySfJeuc833nz3cH8C3mLpEF2beUnmZMChll6DCKNVYGMU1Q2dBsQl9fZ-OxudmA81UuDCKGx2f43X8GLr9q7NxflQ0IvHieahM2tVZdrtaKMaAwIzAGWojIBwFLSpKbwdWv4ai7PSHflMXilQsKPVX-OYiDd7nYfd-69uDjAkWyYbft-7CB9QHsvKgt2IOfw4e7hiL_-8eWETBlXflkOttYRRGn91hsUjOCf2waMpAsssax1t-M37HpPTk3VjeTFj_B7cWP36PLaNE1IbKp5LNIFIkoS-605sqgKZOiFKpIndEudqlVOq4EL9Mqo7NOphTPaCQbNS5DRSOyFIewVTc1HgEj9FZx5RIuRJFqTq69UGhFUtlSal2ZPgyWisztoqS472zxkIfQgpvcq953upR5p_o-nK1mTLtyGmtke17Vf-U6LffhZLlX-cLe2jxTxiM1TZNOV6NkKJ79KGps5m3u23ARuIrXSRgKhwVJsP9IZMYDvkSI47fXdgIfQmnX8AbtM2zNnub4Bbbtn9mkffoafthn3RbnaA
linkProvider	IEEE
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3da9swED-6dLDuod3Wjmb90sNeBvUiW5ZlPYbSr60Lg7XQN2PLpzTQ2SFO9vfvJDtZx9ZC3ww6gTj5dL_TT3cH8DHkNpI52beUjmaMchmkaDEIFZYaMY4wMb7ZhBqN0ttb_X0Njle5MIjoH5_hZ_fpufyyNgt3VTYg8OJ4qhew7jpnddlaK86AAg3PGSghAhcGLElJrgdffgxP2vsT8k5pKP5yQr6ryj9HsfcvZ1vPW9kb2OxwJBu2G_8W1rB6B68fVBfchvPh_bim2P_uZ8MImrK2gDKdbqykmNP5LDapGAFANvU5SAZZbVnj7sbHbHpH7o1V9aTBHbg5O70-uQi6vgmBiSWfByKPRFFwqxRPNOoiyguR5LHVyoY2NokKS8GLuEzptJMxRTQKyUq1TTGhEVmI99Cr6gp3gRF-K3liIy5EHitOzj1P0IioNIVUqtR9GCwVmZmuqLjrbXGf-eCC68yp3vW6lFmr-j58Ws2YtgU1npDddqr-I9dquQ97y73KOotrsjTRDqspmnS0GiVTcfxHXmG9aDLXiIvgVfiUhKaAWJAEe0Qi1Q7yRUJ8-P_ajuDVxfW3q-zqcvR1DzZ8oVf_Im0fevPZAg_gpfk1nzSzQ__z_gYQleqx
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=Algorithms+for+iterative+decoding+in+the+presence+of+strong+phase+noise&rft.jtitle=IEEE+journal+on+selected+areas+in+communications&rft.au=Colavolpe%2C+G&rft.au=Barbieri%2C+A&rft.au=Caire%2C+G&rft.date=2005-09-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.issn=0733-8716&rft.eissn=1558-0008&rft.volume=23&rft.issue=9&rft.spage=1748&rft_id=info:doi/10.1109%2FJSAC.2005.853813&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=2361818591
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0733-8716&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0733-8716&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0733-8716&client=summon