Pub Date : 2011-05-17DOI: 10.1109/CWIT.2011.5872134
K. Asadzadeh, A. Farid, S. Hranilovic
A novel bandwidth efficient method to implement orthogonal frequency division multiplexing (OFDM) on intensity modulated direct detection (IM/DD) channels is presented and termed spectrally factorized optical OFDM (SFO-OFDM). It is shown that a necessary and sufficient condition for a band-limited periodic signal to be positive for all time is that the frequency coefficients form an autocorrelation sequence. Instead of sending data directly on the subcarriers, the autocorrelation of the complex data sequence is performed before transmission to guarantee non-negativity. In z-domain, the average optical power is linked to the position of the zeros and used for the design of signal sets. In contrast to previous approaches, SFO-OFDM is able to use the entire bandwidth for data transmission and does not require reserved subcarriers. Using a sub-optimal design technique with 9 subcarriers and 8 bits per symbol, SFO-OFDM has a 0.5 dB gain over ACO-OFDM at a BER of 10−5 and a reduction in peak-to-average ratio of more than 30%.
{"title":"Spectrally factorized optical OFDM","authors":"K. Asadzadeh, A. Farid, S. Hranilovic","doi":"10.1109/CWIT.2011.5872134","DOIUrl":"https://doi.org/10.1109/CWIT.2011.5872134","url":null,"abstract":"A novel bandwidth efficient method to implement orthogonal frequency division multiplexing (OFDM) on intensity modulated direct detection (IM/DD) channels is presented and termed spectrally factorized optical OFDM (SFO-OFDM). It is shown that a necessary and sufficient condition for a band-limited periodic signal to be positive for all time is that the frequency coefficients form an autocorrelation sequence. Instead of sending data directly on the subcarriers, the autocorrelation of the complex data sequence is performed before transmission to guarantee non-negativity. In z-domain, the average optical power is linked to the position of the zeros and used for the design of signal sets. In contrast to previous approaches, SFO-OFDM is able to use the entire bandwidth for data transmission and does not require reserved subcarriers. Using a sub-optimal design technique with 9 subcarriers and 8 bits per symbol, SFO-OFDM has a 0.5 dB gain over ACO-OFDM at a BER of 10−5 and a reduction in peak-to-average ratio of more than 30%.","PeriodicalId":250626,"journal":{"name":"2011 12th Canadian Workshop on Information Theory","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116902680","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-05-17DOI: 10.1109/CWIT.2011.5872105
M. Chiang
This tutorial discusses the optimization models and methods in wireless network resource allocation, especially power control and scheduling. Emphasis will be on deriving distributed algorithms, bridging the theory-practice gap, and evaluating fairness of allocation. Both classical results and recent advances will be covered, and implications to industry standards and practical implementation discussed.
{"title":"Optimizing wireless network resource allocation","authors":"M. Chiang","doi":"10.1109/CWIT.2011.5872105","DOIUrl":"https://doi.org/10.1109/CWIT.2011.5872105","url":null,"abstract":"This tutorial discusses the optimization models and methods in wireless network resource allocation, especially power control and scheduling. Emphasis will be on deriving distributed algorithms, bridging the theory-practice gap, and evaluating fairness of allocation. Both classical results and recent advances will be covered, and implications to industry standards and practical implementation discussed.","PeriodicalId":250626,"journal":{"name":"2011 12th Canadian Workshop on Information Theory","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115908839","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-05-17DOI: 10.1109/CWIT.2011.5872148
J. L. Morales, S. Roy
In this paper, we present a method which jointly performs robust channel estimation and signal detection over rank-deficient MIMO links. This technique achieves an excellent estimation of the channel matrix by using all detected symbols within a data frame. Symbol detection is achieved by means of a sphere decoding algorithm. The proposed scheme is equivalent to having the training preamble occupy the entire data frame. The Mean Square Error (MSE) of the channel estimation for this method is close to 10−3 for 16-QAM modulation over a wide range of preamble lengths. The approach is applicable in both full rank (N = M) and rank-deficient (N < M) channels with practically the same performance as that of a clairvoyant detector with perfect CSI knowledge. This characteristic is crucial when co-channel signals are sent over an underdetermined channel, where there are more antennas at the trasmitter than there are at the receiver, i.e. virtual MIMO processing.
{"title":"On joint detection and channel estimation over rank-deficient MIMO links with sphere decoding","authors":"J. L. Morales, S. Roy","doi":"10.1109/CWIT.2011.5872148","DOIUrl":"https://doi.org/10.1109/CWIT.2011.5872148","url":null,"abstract":"In this paper, we present a method which jointly performs robust channel estimation and signal detection over rank-deficient MIMO links. This technique achieves an excellent estimation of the channel matrix by using all detected symbols within a data frame. Symbol detection is achieved by means of a sphere decoding algorithm. The proposed scheme is equivalent to having the training preamble occupy the entire data frame. The Mean Square Error (MSE) of the channel estimation for this method is close to 10−3 for 16-QAM modulation over a wide range of preamble lengths. The approach is applicable in both full rank (N = M) and rank-deficient (N < M) channels with practically the same performance as that of a clairvoyant detector with perfect CSI knowledge. This characteristic is crucial when co-channel signals are sent over an underdetermined channel, where there are more antennas at the trasmitter than there are at the receiver, i.e. virtual MIMO processing.","PeriodicalId":250626,"journal":{"name":"2011 12th Canadian Workshop on Information Theory","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123522765","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-05-17DOI: 10.1109/CWIT.2011.5872140
Ning Wang, T. Gulliver
We study a single-source single-destination wireless cooperative communication system with multiple relays operating in a modified decode-and-forward mode. Nakagami-m fading with additive white Gaussian noise is assumed for all inter-node channels. A packet feedback model is proposed to approximately characterize packet loss events in the wireless channel. An approximation to the steady state distribution of the proposed generalized discrete time M/G/1 queue at the source is obtained by state truncation. The packet level performance of four transmission modes is analyzed under a variety of channel and traffic conditions using this truncated model. The calculated network power is used as the criterion in finding boundary points for adaptive modulation and coding scheduling.
{"title":"Packet level analysis for AMC in a wireless cooperative communication system over Nakagami-m fading channels","authors":"Ning Wang, T. Gulliver","doi":"10.1109/CWIT.2011.5872140","DOIUrl":"https://doi.org/10.1109/CWIT.2011.5872140","url":null,"abstract":"We study a single-source single-destination wireless cooperative communication system with multiple relays operating in a modified decode-and-forward mode. Nakagami-m fading with additive white Gaussian noise is assumed for all inter-node channels. A packet feedback model is proposed to approximately characterize packet loss events in the wireless channel. An approximation to the steady state distribution of the proposed generalized discrete time M/G/1 queue at the source is obtained by state truncation. The packet level performance of four transmission modes is analyzed under a variety of channel and traffic conditions using this truncated model. The calculated network power is used as the criterion in finding boundary points for adaptive modulation and coding scheduling.","PeriodicalId":250626,"journal":{"name":"2011 12th Canadian Workshop on Information Theory","volume":"352 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122843960","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-05-17DOI: 10.1109/CWIT.2011.5872112
A. Refaey, S. Roy, P. Fortier
Many wireless communication systems such as IS-54, enhanced data rates for the GSM evolution (EDGE), worldwide interoperability for microwave access (WiMAX) and long term evolution (LTE) have adopted low-density parity-check (LDPC), tail-biting convolutional, and turbo codes as the forward error correcting codes (FEC) scheme for data and overhead channels. Therefore, many efficient algorithms have been proposed for decoding these codes. However, the different decoding approaches for these two families of codes usually lead to different hardware architectures. Since these codes work side by side in these new wireless systems, it is a good idea to introduce a universal decoder to handle these two families of codes. The present work exploits the parity-check matrix (H) representation of tail-biting convolutional and turbo codes, thus enabling decoding via a unified belief propagation (BP) algorithm. Indeed, the BP algorithm provides a highly effective general methodology for devising low-complexity iterative decoding algorithms for all convolutional code classes as well as turbo codes. While a small performance loss is observed when decoding turbo codes with BP instead of MAP, this is offset by the lower complexity of the BP algorithm and the inherent advantage of a unified decoding architecture.
{"title":"A new approach for FEC decoding based on the BP algorithm in LTE and WiMAX systems","authors":"A. Refaey, S. Roy, P. Fortier","doi":"10.1109/CWIT.2011.5872112","DOIUrl":"https://doi.org/10.1109/CWIT.2011.5872112","url":null,"abstract":"Many wireless communication systems such as IS-54, enhanced data rates for the GSM evolution (EDGE), worldwide interoperability for microwave access (WiMAX) and long term evolution (LTE) have adopted low-density parity-check (LDPC), tail-biting convolutional, and turbo codes as the forward error correcting codes (FEC) scheme for data and overhead channels. Therefore, many efficient algorithms have been proposed for decoding these codes. However, the different decoding approaches for these two families of codes usually lead to different hardware architectures. Since these codes work side by side in these new wireless systems, it is a good idea to introduce a universal decoder to handle these two families of codes. The present work exploits the parity-check matrix (H) representation of tail-biting convolutional and turbo codes, thus enabling decoding via a unified belief propagation (BP) algorithm. Indeed, the BP algorithm provides a highly effective general methodology for devising low-complexity iterative decoding algorithms for all convolutional code classes as well as turbo codes. While a small performance loss is observed when decoding turbo codes with BP instead of MAP, this is offset by the lower complexity of the BP algorithm and the inherent advantage of a unified decoding architecture.","PeriodicalId":250626,"journal":{"name":"2011 12th Canadian Workshop on Information Theory","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124567803","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-05-17DOI: 10.1109/CWIT.2011.5872127
Jin Meng, E. Yang
A new coding concept called credit-based variable-to-variable length (cbv2v) coding is proposed in this paper. A binary cbv2v code is constructed, and analysis of its performance shows that cbv2v coding can achieve much better trade-off among the coding delay, redundancy, and space complexity than does variable-to-variable length (v2v) coding. Specifically, let L be the total number of source words. With finite coding delay, the redundancy of our proposed cbv2v code decreases in the order of O(L−0.5) while the redundancy of binary v2v coding is lower bounded by Ω ((log L)−5−ε) where ε is an arbitrary positive real number. Furthermore, we also show that under mild conditions, the redundancy of any cbv2v code can be lower bounded by Ω(L−2∣χ∣−1−ε), where ∣χ∣ is the size of source alphabet.
{"title":"Credit-based variable-to-variable length coding: Key concepts and preliminary redundancy analysis","authors":"Jin Meng, E. Yang","doi":"10.1109/CWIT.2011.5872127","DOIUrl":"https://doi.org/10.1109/CWIT.2011.5872127","url":null,"abstract":"A new coding concept called credit-based variable-to-variable length (cbv2v) coding is proposed in this paper. A binary cbv2v code is constructed, and analysis of its performance shows that cbv2v coding can achieve much better trade-off among the coding delay, redundancy, and space complexity than does variable-to-variable length (v2v) coding. Specifically, let L be the total number of source words. With finite coding delay, the redundancy of our proposed cbv2v code decreases in the order of O(L<sup>−0.5</sup>) while the redundancy of binary v2v coding is lower bounded by Ω ((log L)<sup>−5−ε</sup>) where ε is an arbitrary positive real number. Furthermore, we also show that under mild conditions, the redundancy of any cbv2v code can be lower bounded by Ω(L<sup>−2∣χ∣−1−ε</sup>), where ∣χ∣ is the size of source alphabet.","PeriodicalId":250626,"journal":{"name":"2011 12th Canadian Workshop on Information Theory","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116185353","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-05-17DOI: 10.1109/CWIT.2011.5872152
A. Bayesteh, A. Mobasher, Yongkang Jia
In this paper, the problem of Downlink Multi-User MIMO (DL MU-MIMO) transmission from two interfering transmitters, each equipped with M antennas to multiple users each equipped with K antennas is considered. It is assumed that all users receive a single data stream of rank one from only one of the transmitters. A novel transmission/reception scheme is proposed based on the idea of Interference Alignment (IA), which aligns the interference coming from each transmitter to the users in the other cell along a single predetermined vector vref, and hence, leaves more degrees of freedom for signal transmission from each transmitter. Furthermore, unlike other IA-based schemes in the literature, only local Channel State Information (CSI) is required at nodes. It is shown that for the case of K ≥ M, the total degrees of freedom of 2M − 2 is achievable. The proposed scheme is also extended to the case of K <M based on the ideas of Euclidean distance minimization and time/frequency extension. Finally, simulation results are provided to compare the performance of the proposed scheme with that of the existing results in the literature.
{"title":"Downlink multi-user interference alignment in two-cell scenario","authors":"A. Bayesteh, A. Mobasher, Yongkang Jia","doi":"10.1109/CWIT.2011.5872152","DOIUrl":"https://doi.org/10.1109/CWIT.2011.5872152","url":null,"abstract":"In this paper, the problem of Downlink Multi-User MIMO (DL MU-MIMO) transmission from two interfering transmitters, each equipped with M antennas to multiple users each equipped with K antennas is considered. It is assumed that all users receive a single data stream of rank one from only one of the transmitters. A novel transmission/reception scheme is proposed based on the idea of Interference Alignment (IA), which aligns the interference coming from each transmitter to the users in the other cell along a single predetermined vector vref, and hence, leaves more degrees of freedom for signal transmission from each transmitter. Furthermore, unlike other IA-based schemes in the literature, only local Channel State Information (CSI) is required at nodes. It is shown that for the case of K ≥ M, the total degrees of freedom of 2M − 2 is achievable. The proposed scheme is also extended to the case of K <M based on the ideas of Euclidean distance minimization and time/frequency extension. Finally, simulation results are provided to compare the performance of the proposed scheme with that of the existing results in the literature.","PeriodicalId":250626,"journal":{"name":"2011 12th Canadian Workshop on Information Theory","volume":"156 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116583528","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-05-17DOI: 10.1109/CWIT.2011.5872111
Lei M. Zhang, F. Kschischang
A design method for bandwidth-efficient LDPC coded modulation for 22m-QAM constellations at rate (2m − 1)/(2m) in complex AWGN is presented. A multi-edge-type parameterization is used to exploit the distinct bit-channel capacities unique to high-order modulation using LDPC structures. EXIT analysis is adapted to multi-edge by introducing multi-dimensional EXIT iterated-function system analysis. Under this conceptualization, a successful decoding condition is developed by estimating fixed points of the dynamical system using its numerical gradient. Optimized ensembles are found for 16-QAM with thresholds matching the best known ensembles of equal complexity. For 64 to 1024-QAM, sufficiently high bit-channel capacities allow for extension of lower-order optimized ensembles, leading a practical nested code structure. The nested structure provides flexible rate selection with a single decoder. The gap to constrained, non-iterative capacity of all optimized code ensembles of maximum variable degree of 15 is within 0.21 dB.
{"title":"Design of multi-edge-type LDPC codes for high-order coded modulation","authors":"Lei M. Zhang, F. Kschischang","doi":"10.1109/CWIT.2011.5872111","DOIUrl":"https://doi.org/10.1109/CWIT.2011.5872111","url":null,"abstract":"A design method for bandwidth-efficient LDPC coded modulation for 22m-QAM constellations at rate (2m − 1)/(2m) in complex AWGN is presented. A multi-edge-type parameterization is used to exploit the distinct bit-channel capacities unique to high-order modulation using LDPC structures. EXIT analysis is adapted to multi-edge by introducing multi-dimensional EXIT iterated-function system analysis. Under this conceptualization, a successful decoding condition is developed by estimating fixed points of the dynamical system using its numerical gradient. Optimized ensembles are found for 16-QAM with thresholds matching the best known ensembles of equal complexity. For 64 to 1024-QAM, sufficiently high bit-channel capacities allow for extension of lower-order optimized ensembles, leading a practical nested code structure. The nested structure provides flexible rate selection with a single decoder. The gap to constrained, non-iterative capacity of all optimized code ensembles of maximum variable degree of 15 is within 0.21 dB.","PeriodicalId":250626,"journal":{"name":"2011 12th Canadian Workshop on Information Theory","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131501483","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-05-17DOI: 10.1109/CWIT.2011.5872153
A. Mobasher, A. Bayesteh, Yongkang Jia
In this paper, we elaborated on a new interference alignment technique for downlink multi-user system in a MIMO-X channel with multiple antennas. We considered two transmitters, each equipped with M antennas, and L users, each equipped with K antennas. Here, we consider a MIMO-X scenario that some users are receiving transmissions from both transmitters. The proposed approach is focused on rank-1 transmission to each user while each transmitter only needs to know the CSI for its serving users and each user only needs to know its corresponding channels to the transmitters.
{"title":"Downlink multi-user interference alignment in compound MIMO-X channels","authors":"A. Mobasher, A. Bayesteh, Yongkang Jia","doi":"10.1109/CWIT.2011.5872153","DOIUrl":"https://doi.org/10.1109/CWIT.2011.5872153","url":null,"abstract":"In this paper, we elaborated on a new interference alignment technique for downlink multi-user system in a MIMO-X channel with multiple antennas. We considered two transmitters, each equipped with M antennas, and L users, each equipped with K antennas. Here, we consider a MIMO-X scenario that some users are receiving transmissions from both transmitters. The proposed approach is focused on rank-1 transmission to each user while each transmitter only needs to know the CSI for its serving users and each user only needs to know its corresponding channels to the transmitters.","PeriodicalId":250626,"journal":{"name":"2011 12th Canadian Workshop on Information Theory","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132566456","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-05-17DOI: 10.1109/CWIT.2011.5872146
Maher Arar, A. Yongaçoğlu
We show that while the multiplexing effect of the spatial multiplexing MIMO channel has the greatest influence on ergodic capacity at infinite SNR, the contribution of diversity to enhancing ergodic capacity at finite SNR is comparable to or greater than that of multiplexing as the number of antennas increases to a moderate level. For instance, we show that the contribution of diversity to ergodic capacity surpasses that of multiplexing for an equal number of transmit and receive antennas of eight and SNR < 13dB, a possible practical scenario for the upcoming 4G standards such as LTE-Advanced. This result leads us to conclude that the use of spatial multiplexing detection algorithms that extract the full diversity, such as the Maximum Likelihood (ML) algorithm, becomes more crucial when the number of antennas grows to a moderate level.
{"title":"Contribution of multiplexing and diversity to ergodic capacity of spatial multiplexing MIMO channels at finite SNR","authors":"Maher Arar, A. Yongaçoğlu","doi":"10.1109/CWIT.2011.5872146","DOIUrl":"https://doi.org/10.1109/CWIT.2011.5872146","url":null,"abstract":"We show that while the multiplexing effect of the spatial multiplexing MIMO channel has the greatest influence on ergodic capacity at infinite SNR, the contribution of diversity to enhancing ergodic capacity at finite SNR is comparable to or greater than that of multiplexing as the number of antennas increases to a moderate level. For instance, we show that the contribution of diversity to ergodic capacity surpasses that of multiplexing for an equal number of transmit and receive antennas of eight and SNR < 13dB, a possible practical scenario for the upcoming 4G standards such as LTE-Advanced. This result leads us to conclude that the use of spatial multiplexing detection algorithms that extract the full diversity, such as the Maximum Likelihood (ML) algorithm, becomes more crucial when the number of antennas grows to a moderate level.","PeriodicalId":250626,"journal":{"name":"2011 12th Canadian Workshop on Information Theory","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131045162","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
扫码关注我们
求助内容：
应助结果提醒方式：