{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T02:06:13Z","timestamp":1740103573097,"version":"3.37.3"},"reference-count":38,"publisher":"Wiley","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100009392","name":"Prince Sattam bin Abdulaziz University","doi-asserted-by":"publisher","award":["2016\/01\/6637"],"award-info":[{"award-number":["2016\/01\/6637"]}],"id":[{"id":"10.13039\/100009392","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Wireless Communications and Mobile Computing"],"published-print":{"date-parts":[[2017]]},"abstract":"<jats:p>This paper considers codebook-based precoding for Space Shift Keying (SSK) modulation MIMO system. Codebook-based precoding avoids the necessity for full knowledge of Channel State Information (CSI) at the transmitter and alleviates the complexity of generating a CSI-optimized precoder. The receiver selects the codeword that maximizes the Minimum Euclidean Distance (MED) of the received constellation and feeds back its index to the transmitter. In this paper, we first develop a new accurate closed-form Bit Error Rate (BER) for SSK without precoding. Then, we investigate several phase-rotation codebooks with quantized set of phases and systematic structure. Namely, we investigate the Full-Combination, Walsh-Hadamard, Quasi-Orthogonal Sequences, and Orthogonal Array Testing codebooks. In addition, since the size of the Full-Combination codebook may be large, we develop an iterative search method for fast selection of its best codeword. The proposed codebooks significantly improve the BER performance in Rayleigh and Nakagami fading channels, even at high spatial correlation among transmit antennas and CSI estimation error. Moreover, we show that only four phases <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M1\"><mml:mo stretchy=\"false\">{<\/mml:mo><mml:mo>+<\/mml:mo><mml:mn fontstyle=\"italic\">1<\/mml:mn><mml:mo>,<\/mml:mo><mml:mo>+<\/mml:mo><mml:mi>j<\/mml:mi><mml:mo>,<\/mml:mo><mml:mo>-<\/mml:mo><mml:mn fontstyle=\"italic\">1<\/mml:mn><mml:mo>,<\/mml:mo><mml:mo>-<\/mml:mo><mml:mi>j<\/mml:mi><mml:mo stretchy=\"false\">}<\/mml:mo><\/mml:math> are sufficient and further phase granularity does yield significant gain. This avoids hardware multiplication during searching the codebook and applying the codeword.<\/jats:p>","DOI":"10.1155\/2017\/4359843","type":"journal-article","created":{"date-parts":[[2017,11,9]],"date-time":"2017-11-09T18:30:43Z","timestamp":1510252243000},"page":"1-12","source":"Crossref","is-referenced-by-count":3,"title":["Performance Improvement of Space Shift Keying MIMO Systems with Orthogonal Codebook-Based Phase-Rotation Precoding"],"prefix":"10.1155","volume":"2017","author":[{"given":"Mohammed","family":"Al-Ansi","sequence":"first","affiliation":[{"name":"School of Computer and Communication Engineering, Universiti Malaysia Perlis (UniMAP), Perlis, Malaysia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Syed Alwee","family":"Aljunid","sequence":"additional","affiliation":[{"name":"School of Computer and Communication Engineering, Universiti Malaysia Perlis (UniMAP), Perlis, Malaysia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4473-7026","authenticated-orcid":true,"given":"Essam","family":"Sourour","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, College of Engineering at Wadi Aldawaser, Prince Sattam Bin Abdulaziz University, Wadi Aldawaser 11991, Saudi Arabia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1109\/COMST.2014.2327066","volume":"17","year":"May 2015","journal-title":"IEEE Communications Surveys Tutorials"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/jproc.2013.2287851"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2009.080910"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2007.912136"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2008.080739"},{"issue":"3","key":"9","doi-asserted-by":"crossref","first-page":"1687","DOI":"10.1109\/COMST.2016.2533580","volume":"18","year":"2016","journal-title":"IEEE Communications Surveys & Tutorials"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2011.040711.110014"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2012.2232686"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2015.2470656"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2015.2396521"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2010.06.100163"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1049\/iet-com.2014.1065"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2014.031414.140233"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2015.2497692"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2015.2410252"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2015.2424960"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2014.2339297"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2008.081002"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2015.2513380"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1109\/tvt.2014.2324822"},{"key":"45","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-10-5281-1_11"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2003.822365"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2015.2475265"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-3626-0"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2257764"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2012.2186158"},{"year":"November 2007","key":"31"},{"year":"July 2000","key":"32"},{"year":"2010","key":"33"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1109\/18.841175"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864469"},{"key":"37","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1478-6"},{"key":"38","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2005.850359"},{"journal-title":"A Library of Orthogonal Arrays","year":"2005","key":"39"},{"key":"41","doi-asserted-by":"publisher","DOI":"10.1109\/tap.2007.891548"},{"year":"2009","key":"42"},{"year":"2005","key":"43"},{"year":"2005","key":"44"}],"container-title":["Wireless Communications and Mobile Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2017\/4359843.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2017\/4359843.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2017\/4359843.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,9]],"date-time":"2017-11-09T18:30:48Z","timestamp":1510252248000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/wcmc\/2017\/4359843\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":38,"alternative-id":["4359843","4359843"],"URL":"https:\/\/doi.org\/10.1155\/2017\/4359843","relation":{},"ISSN":["1530-8669","1530-8677"],"issn-type":[{"type":"print","value":"1530-8669"},{"type":"electronic","value":"1530-8677"}],"subject":[],"published":{"date-parts":[[2017]]}}}