Blind Channel Estimation for Amplify-and-Forward Two-Way Relay Networks Employing M-PSK Modulation

We consider the problem of channel estimation for amplify-and-forward (AF) two-way relay networks (TWRNs). Most works on this problem focus on pilot-based approaches which impose a significant training overhead that reduces the spectral efficiency of the system. To avoid such losses, this work propo...

Full description

Bibliographic Details
Main Authors: Abdallah, Saeed, Psaromiligkos, Ioannis N.
Format: Text
Language:unknown
Published: arXiv 2011
Subjects:
DML
Online Access:https://dx.doi.org/10.48550/arxiv.1101.4207
https://arxiv.org/abs/1101.4207
id ftdatacite:10.48550/arxiv.1101.4207
record_format openpolar
spelling ftdatacite:10.48550/arxiv.1101.4207 2023-05-15T16:01:23+02:00 Blind Channel Estimation for Amplify-and-Forward Two-Way Relay Networks Employing M-PSK Modulation Abdallah, Saeed Psaromiligkos, Ioannis N. 2011 https://dx.doi.org/10.48550/arxiv.1101.4207 https://arxiv.org/abs/1101.4207 unknown arXiv https://dx.doi.org/10.1109/tsp.2012.2193577 arXiv.org perpetual, non-exclusive license http://arxiv.org/licenses/nonexclusive-distrib/1.0/ Information Theory cs.IT Other Statistics stat.OT FOS Computer and information sciences article-journal Article ScholarlyArticle Text 2011 ftdatacite https://doi.org/10.48550/arxiv.1101.4207 https://doi.org/10.1109/tsp.2012.2193577 2022-04-01T14:34:50Z We consider the problem of channel estimation for amplify-and-forward (AF) two-way relay networks (TWRNs). Most works on this problem focus on pilot-based approaches which impose a significant training overhead that reduces the spectral efficiency of the system. To avoid such losses, this work proposes blind channel estimation algorithms for AF TWRNs that employ constant-modulus (CM) signaling. Our main algorithm is based on the deterministic maximum likelihood (DML) approach. Assuming M-PSK modulation, we show that the resulting estimator is consistent and approaches the true channel with high probability at high SNR for modulation orders higher than 2. For BPSK, however, the DML performs poorly and we propose an alternative algorithm that performs much better by taking into account the BPSK structure of the data symbols. For comparative purposes, we also investigate the Gaussian maximum-likelihood (GML) approach which treats the data symbols as Gaussian-distributed nuisance parameters. We derive the Cramer-Rao bound and use Monte-Carlo simulations to investigate the mean squared error (MSE) performance of the proposed algorithms. We also compare the symbol-error rate (SER) performance of the DML algorithm with that of the training-based least-squares (LS) algorithm and demonstrate that the DML offers a superior tradeoff between accuracy and spectral efficiency. : 29 pages, 8 figures Text DML DataCite Metadata Store (German National Library of Science and Technology) Cramer ENVELOPE(-63.098,-63.098,-64.824,-64.824)
institution Open Polar
collection DataCite Metadata Store (German National Library of Science and Technology)
op_collection_id ftdatacite
language unknown
topic Information Theory cs.IT
Other Statistics stat.OT
FOS Computer and information sciences
spellingShingle Information Theory cs.IT
Other Statistics stat.OT
FOS Computer and information sciences
Abdallah, Saeed
Psaromiligkos, Ioannis N.
Blind Channel Estimation for Amplify-and-Forward Two-Way Relay Networks Employing M-PSK Modulation
topic_facet Information Theory cs.IT
Other Statistics stat.OT
FOS Computer and information sciences
description We consider the problem of channel estimation for amplify-and-forward (AF) two-way relay networks (TWRNs). Most works on this problem focus on pilot-based approaches which impose a significant training overhead that reduces the spectral efficiency of the system. To avoid such losses, this work proposes blind channel estimation algorithms for AF TWRNs that employ constant-modulus (CM) signaling. Our main algorithm is based on the deterministic maximum likelihood (DML) approach. Assuming M-PSK modulation, we show that the resulting estimator is consistent and approaches the true channel with high probability at high SNR for modulation orders higher than 2. For BPSK, however, the DML performs poorly and we propose an alternative algorithm that performs much better by taking into account the BPSK structure of the data symbols. For comparative purposes, we also investigate the Gaussian maximum-likelihood (GML) approach which treats the data symbols as Gaussian-distributed nuisance parameters. We derive the Cramer-Rao bound and use Monte-Carlo simulations to investigate the mean squared error (MSE) performance of the proposed algorithms. We also compare the symbol-error rate (SER) performance of the DML algorithm with that of the training-based least-squares (LS) algorithm and demonstrate that the DML offers a superior tradeoff between accuracy and spectral efficiency. : 29 pages, 8 figures
format Text
author Abdallah, Saeed
Psaromiligkos, Ioannis N.
author_facet Abdallah, Saeed
Psaromiligkos, Ioannis N.
author_sort Abdallah, Saeed
title Blind Channel Estimation for Amplify-and-Forward Two-Way Relay Networks Employing M-PSK Modulation
title_short Blind Channel Estimation for Amplify-and-Forward Two-Way Relay Networks Employing M-PSK Modulation
title_full Blind Channel Estimation for Amplify-and-Forward Two-Way Relay Networks Employing M-PSK Modulation
title_fullStr Blind Channel Estimation for Amplify-and-Forward Two-Way Relay Networks Employing M-PSK Modulation
title_full_unstemmed Blind Channel Estimation for Amplify-and-Forward Two-Way Relay Networks Employing M-PSK Modulation
title_sort blind channel estimation for amplify-and-forward two-way relay networks employing m-psk modulation
publisher arXiv
publishDate 2011
url https://dx.doi.org/10.48550/arxiv.1101.4207
https://arxiv.org/abs/1101.4207
long_lat ENVELOPE(-63.098,-63.098,-64.824,-64.824)
geographic Cramer
geographic_facet Cramer
genre DML
genre_facet DML
op_relation https://dx.doi.org/10.1109/tsp.2012.2193577
op_rights arXiv.org perpetual, non-exclusive license
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
op_doi https://doi.org/10.48550/arxiv.1101.4207
https://doi.org/10.1109/tsp.2012.2193577
_version_ 1766397275398995968