A new blind SLM scheme with low complexity of OFDM signals
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Joo, Hyun-Seung | - |
dc.contributor.author | Heo, Seok-Joong | - |
dc.contributor.author | Jeon, Hyun-Bae | - |
dc.contributor.author | No, Jong-Seon | - |
dc.contributor.author | Shin, Dong-Joon | - |
dc.date.accessioned | 2022-12-20T20:49:46Z | - |
dc.date.available | 2022-12-20T20:49:46Z | - |
dc.date.created | 2022-09-16 | - |
dc.date.issued | 2009-09 | - |
dc.identifier.issn | 1550-2252 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/176219 | - |
dc.description.abstract | In this paper, we propose a new blind SLM scheme with low complexity using m-sequence as a phase sequence in OFDM. The proposed scheme significantly reduces the computational complexity for searching the side information of the phase sequence and decoding the alternative symbol sequence at the receiver. After generating alternative symbol sequences using a set of phase sequences, the side information for each alternative symbol sequence is embedded in it through block partitioning and phase rotation. The proposed method does not need additional inverse fast Fourier transform (IFFT) and has the same PAPR reduction performance compared to the conventional SLM scheme. In order to find the side information, a maximum likelihood (ML) decoder with lower complexity is derived, which guarantees lower detection failure probability of side information compared to the conventional blind SLM scheme. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | IEEE | - |
dc.title | A new blind SLM scheme with low complexity of OFDM signals | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Shin, Dong-Joon | - |
dc.identifier.doi | 10.1109/VETECF.2009.5378742 | - |
dc.identifier.scopusid | 2-s2.0-77951458123 | - |
dc.identifier.bibliographicCitation | IEEE Vehicular Technology Conference, pp.1 - 5 | - |
dc.relation.isPartOf | IEEE Vehicular Technology Conference | - |
dc.citation.title | IEEE Vehicular Technology Conference | - |
dc.citation.startPage | 1 | - |
dc.citation.endPage | 5 | - |
dc.type.rims | ART | - |
dc.type.docType | Conference Paper | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordPlus | Block partitioning | - |
dc.subject.keywordPlus | Failure Probability | - |
dc.subject.keywordPlus | Inverse fast Fourier transforms | - |
dc.subject.keywordPlus | Low complexity | - |
dc.subject.keywordPlus | Lower complexity | - |
dc.subject.keywordPlus | M sequence | - |
dc.subject.keywordPlus | Maximum likelihood decoders | - |
dc.subject.keywordPlus | OFDM signal | - |
dc.subject.keywordPlus | PAPR reduction | - |
dc.subject.keywordPlus | Phase rotation | - |
dc.subject.keywordPlus | Phase sequence | - |
dc.subject.keywordPlus | Side information | - |
dc.subject.keywordPlus | Symbol sequences | - |
dc.subject.keywordPlus | Decoding | - |
dc.subject.keywordPlus | Fast Fourier transforms | - |
dc.subject.keywordPlus | Maximum likelihood | - |
dc.subject.keywordPlus | Orthogonal frequency division multiplexing | - |
dc.subject.keywordPlus | Orthogonal functions | - |
dc.subject.keywordPlus | Computational complexity | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/5378742 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.