Pub Date : 2006-05-08DOI: 10.1109/AUSCTW.2006.1625247
J. Boutros, A. G. Fàbregas, E. Strinati
We study coding for the non-ergodic block-fading channel. In particular, we analyze the error probability of full-diversity binary codes, and we elaborate on how to approach the outage probability limit. In so doing, we introduce the concept outage boundary region, which is a graphical way to illustrate failures in the decoding process. We show that outage achieving codes have a frame error probability which is independent of the block length. Conversely, we show that codes that do not approach the outage probability have an error probability that grows logarithmically with the block length
{"title":"Binary codes in the block-fading channel","authors":"J. Boutros, A. G. Fàbregas, E. Strinati","doi":"10.1109/AUSCTW.2006.1625247","DOIUrl":"https://doi.org/10.1109/AUSCTW.2006.1625247","url":null,"abstract":"We study coding for the non-ergodic block-fading channel. In particular, we analyze the error probability of full-diversity binary codes, and we elaborate on how to approach the outage probability limit. In so doing, we introduce the concept outage boundary region, which is a graphical way to illustrate failures in the decoding process. We show that outage achieving codes have a frame error probability which is independent of the block length. Conversely, we show that codes that do not approach the outage probability have an error probability that grows logarithmically with the block length","PeriodicalId":206040,"journal":{"name":"2006 Australian Communications Theory Workshop","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115454785","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 : 2006-05-08DOI: 10.1109/AUSCTW.2006.1625271
Liang-Ying Chen, B. Krongold, J. Evans
This paper describes a practical and efficient adaptive subcarrier, power and bit allocation algorithm for multiuser OFDM systems. Assuming perfect knowledge of CSI at the transmitter, we look at the problem of minimizing the total power consumption while maintaining individual rate requirements and QoS constraints. We divide the joint allocation into two stages: fast initial allocation and further iterative refinement. An average-SNR approximation is used to determine the subchannel assignment while substantially reducing the computational complexity. The proposed algorithm guarantees improvement through each iteration and converges quickly to a stable suboptimal solution. Numerical results and complexity analysis show that the proposed algorithm offers a beneficial cost-versus-performance tradeoff compared to existing approaches.
{"title":"An Adaptive Resource Allocation Algorithm for Multiuser OFDM","authors":"Liang-Ying Chen, B. Krongold, J. Evans","doi":"10.1109/AUSCTW.2006.1625271","DOIUrl":"https://doi.org/10.1109/AUSCTW.2006.1625271","url":null,"abstract":"This paper describes a practical and efficient adaptive subcarrier, power and bit allocation algorithm for multiuser OFDM systems. Assuming perfect knowledge of CSI at the transmitter, we look at the problem of minimizing the total power consumption while maintaining individual rate requirements and QoS constraints. We divide the joint allocation into two stages: fast initial allocation and further iterative refinement. An average-SNR approximation is used to determine the subchannel assignment while substantially reducing the computational complexity. The proposed algorithm guarantees improvement through each iteration and converges quickly to a stable suboptimal solution. Numerical results and complexity analysis show that the proposed algorithm offers a beneficial cost-versus-performance tradeoff compared to existing approaches.","PeriodicalId":206040,"journal":{"name":"2006 Australian Communications Theory Workshop","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121609971","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 : 2006-05-08DOI: 10.1109/AUSCTW.2006.1625260
L. Rasmussen, E. Uhlemann, F. Brannstrom
With high data rate wireless communications networks, new applications relying on high quality audio, video or control become viable. Examples of such applications are remote tele-medicine, collision avoidance systems, and audio/video entertainment at CD/DVD quality. These applications all demand high data rates, but have different quality-of-service (QoS) requirements in terms of reliability and latency. Currently, mobile communications networks have only limited provisions for QoS implementation and control. The conventional functionality separation in network design may be inhibiting effective implementation of guaranteed QoS. In this paper, we propose and review a system design paradigm based on concatenated system models and iterative signal processing. The novelty of the paradigm is to propagate methodologies of physical layer design across disciplinary boundaries within wireless network design in a bottom-up cross-layer approach. The paper is tutorial in nature, promoting the new view through presenting a series of examples of successful application of concatenated systems design from the physical and link layers. The purpose of the paper is to inspire new research directions.
{"title":"Concatenated Systems and Cross-Layer Design","authors":"L. Rasmussen, E. Uhlemann, F. Brannstrom","doi":"10.1109/AUSCTW.2006.1625260","DOIUrl":"https://doi.org/10.1109/AUSCTW.2006.1625260","url":null,"abstract":"With high data rate wireless communications networks, new applications relying on high quality audio, video or control become viable. Examples of such applications are remote tele-medicine, collision avoidance systems, and audio/video entertainment at CD/DVD quality. These applications all demand high data rates, but have different quality-of-service (QoS) requirements in terms of reliability and latency. Currently, mobile communications networks have only limited provisions for QoS implementation and control. The conventional functionality separation in network design may be inhibiting effective implementation of guaranteed QoS. In this paper, we propose and review a system design paradigm based on concatenated system models and iterative signal processing. The novelty of the paradigm is to propagate methodologies of physical layer design across disciplinary boundaries within wireless network design in a bottom-up cross-layer approach. The paper is tutorial in nature, promoting the new view through presenting a series of examples of successful application of concatenated systems design from the physical and link layers. The purpose of the paper is to inspire new research directions.","PeriodicalId":206040,"journal":{"name":"2006 Australian Communications Theory Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128877060","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 : 2006-05-08DOI: 10.1109/AUSCTW.2006.1625246
Matthew R. McKay, I. Collings
We derive tight expressions for the coded bit error rate of MIMO bit-interleaved coded modulation (BICM) with zero-forcing receivers in spatially-correlated Rayleigh channels. The analysis is simpler and more direct than the standard BICM error event expurgation technique, and yields efficient, accurate expressions for the error probability. Based on the analytical results, we obtain the diversity order and show that it is unaffected by the presence of spatial correlation. We then show that spatial correlation induces an SNR loss with respect to i.i.d. channels, which is quantified, and found to depend explicitly on the eigenvalues of the spatial correlation matrices and the antenna configuration, but not on the coding and modulation parameters
{"title":"Efficient BER Expressions for MIMO-BICM in Spatially-Correlated Rayleigh Channels","authors":"Matthew R. McKay, I. Collings","doi":"10.1109/AUSCTW.2006.1625246","DOIUrl":"https://doi.org/10.1109/AUSCTW.2006.1625246","url":null,"abstract":"We derive tight expressions for the coded bit error rate of MIMO bit-interleaved coded modulation (BICM) with zero-forcing receivers in spatially-correlated Rayleigh channels. The analysis is simpler and more direct than the standard BICM error event expurgation technique, and yields efficient, accurate expressions for the error probability. Based on the analytical results, we obtain the diversity order and show that it is unaffected by the presence of spatial correlation. We then show that spatial correlation induces an SNR loss with respect to i.i.d. channels, which is quantified, and found to depend explicitly on the eigenvalues of the spatial correlation matrices and the antenna configuration, but not on the coding and modulation parameters","PeriodicalId":206040,"journal":{"name":"2006 Australian Communications Theory Workshop","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122111114","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 : 2006-05-08DOI: 10.1109/AUSCTW.2006.1625258
N. H. Ngo, S. S. Pietrobon, S. Barbulescu, C. Burnet
Amplitude phase shift keying (APSK) modulation presents an attractive scheme to overcome nonlinearity effects on nonlinear channels compared to conventional square quadrature amplitude modulation (QAM). In this paper, we investigate the performance of a bit interleaved coded modulation with iterative decoding (BICM-ID) system in which APSK modulation is used to achieve a spectral efficiency of 3 bit/s/Hz. A new iterative receiver is proposed where an extra soft-demapper is used between the two soft input soft output (SISOs) decoders. Extrinsic information exchange for the data and parity bits is optimised according to an appropriate iteration scheduling. Simulation results show a gain of 0.15 dB at a bit error rate (BER) of 10-4 with this new iterative decoding scheme and the optimised constellation over a nonlinear satellite channel
与传统的方正交调幅(QAM)相比，幅度相移键控(APSK)调制是克服非线性信道非线性效应的一种有吸引力的方案。在本文中，我们研究了比特交错编码调制迭代解码(BICM-ID)系统的性能，其中APSK调制用于实现3比特/秒/赫兹的频谱效率。提出了一种新的迭代接收机，在两个软输入软输出(SISOs)解码器之间增加一个软demapper。根据适当的迭代调度优化了数据和奇偶位的外部信息交换。仿真结果表明，在非线性卫星信道上，在误码率为10-4的情况下，该迭代译码方案的增益为0.15 dB
{"title":"Optimisation of 16APSK constellation with a new iterative decoder on the nonlinear channel","authors":"N. H. Ngo, S. S. Pietrobon, S. Barbulescu, C. Burnet","doi":"10.1109/AUSCTW.2006.1625258","DOIUrl":"https://doi.org/10.1109/AUSCTW.2006.1625258","url":null,"abstract":"Amplitude phase shift keying (APSK) modulation presents an attractive scheme to overcome nonlinearity effects on nonlinear channels compared to conventional square quadrature amplitude modulation (QAM). In this paper, we investigate the performance of a bit interleaved coded modulation with iterative decoding (BICM-ID) system in which APSK modulation is used to achieve a spectral efficiency of 3 bit/s/Hz. A new iterative receiver is proposed where an extra soft-demapper is used between the two soft input soft output (SISOs) decoders. Extrinsic information exchange for the data and parity bits is optimised according to an appropriate iteration scheduling. Simulation results show a gain of 0.15 dB at a bit error rate (BER) of 10-4 with this new iterative decoding scheme and the optimised constellation over a nonlinear satellite channel","PeriodicalId":206040,"journal":{"name":"2006 Australian Communications Theory Workshop","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117041754","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 : 2006-05-08DOI: 10.1109/AUSCTW.2006.1625273
A. G. Fàbregas, A. Grant
This paper describes a curve-fitting approach for the design of capacity approaching coded modulation for orthogonal signal sets with non-coherent detection. In particular, bit-interleaved coded modulation with iterative decoding is considered. Decoder metrics are developed that do not require the knowledge of the signal-to-noise ratio, yet still offer very good performance
{"title":"Capacity approaching codes for the non-coherent FSK channel","authors":"A. G. Fàbregas, A. Grant","doi":"10.1109/AUSCTW.2006.1625273","DOIUrl":"https://doi.org/10.1109/AUSCTW.2006.1625273","url":null,"abstract":"This paper describes a curve-fitting approach for the design of capacity approaching coded modulation for orthogonal signal sets with non-coherent detection. In particular, bit-interleaved coded modulation with iterative decoding is considered. Decoder metrics are developed that do not require the knowledge of the signal-to-noise ratio, yet still offer very good performance","PeriodicalId":206040,"journal":{"name":"2006 Australian Communications Theory Workshop","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131607167","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 : 2006-05-08DOI: 10.1109/AUSCTW.2006.1625253
M. Payaró, Jinhong Yuan, M. Lagunas
In this work, we study different capacity formulations in multi-input multi-output channels where the transmitter is only informed with the magnitude of the complex channel matrix coefficients. Perfect channel knowledge is assumed at the receiver side. First, we give the expressions for the ergodic, compound, and outage capacities for our particular model of channel state information. Next, focusing on the compound formulation, we find that the optimal transmitter strategy consists in independent signaling through the transmit dimensions. Finally, we present some results on the optimal power allocation for the maximization of the outage mutual information for a simple MIMO system where the transmitter is equipped with only two antennas.
{"title":"On the Capacity of MIMO Systems with Magnitude Knowledge and Phase Uncertainty","authors":"M. Payaró, Jinhong Yuan, M. Lagunas","doi":"10.1109/AUSCTW.2006.1625253","DOIUrl":"https://doi.org/10.1109/AUSCTW.2006.1625253","url":null,"abstract":"In this work, we study different capacity formulations in multi-input multi-output channels where the transmitter is only informed with the magnitude of the complex channel matrix coefficients. Perfect channel knowledge is assumed at the receiver side. First, we give the expressions for the ergodic, compound, and outage capacities for our particular model of channel state information. Next, focusing on the compound formulation, we find that the optimal transmitter strategy consists in independent signaling through the transmit dimensions. Finally, we present some results on the optimal power allocation for the maximization of the outage mutual information for a simple MIMO system where the transmitter is equipped with only two antennas.","PeriodicalId":206040,"journal":{"name":"2006 Australian Communications Theory Workshop","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114653290","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 : 2006-05-08DOI: 10.1109/AUSCTW.2006.1625248
A. Martinez, A. G. Fàbregas, G. Caire
This paper presents a simple closed-form expression to evaluate the error probability of binary fully-interleaved fading channels. The proposed expression does not require a numerical Laplace transform inversion, numerical integration or similar techniques, and captures the role of the relevant system parameters in the overall error performance. The expression has the same asymptotic behavior as the Bhattacharyya (Chernoff)-union bound but closes the gap with the simulation results. Its precision is numerically validated for coded and uncoded transmission over generic Nakagami fading channels
{"title":"A closed-form approximation for the error probability of coded BPSK fading channels","authors":"A. Martinez, A. G. Fàbregas, G. Caire","doi":"10.1109/AUSCTW.2006.1625248","DOIUrl":"https://doi.org/10.1109/AUSCTW.2006.1625248","url":null,"abstract":"This paper presents a simple closed-form expression to evaluate the error probability of binary fully-interleaved fading channels. The proposed expression does not require a numerical Laplace transform inversion, numerical integration or similar techniques, and captures the role of the relevant system parameters in the overall error performance. The expression has the same asymptotic behavior as the Bhattacharyya (Chernoff)-union bound but closes the gap with the simulation results. Its precision is numerically validated for coded and uncoded transmission over generic Nakagami fading channels","PeriodicalId":206040,"journal":{"name":"2006 Australian Communications Theory Workshop","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122539860","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 : 2006-05-08DOI: 10.1109/AUSCTW.2006.1625267
A. T. Campo, A. Grant
Random network codes are considered for multicast scenarios where not all of the sources are required by the sinks. These unwanted sources could model interfering or even adversarial sources. The objective of the paper is to determine the effect of the interfering sources on the probability of successful decoding. A lower bound on the success probability is determined. The bound is the product of the probability that the random network code is feasible without interference, multiplied by a robustness factor. The robustness factor uniquely depends on the in-degree of the sink and the size of the finite field. Analysis of the robustness factor shows that the effect of interference can be completely mitigated through a small increase in the field size.
{"title":"Robustness of Random Network Coding to Interfering Sources","authors":"A. T. Campo, A. Grant","doi":"10.1109/AUSCTW.2006.1625267","DOIUrl":"https://doi.org/10.1109/AUSCTW.2006.1625267","url":null,"abstract":"Random network codes are considered for multicast scenarios where not all of the sources are required by the sinks. These unwanted sources could model interfering or even adversarial sources. The objective of the paper is to determine the effect of the interfering sources on the probability of successful decoding. A lower bound on the success probability is determined. The bound is the product of the probability that the random network code is feasible without interference, multiplied by a robustness factor. The robustness factor uniquely depends on the in-degree of the sink and the size of the finite field. Analysis of the robustness factor shows that the effect of interference can be completely mitigated through a small increase in the field size.","PeriodicalId":206040,"journal":{"name":"2006 Australian Communications Theory Workshop","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125285276","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 : 2006-05-08DOI: 10.1109/AUSCTW.2006.1625257
M. Hedley, H. Suzuki, G. Daniels
In this paper the performance of a promising MIMO detection algorithm, list sphere detection, is evaluated for a range of list lengths and for four variations to the basic algorithm. The evaluation uses a MIMO-OFDM-BICM system simulation to show bit error performance versus the computational effort, and the results are compared to maximum likelihood detection. The results provide guidance on the selection of an appropriate list length and algorithm. In applications where a short list length must be used due to memory or computation constraints the results show the loss in performance that can be expected
{"title":"Computational efficiency of list sphere detection","authors":"M. Hedley, H. Suzuki, G. Daniels","doi":"10.1109/AUSCTW.2006.1625257","DOIUrl":"https://doi.org/10.1109/AUSCTW.2006.1625257","url":null,"abstract":"In this paper the performance of a promising MIMO detection algorithm, list sphere detection, is evaluated for a range of list lengths and for four variations to the basic algorithm. The evaluation uses a MIMO-OFDM-BICM system simulation to show bit error performance versus the computational effort, and the results are compared to maximum likelihood detection. The results provide guidance on the selection of an appropriate list length and algorithm. In applications where a short list length must be used due to memory or computation constraints the results show the loss in performance that can be expected","PeriodicalId":206040,"journal":{"name":"2006 Australian Communications Theory Workshop","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122285721","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
扫码关注我们
求助内容：
应助结果提醒方式：