Pub Date : 2011-11-01DOI: 10.1109/ISWCS.2011.6125273
Yonathan Murin, R. Dabora, Deniz Gündüz
This work considers reliable transmission of general correlated sources over the multiple-access relay channel (MARC) and the multiple-access broadcast relay channel (MABRC). In MARCs only the destination is interested in a reconstruction of the sources, while in MABRCs both the relay and the destination want to reconstruct the sources. We assume that both the relay and the destination have correlated side information. We find sufficient conditions for reliable communication based on operational separation, as well as necessary conditions on the achievable source-channel rate. For correlated sources transmitted over fading Gaussian MARCs and MABRCs we find conditions under which informational separation is optimal.
{"title":"Source-channel coding for the multiple-access relay channel","authors":"Yonathan Murin, R. Dabora, Deniz Gündüz","doi":"10.1109/ISWCS.2011.6125273","DOIUrl":"https://doi.org/10.1109/ISWCS.2011.6125273","url":null,"abstract":"This work considers reliable transmission of general correlated sources over the multiple-access relay channel (MARC) and the multiple-access broadcast relay channel (MABRC). In MARCs only the destination is interested in a reconstruction of the sources, while in MABRCs both the relay and the destination want to reconstruct the sources. We assume that both the relay and the destination have correlated side information. We find sufficient conditions for reliable communication based on operational separation, as well as necessary conditions on the achievable source-channel rate. For correlated sources transmitted over fading Gaussian MARCs and MABRCs we find conditions under which informational separation is optimal.","PeriodicalId":414065,"journal":{"name":"2011 8th International Symposium on Wireless Communication Systems","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131327106","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-11-01DOI: 10.1109/ISWCS.2011.6125391
H. Ochiai
A power amplifier (PA) is one of the most power consuming analog devices in wireless communications. Precise estimation of the power consumption at the transmitter requires the knowledge of its efficiencies that depend on the signal envelope level to be transmitted. In general, the PA efficiency can be increased by reducing its back-off, but this in turn causes nonlinear distortion. This paper develops a simple analytical approach suitable for examining the trade-off between the PA efficiencies and resulting signal-to-distortion ratio. It can be calculated only from an envelope distribution of a given modulation signal. As an application of the proposed approach, the efficiency improvement of some peak-to-average power ratio reduction schemes proposed for orthogonal frequency-division multiplexing (OFDM) systems is also investigated.
{"title":"On power amplifier efficiencies of linearly modulated signals with nonlinear distortion","authors":"H. Ochiai","doi":"10.1109/ISWCS.2011.6125391","DOIUrl":"https://doi.org/10.1109/ISWCS.2011.6125391","url":null,"abstract":"A power amplifier (PA) is one of the most power consuming analog devices in wireless communications. Precise estimation of the power consumption at the transmitter requires the knowledge of its efficiencies that depend on the signal envelope level to be transmitted. In general, the PA efficiency can be increased by reducing its back-off, but this in turn causes nonlinear distortion. This paper develops a simple analytical approach suitable for examining the trade-off between the PA efficiencies and resulting signal-to-distortion ratio. It can be calculated only from an envelope distribution of a given modulation signal. As an application of the proposed approach, the efficiency improvement of some peak-to-average power ratio reduction schemes proposed for orthogonal frequency-division multiplexing (OFDM) systems is also investigated.","PeriodicalId":414065,"journal":{"name":"2011 8th International Symposium on Wireless Communication Systems","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114362430","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-11-01DOI: 10.1109/ISWCS.2011.6125324
Vera Miloslavskaya, P. Trifonov
The problem of bivariate interpolation in algebraic soft decision decoding of Reed-Solomon codes is considered. Re-encoding transformation for the case of layered interpolation algorithm is derived. A novel hybrid interpolation algorithm based on layered, Lee-O'Sullivan and Kötter algorithms is proposed. The proposed algorithm demonstrates considerable complexity reduction compared to the case of iterative interpolation algorithm.
{"title":"Hybrid interpolation algorithm for algebraic soft decision decoding of Reed-Solomon codes","authors":"Vera Miloslavskaya, P. Trifonov","doi":"10.1109/ISWCS.2011.6125324","DOIUrl":"https://doi.org/10.1109/ISWCS.2011.6125324","url":null,"abstract":"The problem of bivariate interpolation in algebraic soft decision decoding of Reed-Solomon codes is considered. Re-encoding transformation for the case of layered interpolation algorithm is derived. A novel hybrid interpolation algorithm based on layered, Lee-O'Sullivan and Kötter algorithms is proposed. The proposed algorithm demonstrates considerable complexity reduction compared to the case of iterative interpolation algorithm.","PeriodicalId":414065,"journal":{"name":"2011 8th International Symposium on Wireless Communication Systems","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114647845","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-11-01DOI: 10.1109/ISWCS.2011.6125282
Tao Huang, Tao Yang, Jinhong Yuan, I. Land
This paper considers an irregular repeat-accumulate (IRA) coded physical layer network coding scheme in a Gaussian two-way relay channel. We address the convergence behavior of the iterative receiver of the channel coded PNC at the relay. The proposed method is based on a non-trivial extension of the extrinsic information transfer (EXIT) chart analysis to the PNC scheme with superimposed ternary signal. We develop a new method to model the a priori information for the component decoders in the PNC scheme. This proposed method enables the convergence analysis and thus facilitates the design of channel-coded PNC schemes.
{"title":"Convergence analysis for channel-coded physical layer network coding in Gaussian two-way relay channels","authors":"Tao Huang, Tao Yang, Jinhong Yuan, I. Land","doi":"10.1109/ISWCS.2011.6125282","DOIUrl":"https://doi.org/10.1109/ISWCS.2011.6125282","url":null,"abstract":"This paper considers an irregular repeat-accumulate (IRA) coded physical layer network coding scheme in a Gaussian two-way relay channel. We address the convergence behavior of the iterative receiver of the channel coded PNC at the relay. The proposed method is based on a non-trivial extension of the extrinsic information transfer (EXIT) chart analysis to the PNC scheme with superimposed ternary signal. We develop a new method to model the a priori information for the component decoders in the PNC scheme. This proposed method enables the convergence analysis and thus facilitates the design of channel-coded PNC schemes.","PeriodicalId":414065,"journal":{"name":"2011 8th International Symposium on Wireless Communication Systems","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131797262","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-11-01DOI: 10.1109/ISWCS.2011.6125354
Frederic Gabry, R. Thobaben, M. Skoglund
In this paper, we investigate a four single-antenna node network, constituted of a transmitter, a receiver, a cooperative node and a wiretapper. The wiretapper has the ability to eavesdrop the communication or disrupt the transmission by jamming. This results in both cases in the decrease of the secrecy rate. The cooperative node on the other hand aims to improve secrecy by either relaying or jamming. We investigate the secrecy performance of the decode-and-forward and cooperative jamming strategies against this kind of adversary. To model the interaction between the helper and the wiretapper, we define an extensive form game, for which we derive the pure and mixed strategies equilibria. Finally, we compare the performance of the schemes and we analyze the equilibrium outcomes through simulation results.
{"title":"Cooperation for secrecy in presence of an active eavesdropper: A game-theoretic analysis","authors":"Frederic Gabry, R. Thobaben, M. Skoglund","doi":"10.1109/ISWCS.2011.6125354","DOIUrl":"https://doi.org/10.1109/ISWCS.2011.6125354","url":null,"abstract":"In this paper, we investigate a four single-antenna node network, constituted of a transmitter, a receiver, a cooperative node and a wiretapper. The wiretapper has the ability to eavesdrop the communication or disrupt the transmission by jamming. This results in both cases in the decrease of the secrecy rate. The cooperative node on the other hand aims to improve secrecy by either relaying or jamming. We investigate the secrecy performance of the decode-and-forward and cooperative jamming strategies against this kind of adversary. To model the interaction between the helper and the wiretapper, we define an extensive form game, for which we derive the pure and mixed strategies equilibria. Finally, we compare the performance of the schemes and we analyze the equilibrium outcomes through simulation results.","PeriodicalId":414065,"journal":{"name":"2011 8th International Symposium on Wireless Communication Systems","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132971575","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-11-01DOI: 10.1109/ISWCS.2011.6125403
C. Huppert, A. Sezgin
We determine the maximum achievable rate in a cognitive multiple antenna system based on the overlay approach. The primary system is assumed to be oblivious to the cognitive system and thus non-adaptive. Furthermore, a primary receiver with a single antenna is considered. Thus, the covariance matrices for the primary messages are chosen according to beamforming strategies. We establish an iterative method for determining the optimum covariance matrix for the transmit strategy considered here. The optimum solution allows for the evaluation of suboptimum strategies. We investigate two suboptimum methods for determining the covariance matrix with the advantage that closed form solutions are available. The results reveal that the suboptimum solutions achieve performances close to the optimum.
{"title":"On beamforming for overlay cognitive multiple antenna systems","authors":"C. Huppert, A. Sezgin","doi":"10.1109/ISWCS.2011.6125403","DOIUrl":"https://doi.org/10.1109/ISWCS.2011.6125403","url":null,"abstract":"We determine the maximum achievable rate in a cognitive multiple antenna system based on the overlay approach. The primary system is assumed to be oblivious to the cognitive system and thus non-adaptive. Furthermore, a primary receiver with a single antenna is considered. Thus, the covariance matrices for the primary messages are chosen according to beamforming strategies. We establish an iterative method for determining the optimum covariance matrix for the transmit strategy considered here. The optimum solution allows for the evaluation of suboptimum strategies. We investigate two suboptimum methods for determining the covariance matrix with the advantage that closed form solutions are available. The results reveal that the suboptimum solutions achieve performances close to the optimum.","PeriodicalId":414065,"journal":{"name":"2011 8th International Symposium on Wireless Communication Systems","volume":"199 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133427558","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-11-01DOI: 10.1109/ISWCS.2011.6125316
Serkan Ak, N. Odabasioglu, M. Uysal
In this paper, we study joint time delay and channel estimation for a cooperative communication system with amplify-and-forward (AF) relaying. The proposed joint estimator is based on Expectation-Maximization (EM) algorithm and presents a low-complexity solution for iterative maximum likelihood (ML) estimation. Our simulation results demonstrate that the performance of proposed cooperative system lies within 0.5dB of the genie bound (i.e., perfect knowledge of time delays and fading coefficients) at a target bit error rate of 10−4 assuming the deployment of 4 pilot symbols and 3 iterations.
{"title":"EM-based joint time delay and channel estimation for cooperative communications","authors":"Serkan Ak, N. Odabasioglu, M. Uysal","doi":"10.1109/ISWCS.2011.6125316","DOIUrl":"https://doi.org/10.1109/ISWCS.2011.6125316","url":null,"abstract":"In this paper, we study joint time delay and channel estimation for a cooperative communication system with amplify-and-forward (AF) relaying. The proposed joint estimator is based on Expectation-Maximization (EM) algorithm and presents a low-complexity solution for iterative maximum likelihood (ML) estimation. Our simulation results demonstrate that the performance of proposed cooperative system lies within 0.5dB of the genie bound (i.e., perfect knowledge of time delays and fading coefficients) at a target bit error rate of 10−4 assuming the deployment of 4 pilot symbols and 3 iterations.","PeriodicalId":414065,"journal":{"name":"2011 8th International Symposium on Wireless Communication Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125810100","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-11-01DOI: 10.1109/ISWCS.2011.6125394
Roberto Savoia, F. Verde
A performance analysis of both centralized and decentralized cooperation diversity schemes involving decode-and-forward relay nodes is carried out in the case of Middleton Class A impulsive disturbance. It is shown that, with respect to the Gaussian noise case, the presence of impulsive disturbance does not significantly affect the performance of the maximum-likelihood detector in terms of coding gain and asymptotic diversity order. Instead, the major effect of the impulse disturbance is on the finite signal-to-noise ratio (SNR) diversity order, which does not monotonously increase as the SNR rises. Numerical results are provided to validate the derived theoretical results.
{"title":"Performance analysis of decode-and-forward relaying in impulsive noise environments","authors":"Roberto Savoia, F. Verde","doi":"10.1109/ISWCS.2011.6125394","DOIUrl":"https://doi.org/10.1109/ISWCS.2011.6125394","url":null,"abstract":"A performance analysis of both centralized and decentralized cooperation diversity schemes involving decode-and-forward relay nodes is carried out in the case of Middleton Class A impulsive disturbance. It is shown that, with respect to the Gaussian noise case, the presence of impulsive disturbance does not significantly affect the performance of the maximum-likelihood detector in terms of coding gain and asymptotic diversity order. Instead, the major effect of the impulse disturbance is on the finite signal-to-noise ratio (SNR) diversity order, which does not monotonously increase as the SNR rises. Numerical results are provided to validate the derived theoretical results.","PeriodicalId":414065,"journal":{"name":"2011 8th International Symposium on Wireless Communication Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126098240","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-11-01DOI: 10.1109/ISWCS.2011.6125414
J. Scarlett, J. Evans, S. Dey
We optimize the tradeoff between multiuser diversity and training overhead in a single antenna narrowband multiple access channel with a large number of users. A block fading model with independent Rayleigh gains is considered, in which training sequences are sent to the base station one at a time and the user estimated to be the strongest is scheduled to transmit. Considering a lower bound on the ergodic sum capacity with channel uncertainty under an average total power constraint, we optimize the proportion of time and power spent on training in each block. By analyzing the asymptotic behavior of the system as the block length grows large, we optimize the number of users considered for transmission in each block with respect to an approximate expression for the achievable rate, and find first order expressions for the resulting parameters.
{"title":"How much training is needed in fading multiple access channels?","authors":"J. Scarlett, J. Evans, S. Dey","doi":"10.1109/ISWCS.2011.6125414","DOIUrl":"https://doi.org/10.1109/ISWCS.2011.6125414","url":null,"abstract":"We optimize the tradeoff between multiuser diversity and training overhead in a single antenna narrowband multiple access channel with a large number of users. A block fading model with independent Rayleigh gains is considered, in which training sequences are sent to the base station one at a time and the user estimated to be the strongest is scheduled to transmit. Considering a lower bound on the ergodic sum capacity with channel uncertainty under an average total power constraint, we optimize the proportion of time and power spent on training in each block. By analyzing the asymptotic behavior of the system as the block length grows large, we optimize the number of users considered for transmission in each block with respect to an approximate expression for the achievable rate, and find first order expressions for the resulting parameters.","PeriodicalId":414065,"journal":{"name":"2011 8th International Symposium on Wireless Communication Systems","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124061686","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-11-01DOI: 10.1109/ISWCS.2011.6125301
J. Baranda, P. Henarejos, Y. Grunenberger, M. Nájar
In this paper we present our approach regarding the implementation of new wireless radio receivers exploiting filterbank techniques, using a software-development driven approach. The fact that most of the common radio communication systems share a similar structure has been exploited to create a framework which provides a generic layout and tools to construct reconfigurable transmitters and/or receivers. By combining our own generic object-oriented framework built on top of the GNU Radio software framework with the use of the Universal Software Radio Peripheral version 2 (USRP2), we have been able to quickly implement a working proof of concept of an Uplink (UL) Filterbank Multicarrier (FBMC) receiver, both for Single-Input Single-Output (SISO) and Multiple-Input Multiple-Output (MIMO) scenario, within the 7th European framework project called PHYDYAS. As well, a description of the methodology we have applied from software engineering in order to build this demonstrator is herein included, which shows the suitability of using Software Defined Radio (SDR) technologies for fast prototyping of new wireless communication systems.
{"title":"Prototyping with SDR: A quick way to play with next-gen communications systems","authors":"J. Baranda, P. Henarejos, Y. Grunenberger, M. Nájar","doi":"10.1109/ISWCS.2011.6125301","DOIUrl":"https://doi.org/10.1109/ISWCS.2011.6125301","url":null,"abstract":"In this paper we present our approach regarding the implementation of new wireless radio receivers exploiting filterbank techniques, using a software-development driven approach. The fact that most of the common radio communication systems share a similar structure has been exploited to create a framework which provides a generic layout and tools to construct reconfigurable transmitters and/or receivers. By combining our own generic object-oriented framework built on top of the GNU Radio software framework with the use of the Universal Software Radio Peripheral version 2 (USRP2), we have been able to quickly implement a working proof of concept of an Uplink (UL) Filterbank Multicarrier (FBMC) receiver, both for Single-Input Single-Output (SISO) and Multiple-Input Multiple-Output (MIMO) scenario, within the 7th European framework project called PHYDYAS. As well, a description of the methodology we have applied from software engineering in order to build this demonstrator is herein included, which shows the suitability of using Software Defined Radio (SDR) technologies for fast prototyping of new wireless communication systems.","PeriodicalId":414065,"journal":{"name":"2011 8th International Symposium on Wireless Communication Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130244706","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：