{"id":"https://openalex.org/W2036415965","doi":"https://doi.org/10.1109/ispacs.2011.6146175","title":"Reduced-complexity modified per-survivor iterative timing recovery using M-algorithm for magnetic recording system","display_name":"Reduced-complexity modified per-survivor iterative timing recovery using M-algorithm for magnetic recording system","publication_year":2011,"publication_date":"2011-12-01","ids":{"openalex":"https://openalex.org/W2036415965","doi":"https://doi.org/10.1109/ispacs.2011.6146175","mag":"2036415965"},"language":"en","primary_location":{"id":"doi:10.1109/ispacs.2011.6146175","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ispacs.2011.6146175","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 International Symposium on Intelligent Signal Processing and Communications Systems (ISPACS)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078236688","display_name":"Chanon Warisarn","orcid":"https://orcid.org/0000-0002-8408-1893"},"institutions":[{"id":"https://openalex.org/I91538806","display_name":"King Mongkut's Institute of Technology Ladkrabang","ror":"https://ror.org/055mf0v62","country_code":"TH","type":"education","lineage":["https://openalex.org/I91538806"]}],"countries":["TH"],"is_corresponding":false,"raw_author_name":"Chanon Warisarn","raw_affiliation_strings":["College of Data Storage Innovation, King Mongkut's Institute of Technology Ladkrabang, Bangkok, Thailand","College of Data Storage Innovation, Thailand"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Data Storage Innovation, King Mongkut's Institute of Technology Ladkrabang, Bangkok, Thailand","institution_ids":["https://openalex.org/I91538806"]},{"raw_affiliation_string":"College of Data Storage Innovation, Thailand","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109871505","display_name":"Pornchai Supnithi","orcid":null},"institutions":[{"id":"https://openalex.org/I91538806","display_name":"King Mongkut's Institute of Technology Ladkrabang","ror":"https://ror.org/055mf0v62","country_code":"TH","type":"education","lineage":["https://openalex.org/I91538806"]}],"countries":["TH"],"is_corresponding":false,"raw_author_name":"Pornchai Supnithi","raw_affiliation_strings":["Telecommunications Engineering Department, King Mongkut's Institute of Technology Ladkrabang, Bangkok, Thailand","Telecommunications Engineering Department, King Mongkut's Institute of Technology Ladkrabang Bangkok, Thailand"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Telecommunications Engineering Department, King Mongkut's Institute of Technology Ladkrabang, Bangkok, Thailand","institution_ids":["https://openalex.org/I91538806"]},{"raw_affiliation_string":"Telecommunications Engineering Department, King Mongkut's Institute of Technology Ladkrabang Bangkok, Thailand","institution_ids":["https://openalex.org/I91538806"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028297482","display_name":"Piya Kovintavewat","orcid":"https://orcid.org/0000-0003-1259-4996"},"institutions":[{"id":"https://openalex.org/I4210139698","display_name":"Nakhon Pathom Rajabhat University","ror":"https://ror.org/03y12yp46","country_code":"TH","type":"education","lineage":["https://openalex.org/I4210139698"]}],"countries":["TH"],"is_corresponding":false,"raw_author_name":"Piya Kovintavewat","raw_affiliation_strings":["Data Storage Technology Research Unit, Nakhon Pathom Rajabhat University, Nakhon Pathom, Thailand","Data Storage Technology Research Unit, Nakhon Pathom Rajabhat University, Thailand"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Data Storage Technology Research Unit, Nakhon Pathom Rajabhat University, Nakhon Pathom, Thailand","institution_ids":["https://openalex.org/I4210139698"]},{"raw_affiliation_string":"Data Storage Technology Research Unit, Nakhon Pathom Rajabhat University, Thailand","institution_ids":["https://openalex.org/I4210139698"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.11189221,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"54","issue":null,"first_page":"1","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11447","display_name":"Blind Source Separation Techniques","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7278398275375366},{"id":"https://openalex.org/keywords/viterbi-algorithm","display_name":"Viterbi algorithm","score":0.6661229729652405},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6340442299842834},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5852682590484619},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.4760594069957733},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.45530906319618225},{"id":"https://openalex.org/keywords/preamble","display_name":"Preamble","score":0.4340381622314453},{"id":"https://openalex.org/keywords/noise","display_name":"Noise (video)","score":0.41427645087242126},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2331255078315735},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.10906237363815308},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09193333983421326},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.08958768844604492}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7278398275375366},{"id":"https://openalex.org/C60582962","wikidata":"https://www.wikidata.org/wiki/Q83886","display_name":"Viterbi algorithm","level":3,"score":0.6661229729652405},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6340442299842834},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5852682590484619},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4760594069957733},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.45530906319618225},{"id":"https://openalex.org/C2780691134","wikidata":"https://www.wikidata.org/wiki/Q1129448","display_name":"Preamble","level":3,"score":0.4340381622314453},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.41427645087242126},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2331255078315735},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.10906237363815308},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09193333983421326},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.08958768844604492},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/ispacs.2011.6146175","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ispacs.2011.6146175","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 International Symposium on Intelligent Signal Processing and Communications Systems (ISPACS)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.893.4844","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.893.4844","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.researchgate.net/profile/Chanon_Warisarn/publication/263653083_Reduced-Complexity_Modified_Per-Survivor_Iterative_Timing_Recovery_Using_M-Algorithm_for_Magnetic_Recording_System/links/0046353b6c5de3b4fd000000.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.894.6351","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.894.6351","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.researchgate.net/profile/Chanon_Warisarn/publication/241635335_Reduced-complexity_modified_per-survivor_iterative_timing_recovery_using_M-algorithm_for_magnetic_recording_system/links/02e7e534caad474c5f000000.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1583690512","https://openalex.org/W1960478496","https://openalex.org/W2023542195","https://openalex.org/W2030762874","https://openalex.org/W2107888069","https://openalex.org/W2113204331","https://openalex.org/W2119411189","https://openalex.org/W2122323945","https://openalex.org/W2128765501","https://openalex.org/W2137984713","https://openalex.org/W2152797116","https://openalex.org/W2153065219","https://openalex.org/W2160574074","https://openalex.org/W6676818650"],"related_works":["https://openalex.org/W3131553538","https://openalex.org/W2369766703","https://openalex.org/W3204754495","https://openalex.org/W2392460115","https://openalex.org/W4402159933","https://openalex.org/W2391859761","https://openalex.org/W4402160580","https://openalex.org/W203335141","https://openalex.org/W2933135490","https://openalex.org/W2101322133"],"abstract_inverted_index":{"A":[0],"modified":[1],"per-survivor":[2,45],"iterative":[3,67],"timing":[4,10,27,57,68],"recovery":[5,28,69],"(MPS-ITR),":[6],"which":[7],"jointly":[8],"performs":[9],"recovery,":[11],"equalization,":[12],"and":[13],"error-correction":[14],"decoding,":[15],"has":[16,74],"been":[17],"proposed":[18],"in":[19,41,95],"[1]":[20],"to":[21,50,90,106],"deal":[22],"with":[23,43],"the":[24,63,103,107,116],"problem":[25],"of":[26],"operating":[29],"at":[30,113],"low":[31],"signal-to-noise":[32],"ratio.":[33],"Practically,":[34],"this":[35,79],"scheme":[36,86],"exploits":[37],"a":[38,44,83],"split-preamble":[39],"strategy":[40],"conjunction":[42],"soft-output":[46],"Viterbi":[47],"algorithm":[48],"equalizer":[49],"make":[51,91],"it":[52,72,92],"more":[53,93],"robust":[54],"against":[55],"severe":[56],"jitters":[58],"or":[59],"cycle":[60],"slips.":[61],"Although":[62],"MPS-ITR":[64,85],"outperforms":[65],"other":[66,122],"schemes":[70],"[1],":[71],"still":[73],"very":[75],"high":[76],"complexity.":[77],"In":[78],"paper,":[80],"we":[81],"propose":[82],"reduced-complexity":[84],"(denoted":[87],"as":[88],"MPS-ITR-M)":[89],"implementable":[94],"real-life":[96],"applications.":[97],"This":[98],"is":[99],"achieved":[100],"by":[101],"applying":[102],"M-algorithm":[104],"[2]":[105],"MPS-ITR.":[108],"Numerical":[109],"results":[110],"indicate":[111],"that":[112],"low-to-moderate":[114],"complexity,":[115],"MPS-ITR-M":[117],"will":[118],"perform":[119],"better":[120],"than":[121],"schemes.":[123]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}