{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T09:38:07Z","timestamp":1730194687222,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1109\/acssc.2017.8335522","type":"proceedings-article","created":{"date-parts":[[2018,4,18]],"date-time":"2018-04-18T22:21:42Z","timestamp":1524090102000},"page":"1110-1114","source":"Crossref","is-referenced-by-count":1,"title":["Single carrier frequency domain compressed training adaptive equalization"],"prefix":"10.1109","author":[{"given":"Baki Berkay","family":"Yilmaz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alper Tunga","family":"Erdogan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/acs.1137"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2005.853896"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2016.7472613"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/35.995852"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2008.926657"},{"key":"ref15","first-page":"372","article-title":"A method of solving a convex programming problem with convergence rate 0(1\/k2)","volume":"27","author":"nesterov","year":"1983","journal-title":"Soviet Mathematics Doklady"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2017.2711025"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2014.2329397"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/49.730448"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/78.301833"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/5.720246"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2005.849195"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/26.870004"},{"key":"ref8","first-page":"3593","article-title":"Maximum-likelihood blind fir multichannel estimation with gaussian prior for the symbols","volume":"5","author":"carvalho","year":"1997","journal-title":"Proc IEEE International Conference on Acoustics Speech and Signal Processing (ICASSP'97)"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2007.04.017"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"1136","DOI":"10.1109\/78.502327","article-title":"An analytical constant modulus allgorithm","volume":"44","author":"van","year":"1996","journal-title":"IEEE Transactions on Signal Processing"},{"journal-title":"Digital Communications","year":"2000","author":"proakis","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2005.857051"}],"event":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","start":{"date-parts":[[2017,10,29]]},"location":"Pacific Grove, CA, USA","end":{"date-parts":[[2017,11,1]]}},"container-title":["2017 51st Asilomar Conference on Signals, Systems, and Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8330843\/8335116\/08335522.pdf?arnumber=8335522","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T04:46:18Z","timestamp":1643172378000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8335522\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/acssc.2017.8335522","relation":{},"subject":[],"published":{"date-parts":[[2017,10]]}}}