Pub Date : 2008-09-01DOI: 10.1109/ALLERTON.2008.4797601
K. Jagannathan, E. Modiano, Lizhong Zheng
In this paper, we consider a single-server queue with Poisson inputs and two distinct service rates. The service rate employed at any given instant is decided by a resource allocation policy, based on the queue occupancy. We deal with the question of how often control information needs to be sent to the rate scheduler so as to stay below a certain probability of congestion. We first consider some simple Markovian service rate allocation policies and derive the corresponding control rate vs. congestion probability tradeoffs in closed form. However, since a closed form solution is not possible for more general Markov policies, we resort to large deviation tools to characterize the congestion probabilities of various control policies. We also identify a simple dasiatwo-thresholdpsila policy which achieves the best possible tradeoff between rate of control and the decay exponent of the congestion probability. Finally, we also investigate the impact of control errors on the congestion probability of a resource allocation policy.
{"title":"Effective resource allocation in a queue: How much control is necessary?","authors":"K. Jagannathan, E. Modiano, Lizhong Zheng","doi":"10.1109/ALLERTON.2008.4797601","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797601","url":null,"abstract":"In this paper, we consider a single-server queue with Poisson inputs and two distinct service rates. The service rate employed at any given instant is decided by a resource allocation policy, based on the queue occupancy. We deal with the question of how often control information needs to be sent to the rate scheduler so as to stay below a certain probability of congestion. We first consider some simple Markovian service rate allocation policies and derive the corresponding control rate vs. congestion probability tradeoffs in closed form. However, since a closed form solution is not possible for more general Markov policies, we resort to large deviation tools to characterize the congestion probabilities of various control policies. We also identify a simple dasiatwo-thresholdpsila policy which achieves the best possible tradeoff between rate of control and the decay exponent of the congestion probability. Finally, we also investigate the impact of control errors on the congestion probability of a resource allocation policy.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121770079","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 : 2008-09-01DOI: 10.1109/ALLERTON.2008.4797653
R. T. Krishnamachari, M. Varanasi
Volume estimates of geodesic balls in Riemannian manifolds find many applications in coding and information theory. This paper computes the precise power series expansion of volume of small geodesic balls in a complex Stiefel manifold of arbitrary dimension. The volume result is employed to bound the minimum distance of codes over the manifold. An asymptotically tight characterization of the rate-distortion tradeoff for sources uniformly distributed over the surface is also provided.
{"title":"Volume of geodesic balls in the complex Stiefel manifold","authors":"R. T. Krishnamachari, M. Varanasi","doi":"10.1109/ALLERTON.2008.4797653","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797653","url":null,"abstract":"Volume estimates of geodesic balls in Riemannian manifolds find many applications in coding and information theory. This paper computes the precise power series expansion of volume of small geodesic balls in a complex Stiefel manifold of arbitrary dimension. The volume result is employed to bound the minimum distance of codes over the manifold. An asymptotically tight characterization of the rate-distortion tradeoff for sources uniformly distributed over the surface is also provided.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121429764","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 : 2008-09-01DOI: 10.1109/ALLERTON.2008.4797683
Yuhong Guo, Dale Schuurmans
We present an efficient global optimization algorithm for exponential family principal component analysis (PCA) and associated low-rank matrix factorization problems. Exponential family PCA has been shown to improve the results of standard PCA on non-Gaussian data. Unfortunately, the widespread use of exponential family PCA has been hampered by the existence of only local optimization procedures. The prevailing assumption has been that the non-convexity of the problem prevents an efficient global optimization approach from being developed. Fortunately, this pessimism is unfounded. We present a reformulation of the underlying optimization problem that preserves the identity of the global solution while admitting an efficient optimization procedure. The algorithm we develop involves only a sub-gradient optimization of a convex objective plus associated eigenvector computations. (No general purpose semidefinite programming solver is required.) The low-rank constraint is exactly preserved, while the method can be kernelized through a consistent approximation to admit a fixed non-linearity. We demonstrate improved solution quality with the global solver, and also add to the evidence that exponential family PCA produces superior results to standard PCA on non-Gaussian data.
{"title":"Efficient global optimization for exponential family PCA and low-rank matrix factorization","authors":"Yuhong Guo, Dale Schuurmans","doi":"10.1109/ALLERTON.2008.4797683","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797683","url":null,"abstract":"We present an efficient global optimization algorithm for exponential family principal component analysis (PCA) and associated low-rank matrix factorization problems. Exponential family PCA has been shown to improve the results of standard PCA on non-Gaussian data. Unfortunately, the widespread use of exponential family PCA has been hampered by the existence of only local optimization procedures. The prevailing assumption has been that the non-convexity of the problem prevents an efficient global optimization approach from being developed. Fortunately, this pessimism is unfounded. We present a reformulation of the underlying optimization problem that preserves the identity of the global solution while admitting an efficient optimization procedure. The algorithm we develop involves only a sub-gradient optimization of a convex objective plus associated eigenvector computations. (No general purpose semidefinite programming solver is required.) The low-rank constraint is exactly preserved, while the method can be kernelized through a consistent approximation to admit a fixed non-linearity. We demonstrate improved solution quality with the global solver, and also add to the evidence that exponential family PCA produces superior results to standard PCA on non-Gaussian data.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128559113","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 : 2008-09-01DOI: 10.1109/ALLERTON.2008.4797628
I-Hsiang Wang, David Tse
Gaussian interference channels with multiple receive antennas are studied. First we investigate the two-user Gaussian interference channel with two receive antennas, and it turns out that the angles among channel vectors play a central role in how the additional antenna helps increase the capacity. We formulate the notion of generalized degrees of freedom and show that optimal g.d.o.f. is achieved by superposition Gaussian random coding. Remarkably, the operating regime for the best linear scheme (MMSE followed by treating interference as noise) achieves optimal g.d.o.f. is enlarged when angle is large. Second, a three-to-one Gaussian interference channel in which the interfered receiver has two receive antennas is studied. Unlike the single-antenna case, the idea of interference alignment on signal scales is not directly applicable, and a natural generalization of Han-Kobayashi-type scheme with Gaussian random codes can achieve the capacity region within a number of bits, which depends only on the angle between two interfering channel vectors. We use the notion of generalized degrees of freedom to analyze the problem, and it turns out the HK-type scheme is not g.d.o.f.-optimal. We propose a new scheme, partial interference alignment, which well exploits both the receiver joint processing gain and interference alignment structural gain, and it outperforms HK-type scheme and single-antenna interference alignment scheme.
{"title":"Gaussian interference channels with multiple receive antennas: Capacity and generalized degrees of freedom","authors":"I-Hsiang Wang, David Tse","doi":"10.1109/ALLERTON.2008.4797628","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797628","url":null,"abstract":"Gaussian interference channels with multiple receive antennas are studied. First we investigate the two-user Gaussian interference channel with two receive antennas, and it turns out that the angles among channel vectors play a central role in how the additional antenna helps increase the capacity. We formulate the notion of generalized degrees of freedom and show that optimal g.d.o.f. is achieved by superposition Gaussian random coding. Remarkably, the operating regime for the best linear scheme (MMSE followed by treating interference as noise) achieves optimal g.d.o.f. is enlarged when angle is large. Second, a three-to-one Gaussian interference channel in which the interfered receiver has two receive antennas is studied. Unlike the single-antenna case, the idea of interference alignment on signal scales is not directly applicable, and a natural generalization of Han-Kobayashi-type scheme with Gaussian random codes can achieve the capacity region within a number of bits, which depends only on the angle between two interfering channel vectors. We use the notion of generalized degrees of freedom to analyze the problem, and it turns out the HK-type scheme is not g.d.o.f.-optimal. We propose a new scheme, partial interference alignment, which well exploits both the receiver joint processing gain and interference alignment structural gain, and it outperforms HK-type scheme and single-antenna interference alignment scheme.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128633229","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 : 2008-09-01DOI: 10.1109/ALLERTON.2008.4797686
H. Tembine, E. Altman, R. Elazouzi, Y. Hayel
We study a class of population game frameworks called stable games, introduced by Hofbauer and Sandholm (2007). We give several examples of applications of stable population games in the context of wireless networks including resource allocation, impact of malicious users in cognitive radio networks and power control. We model and analyze a base station assignment problem and interference control scenarios in heterogeneous wireless networks as a non-zero sum stable game. We show that the resource selection game has a unique evolutionary stable strategy (ESS) and a unique correlated ESS. We give a class of evolutionary game dynamics to lead to the ESS.
{"title":"Stable networking games","authors":"H. Tembine, E. Altman, R. Elazouzi, Y. Hayel","doi":"10.1109/ALLERTON.2008.4797686","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797686","url":null,"abstract":"We study a class of population game frameworks called stable games, introduced by Hofbauer and Sandholm (2007). We give several examples of applications of stable population games in the context of wireless networks including resource allocation, impact of malicious users in cognitive radio networks and power control. We model and analyze a base station assignment problem and interference control scenarios in heterogeneous wireless networks as a non-zero sum stable game. We show that the resource selection game has a unique evolutionary stable strategy (ESS) and a unique correlated ESS. We give a class of evolutionary game dynamics to lead to the ESS.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131370052","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 : 2008-09-01DOI: 10.1109/ALLERTON.2008.4797740
A. Pantelidou, A. Ephremides
We consider a system of multiple multicast transmitters with possibly overlapping receivers. We introduce a stationary policy that allocates the transmission rates and powers of every transmitter with the objective to maximize the overall user utility, which is measured in terms of the total average rate of each receiver. We show optimality of this policy by employing the theory of stochastic approximation for any utility function that is strictly concave and increasing in the average rate. The introduced policy is opportunistic in nature as it capitalizes on the variations of the wireless channel that are induced by fading. Specifically, we show through a set of simulations that the average throughput under unicast traffic observes a benefit under fading. Our results further indicate that this benefit is mitigated when multicast traffic is considered.
{"title":"A cross-layer view of wireless multicast optimization","authors":"A. Pantelidou, A. Ephremides","doi":"10.1109/ALLERTON.2008.4797740","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797740","url":null,"abstract":"We consider a system of multiple multicast transmitters with possibly overlapping receivers. We introduce a stationary policy that allocates the transmission rates and powers of every transmitter with the objective to maximize the overall user utility, which is measured in terms of the total average rate of each receiver. We show optimality of this policy by employing the theory of stochastic approximation for any utility function that is strictly concave and increasing in the average rate. The introduced policy is opportunistic in nature as it capitalizes on the variations of the wireless channel that are induced by fading. Specifically, we show through a set of simulations that the average throughput under unicast traffic observes a benefit under fading. Our results further indicate that this benefit is mitigated when multicast traffic is considered.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"20 17","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120823555","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 : 2008-09-01DOI: 10.1109/ALLERTON.2008.4797662
Yongzhi Wang, T. Fu, D. Chiu
In unstructured P2P content distribution systems, the most important algorithms to ensure optimal flow of content along multiple dynamically created distribution trees are piece selection algorithms and load balancing algorithms. This paper models practical load balancing algorithms and derives a number of insights.
{"title":"Analysis of load balancing algorithms in P2P streaming","authors":"Yongzhi Wang, T. Fu, D. Chiu","doi":"10.1109/ALLERTON.2008.4797662","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797662","url":null,"abstract":"In unstructured P2P content distribution systems, the most important algorithms to ensure optimal flow of content along multiple dynamically created distribution trees are piece selection algorithms and load balancing algorithms. This paper models practical load balancing algorithms and derives a number of insights.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132664132","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 : 2008-09-01DOI: 10.1109/ALLERTON.2008.4797684
Zhaohui Zheng, H. Zha, Gordon Sun
Ranking functions determine the relevance of search results of search engines, and learning ranking functions has become an active research area at the interface between Web search, information retrieval and machine learning. Generally, the training data for learning to rank come in two different forms: (1) absolute relevance judgments assessing the degree of relevance of a document with respect to a query. This type of judgments is also called labeled data and are usually obtained through human editorial efforts; and (2) relative relevance judgments indicating that a document is more relevant than another with respect to a query. This type of judgments is also called preference data and can usually be extracted from the abundantly available user click-through data recording users' interactions with the search results. Most existing learning to rank methods ignore the query boundaries, treating the labeled data or preference data equally across queries. In this paper, we propose a minimum effort optimization method that takes into account the entire training data within a query at each iteration. We tackle this optimization problem using functional iterative methods where the update at each iteration is computed by solving an isotonic regression problem. This more global approach results in faster convergency and signficantly improved performance of the learned ranking functions over existing state-of-the-art methods. We demonstrate the effectiveness of the proposed method using data sets obtained from a commercial search engine as well as publicly available data.
{"title":"Query-level learning to rank using isotonic regression","authors":"Zhaohui Zheng, H. Zha, Gordon Sun","doi":"10.1109/ALLERTON.2008.4797684","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797684","url":null,"abstract":"Ranking functions determine the relevance of search results of search engines, and learning ranking functions has become an active research area at the interface between Web search, information retrieval and machine learning. Generally, the training data for learning to rank come in two different forms: (1) absolute relevance judgments assessing the degree of relevance of a document with respect to a query. This type of judgments is also called labeled data and are usually obtained through human editorial efforts; and (2) relative relevance judgments indicating that a document is more relevant than another with respect to a query. This type of judgments is also called preference data and can usually be extracted from the abundantly available user click-through data recording users' interactions with the search results. Most existing learning to rank methods ignore the query boundaries, treating the labeled data or preference data equally across queries. In this paper, we propose a minimum effort optimization method that takes into account the entire training data within a query at each iteration. We tackle this optimization problem using functional iterative methods where the update at each iteration is computed by solving an isotonic regression problem. This more global approach results in faster convergency and signficantly improved performance of the learned ranking functions over existing state-of-the-art methods. We demonstrate the effectiveness of the proposed method using data sets obtained from a commercial search engine as well as publicly available data.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"6 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133768573","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 : 2008-09-01DOI: 10.1109/ALLERTON.2008.4797539
A. Tajer, Xiaodong Wang
Multiple-antenna downlink transmission offers significant capacity improvement when the transmit-side channel state information (CSI) is available. The sum-rate capacity with infinite-rate feedback (full or partial CSI) scales linearly with the number of transmit antennas (multiplexing gain) and double logarithmically with the number of users (multiuser diversity gain). In this paper we present a new scheduling scheme which requires only finite-rate feedback and yet retains the optimal multiplexing and multiuser diversity gains achievable by dirty-paper coding and show that its sum-rate throughput scales like Nt log log KNr where Nt and Nr are the number of transmit and receive antennas and K is the number of users. While our scheduling schemes is asymptotically optimal, it also exhibits a good performance for practical network sizes. We also show that by appropriate design of the feedback mechanism, we can refrain the aggregate amount of feedback from increasing with the number of users and for asymptotically large networks the total number of feedback bits is bounded by Nt log Nt. We also demonstrate that despite having an opportunistic user selection, fairness among the users is maintained and all are equality likely to be scheduled.
{"title":"Opportunistic multi-antenna downlink transmission with finite-rate feedback","authors":"A. Tajer, Xiaodong Wang","doi":"10.1109/ALLERTON.2008.4797539","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797539","url":null,"abstract":"Multiple-antenna downlink transmission offers significant capacity improvement when the transmit-side channel state information (CSI) is available. The sum-rate capacity with infinite-rate feedback (full or partial CSI) scales linearly with the number of transmit antennas (multiplexing gain) and double logarithmically with the number of users (multiuser diversity gain). In this paper we present a new scheduling scheme which requires only finite-rate feedback and yet retains the optimal multiplexing and multiuser diversity gains achievable by dirty-paper coding and show that its sum-rate throughput scales like Nt log log KNr where Nt and Nr are the number of transmit and receive antennas and K is the number of users. While our scheduling schemes is asymptotically optimal, it also exhibits a good performance for practical network sizes. We also show that by appropriate design of the feedback mechanism, we can refrain the aggregate amount of feedback from increasing with the number of users and for asymptotically large networks the total number of feedback bits is bounded by Nt log Nt. We also demonstrate that despite having an opportunistic user selection, fairness among the users is maintained and all are equality likely to be scheduled.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130770326","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 : 2008-09-01DOI: 10.1109/ALLERTON.2008.4797664
D.N. Liu, M. Fitz
Data detection of coded multiple-input multipleoutput (MIMO) orthogonal frequency division multiplexing (OFDM) in fast time-varying channels are considered. Maintaining high performance with manageable complexity relies on iterative soft-in soft-out equalization and decoding. This paper derives the optimum front-end demodulation structure by extending Ungerboeck equalizer formulation to a MIMO intercarrier interference (ICI) channel. Utilizing the fact that ICI energy is clustered in adjacent subcarriers, frequency domain equalization is made localized. This paper further proposes a computational efficient linear minimum mean square error (LMMSE) based equalization method: recursive sliding-window (SW) SIC-LMMSE equalizer. Simulation results are reported for the iterative receivers with application to the mobile worldwide interoperability for microwave access (WiMAX).
{"title":"Turbo MIMO equalization and decoding in fast fading mobile coded OFDM","authors":"D.N. Liu, M. Fitz","doi":"10.1109/ALLERTON.2008.4797664","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797664","url":null,"abstract":"Data detection of coded multiple-input multipleoutput (MIMO) orthogonal frequency division multiplexing (OFDM) in fast time-varying channels are considered. Maintaining high performance with manageable complexity relies on iterative soft-in soft-out equalization and decoding. This paper derives the optimum front-end demodulation structure by extending Ungerboeck equalizer formulation to a MIMO intercarrier interference (ICI) channel. Utilizing the fact that ICI energy is clustered in adjacent subcarriers, frequency domain equalization is made localized. This paper further proposes a computational efficient linear minimum mean square error (LMMSE) based equalization method: recursive sliding-window (SW) SIC-LMMSE equalizer. Simulation results are reported for the iterative receivers with application to the mobile worldwide interoperability for microwave access (WiMAX).","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128177383","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
扫码关注我们
求助内容：
应助结果提醒方式：