Ensemble Kalman filter (EnKF) is an efficient algorithm in dealing with nonlinear and discontinuous data assimilation problems. We designed a scheme that integrated the EnKF and Simplified Simple Biosphere model (SSiB) to improve the estimate of land surface temperature and evapotranspiration (ET) using Moderate Resolution Imaging Spectroradiometer (MODIS) Land Surface Temperature (LST) products. This scheme can make a judgment whether there are MODSI LST products available to assimilate at every time step. Then we compared the assimilation results with SSiB open loop simulation and station observations. The results showed that the EnKF algorithm could improve the land surface temperature and evapotranspiration estimate. Then we discussed five challenges during the experiment. In a word, this scheme provides a practical way for improving land surface models estimates with assimilating remote sensing observations.
{"title":"Using ensemble Kalman filter to assimilate land surface temperature and evapotranspiration","authors":"Yang Wang, Yaonan Zhang, Guohui Zhao","doi":"10.4108/ADIM.2010.4","DOIUrl":"https://doi.org/10.4108/ADIM.2010.4","url":null,"abstract":"Ensemble Kalman filter (EnKF) is an efficient algorithm in dealing with nonlinear and discontinuous data assimilation problems. We designed a scheme that integrated the EnKF and Simplified Simple Biosphere model (SSiB) to improve the estimate of land surface temperature and evapotranspiration (ET) using Moderate Resolution Imaging Spectroradiometer (MODIS) Land Surface Temperature (LST) products. This scheme can make a judgment whether there are MODSI LST products available to assimilate at every time step. Then we compared the assimilation results with SSiB open loop simulation and station observations. The results showed that the EnKF algorithm could improve the land surface temperature and evapotranspiration estimate. Then we discussed five challenges during the experiment. In a word, this scheme provides a practical way for improving land surface models estimates with assimilating remote sensing observations.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129911820","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 : 2010-08-01DOI: 10.4108/CHINACOM.2010.97
Liang Zhou, J. Rodrigues, L. Yeung
A challenging problem of providing media services over vehicular networks is how to optimize the media content dissemination and vehicle cache update by intelligently considering opportunistic vehicle meet and different service requirements. In this work, we study this problem in the context of P2P-based vehicular networks, and develop fully dynamic service schemes with the goals of maximizing the total user-satisfaction and achieving certain fairness. We first construct a general user-satisfaction model according to the network's transmission mechanism, as well as different media's delay-satisfaction characteristics. Then, we formulate the media service as an optimization problem, and propose a joint content dissemination and cache update scheme. We also provide the exact steps to achieve the optimal solution at equilibrium given the user-satisfaction function. It is worth noting that the proposed scheme is designed in a distributed manner which is amenable to online implementation for vehicle networks. In addition, we provide extensive simulation results which demonstrate the effectiveness of our proposed schemes.
{"title":"User-satisfaction-based media services over vehicular networks","authors":"Liang Zhou, J. Rodrigues, L. Yeung","doi":"10.4108/CHINACOM.2010.97","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.97","url":null,"abstract":"A challenging problem of providing media services over vehicular networks is how to optimize the media content dissemination and vehicle cache update by intelligently considering opportunistic vehicle meet and different service requirements. In this work, we study this problem in the context of P2P-based vehicular networks, and develop fully dynamic service schemes with the goals of maximizing the total user-satisfaction and achieving certain fairness. We first construct a general user-satisfaction model according to the network's transmission mechanism, as well as different media's delay-satisfaction characteristics. Then, we formulate the media service as an optimization problem, and propose a joint content dissemination and cache update scheme. We also provide the exact steps to achieve the optimal solution at equilibrium given the user-satisfaction function. It is worth noting that the proposed scheme is designed in a distributed manner which is amenable to online implementation for vehicle networks. In addition, we provide extensive simulation results which demonstrate the effectiveness of our proposed schemes.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130993497","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 : 2010-08-01DOI: 10.4108/CHINACOM.2010.100
Qiang Xue, G. Abreu
In this paper, we provide asymptotic analysis of the mutual information (MI) of the basic two-hop amplify-and-forward (AF) channel, where the relaying node is selected out of a pool of N potential relay nodes based on instantaneous backward channel state information (CSI). The asymptotic formula obtained by implementing extreme value theory (EVT) adopts a simpler form compared to the exact MI expression, which makes it easier to operate with. Despite its simplicity, the asymptotic expression is quite accurate even with small N, which is confirmed by numerical simulation. We show that the power allocation coefficient obtained by optimizing the asymptotic expression is close to the optimal value obtained from simulation results.
{"title":"Mutual information of amplify-and-forward relaying with partial relay selection","authors":"Qiang Xue, G. Abreu","doi":"10.4108/CHINACOM.2010.100","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.100","url":null,"abstract":"In this paper, we provide asymptotic analysis of the mutual information (MI) of the basic two-hop amplify-and-forward (AF) channel, where the relaying node is selected out of a pool of N potential relay nodes based on instantaneous backward channel state information (CSI). The asymptotic formula obtained by implementing extreme value theory (EVT) adopts a simpler form compared to the exact MI expression, which makes it easier to operate with. Despite its simplicity, the asymptotic expression is quite accurate even with small N, which is confirmed by numerical simulation. We show that the power allocation coefficient obtained by optimizing the asymptotic expression is close to the optimal value obtained from simulation results.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131063876","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 : 2010-08-01DOI: 10.4108/CHINACOM.2010.134
Zhengguo Sheng, Z. Ding, K. Leung
Cooperative diversity has emerged as a promising approach to improving reception reliability by realizing spatial diversity gains for nodes with single antenna. We consider here cooperative ad-hoc wireless networks where communications between two nodes can be assisted by a single relay using two time slots. This paper continues our investigation of PHY techniques and cross-layer routing algorithms in such networks. Specifically, we investigate here the optimal relay location for cooperative link in networks with infinite node density. By using this result, we analyze the error performance bound for routing algorithms in infinitely dense networks. Furthermore, we study the performance bounds for regularly dense networks with linear topology. Theoretical analysis shows that the proposed routing algorithm performs close to the optimal error performance.
{"title":"Error performance bounds for routing algorithms in wireless cooperative networks","authors":"Zhengguo Sheng, Z. Ding, K. Leung","doi":"10.4108/CHINACOM.2010.134","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.134","url":null,"abstract":"Cooperative diversity has emerged as a promising approach to improving reception reliability by realizing spatial diversity gains for nodes with single antenna. We consider here cooperative ad-hoc wireless networks where communications between two nodes can be assisted by a single relay using two time slots. This paper continues our investigation of PHY techniques and cross-layer routing algorithms in such networks. Specifically, we investigate here the optimal relay location for cooperative link in networks with infinite node density. By using this result, we analyze the error performance bound for routing algorithms in infinitely dense networks. Furthermore, we study the performance bounds for regularly dense networks with linear topology. Theoretical analysis shows that the proposed routing algorithm performs close to the optimal error performance.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130398620","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}
Yuxi Liu, Ju Liu, Lina Zheng, Weidong Guo, H. Chen
Joint decoding at the base stations is investigated as a means to improve the uplink/downlink throughput of current cellular systems over fading channels. In this paper, the multi-cell relay-assisted time-division uplink system, i.e. one active user per time slot per cell with a relay serving that user, is studied. A linear mesh network is considered in which a single user per-cell communicates to a local base station via a dedicated relay. Base station cooperation through multi-cell decoding, where each cell has a single relay that amplifies and forwards the desired transmission signals to the base station. All the base stations in the mesh network collaboratively decode the signals received at each. The key contribution of this paper is compare the ergodic sum-rate in single-cell processing with multi-cell processing, under the system model, separately.
{"title":"Inter-cell relaying and base station cooperation in cellular uplink systems","authors":"Yuxi Liu, Ju Liu, Lina Zheng, Weidong Guo, H. Chen","doi":"10.4108/CHINACOM.2010.9","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.9","url":null,"abstract":"Joint decoding at the base stations is investigated as a means to improve the uplink/downlink throughput of current cellular systems over fading channels. In this paper, the multi-cell relay-assisted time-division uplink system, i.e. one active user per time slot per cell with a relay serving that user, is studied. A linear mesh network is considered in which a single user per-cell communicates to a local base station via a dedicated relay. Base station cooperation through multi-cell decoding, where each cell has a single relay that amplifies and forwards the desired transmission signals to the base station. All the base stations in the mesh network collaboratively decode the signals received at each. The key contribution of this paper is compare the ergodic sum-rate in single-cell processing with multi-cell processing, under the system model, separately.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130571962","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 : 2010-08-01DOI: 10.4108/CHINACOM.2010.104
K. Zheng, Fanglong Hu, Lei Lei, Wenbo Wang
Femtocells technology has emerged as a promising solution to provide the indoor coverage in the 3rd generation (3G) long-term evolution (LTE) and its advanced (LTE-Advanced) networks. In this paper, we propose a two-step interference coordination scheme to deal with the interference between femtocells in LTE-Advanced networks with carrier aggregation. Each femtocell is assigned a carrier that is non-overlapping with its interfering femtocells or has the least interference in the first step. Then, in the second step, more carriers are attempted to be used by a femtocell in order to improve the system spectrum efficiency based on the specified utility functions. Our simulation results demonstrate the effectiveness of the proposed interference coordination scheme in terms of throughput.
{"title":"Interference coordination between femtocells in LTE-advanced networks with carrier aggregation","authors":"K. Zheng, Fanglong Hu, Lei Lei, Wenbo Wang","doi":"10.4108/CHINACOM.2010.104","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.104","url":null,"abstract":"Femtocells technology has emerged as a promising solution to provide the indoor coverage in the 3rd generation (3G) long-term evolution (LTE) and its advanced (LTE-Advanced) networks. In this paper, we propose a two-step interference coordination scheme to deal with the interference between femtocells in LTE-Advanced networks with carrier aggregation. Each femtocell is assigned a carrier that is non-overlapping with its interfering femtocells or has the least interference in the first step. Then, in the second step, more carriers are attempted to be used by a femtocell in order to improve the system spectrum efficiency based on the specified utility functions. Our simulation results demonstrate the effectiveness of the proposed interference coordination scheme in terms of throughput.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130817824","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 : 2010-08-01DOI: 10.4108/CHINACOM.2010.118
Luying Zhou, Xiaofei Cheng, Y. Yeo, L. Ngoh
Passive optical networks (PONs) represent one of the most attractive access network solutions. TDM and WDM techniques are employed in the PON for higher resource efficiency and capacity, which results in TDM PON and WDM PON respectively. Hybrid WDM-TDM PON combines the advanced features of both TDM PON and WDM PON, and provides a more flexible and cost-effective access network solution. We review the current work in the hybrid WDM-TDM PON architectures, dynamic wavelength and bandwidth allocation (DWBA) algorithms and enabling technologies, and present the development and deployment trends from TDM PON to the hybrid WDM-TDM PON. We analyze the deployment problem incurred under physical constraints, and point out there is a need to develop DWBA algorithms with both upstream and downstream traffic scheduling taken into consideration.
{"title":"Hybrid WDM-TDM PON architectures and DWBA algorithms","authors":"Luying Zhou, Xiaofei Cheng, Y. Yeo, L. Ngoh","doi":"10.4108/CHINACOM.2010.118","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.118","url":null,"abstract":"Passive optical networks (PONs) represent one of the most attractive access network solutions. TDM and WDM techniques are employed in the PON for higher resource efficiency and capacity, which results in TDM PON and WDM PON respectively. Hybrid WDM-TDM PON combines the advanced features of both TDM PON and WDM PON, and provides a more flexible and cost-effective access network solution. We review the current work in the hybrid WDM-TDM PON architectures, dynamic wavelength and bandwidth allocation (DWBA) algorithms and enabling technologies, and present the development and deployment trends from TDM PON to the hybrid WDM-TDM PON. We analyze the deployment problem incurred under physical constraints, and point out there is a need to develop DWBA algorithms with both upstream and downstream traffic scheduling taken into consideration.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127913441","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 : 2010-08-01DOI: 10.4108/CHINACOM.2010.64
H Zhao, Fanggang Wang, Jinghua Kuang, Wenbo Wang, Bin Wu
It is well known that Space-Time Block Codes from orthogonal designs (O-STBC) are linearly Maximum-Likelihood (ML) decodable. However there are not full rate complex O-STBC designs except for two transmit-antennas. Recently, one class of minimum-decoding-complexity STBCs (MDC-STBC) have been studied: (1) they have higher rate than O-STBC; (2) they are single-symbol decodable (SSD) and (3) they can exploit full diversity by constellation rotation (CR). In this paper, we employ precoding technology for these MDC-STBCs to realize: higher-rate, full-diversity, maximum coding gain and half-symbol decodable (HSD), where HSD has the lower complexity than SSD. Simulation results for MDC-STBCs with 4 transmit antennas show that the proposed precoder scheme with HSD decoder can get the same diversity gain and an extra 1dB coding gain than the schemes with CR, only at the cost of 3 bits feedback information for quantifying the precoder.
{"title":"Precoded MDC-STBC scheme with half-symbol decodable receiver","authors":"H Zhao, Fanggang Wang, Jinghua Kuang, Wenbo Wang, Bin Wu","doi":"10.4108/CHINACOM.2010.64","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.64","url":null,"abstract":"It is well known that Space-Time Block Codes from orthogonal designs (O-STBC) are linearly Maximum-Likelihood (ML) decodable. However there are not full rate complex O-STBC designs except for two transmit-antennas. Recently, one class of minimum-decoding-complexity STBCs (MDC-STBC) have been studied: (1) they have higher rate than O-STBC; (2) they are single-symbol decodable (SSD) and (3) they can exploit full diversity by constellation rotation (CR). In this paper, we employ precoding technology for these MDC-STBCs to realize: higher-rate, full-diversity, maximum coding gain and half-symbol decodable (HSD), where HSD has the lower complexity than SSD. Simulation results for MDC-STBCs with 4 transmit antennas show that the proposed precoder scheme with HSD decoder can get the same diversity gain and an extra 1dB coding gain than the schemes with CR, only at the cost of 3 bits feedback information for quantifying the precoder.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"93 9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127982221","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 : 2010-08-01DOI: 10.4108/CHINACOM.2010.53
Xiao Wang, Zhifeng Zhao, Ning Zhao, Honggang Zhang
Compressed sensing (CS) is an emerging theory based on the fact that the salient information of a signal can be preserved in a relatively small number of linear projections. Compressed sensing has been well used in the area of image compression and signal processing in the past few years. Recently, compressed sensing has been earning ever-increasing interests in the area of wireless communication networks. According to its advantageous characteristics, compressed sensing is able to play significant role in the fields like wireless channel estimation, signal detection, data gathering, network monitoring, and so on. This study describes current researches on the applications of compressed sensing in wireless communication networks, and then enumerates burning questions and the master keys of their corresponding solutions in these fields. Accordingly, we first introduce the basic approach of compressed sensing, and then summarize recent technical advancements of compressed sensing schemes and their applications in wireless communication networks. We assort these techniques according to the general OSI (Interconnection Reference Model) network model. In the end, we analyze problems and potential applications of compressed sensing, including novel methods for efficient data gathering by executing compressed sensing with random routing in wireless sensor networking environment.
{"title":"On the application of compressed sensing in communication networks","authors":"Xiao Wang, Zhifeng Zhao, Ning Zhao, Honggang Zhang","doi":"10.4108/CHINACOM.2010.53","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.53","url":null,"abstract":"Compressed sensing (CS) is an emerging theory based on the fact that the salient information of a signal can be preserved in a relatively small number of linear projections. Compressed sensing has been well used in the area of image compression and signal processing in the past few years. Recently, compressed sensing has been earning ever-increasing interests in the area of wireless communication networks. According to its advantageous characteristics, compressed sensing is able to play significant role in the fields like wireless channel estimation, signal detection, data gathering, network monitoring, and so on. This study describes current researches on the applications of compressed sensing in wireless communication networks, and then enumerates burning questions and the master keys of their corresponding solutions in these fields. Accordingly, we first introduce the basic approach of compressed sensing, and then summarize recent technical advancements of compressed sensing schemes and their applications in wireless communication networks. We assort these techniques according to the general OSI (Interconnection Reference Model) network model. In the end, we analyze problems and potential applications of compressed sensing, including novel methods for efficient data gathering by executing compressed sensing with random routing in wireless sensor networking environment.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128539299","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 : 2010-08-01DOI: 10.4108/CHINACOM.2010.69
Xiang Wu, J. Thompson
This paper presents a field-programmable gate array (FPGA) implementation of an unbiased minimum mean square error (MMSE) metric based QR-decomposition M (QRDM) algorithm for the multiple-input multiple-output (MIMO) systems. Two advanced techniques, namely the merge-sort (MS) based and winner path expansion (WPE) based sorting schemes have been implemented and validated on an FPGA platform for a 4×4 16-QAM MIMO system. The results show that the MS-QRDM is advantageous in the simplified control circuits and leads to less logic resource use, whereas the WPE-QRDM is able to achieve the minimum use of the computational units and results in fewer multipliers. Furthermore, it also shows that both schemes can support up to 1.6Gbps decoding throughput when they are implemented in a fully pipelined parallel architecture.
{"title":"FPGA design of fixed-complexity high-throughput MIMO detector based on QRDM algorithm","authors":"Xiang Wu, J. Thompson","doi":"10.4108/CHINACOM.2010.69","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.69","url":null,"abstract":"This paper presents a field-programmable gate array (FPGA) implementation of an unbiased minimum mean square error (MMSE) metric based QR-decomposition M (QRDM) algorithm for the multiple-input multiple-output (MIMO) systems. Two advanced techniques, namely the merge-sort (MS) based and winner path expansion (WPE) based sorting schemes have been implemented and validated on an FPGA platform for a 4×4 16-QAM MIMO system. The results show that the MS-QRDM is advantageous in the simplified control circuits and leads to less logic resource use, whereas the WPE-QRDM is able to achieve the minimum use of the computational units and results in fewer multipliers. Furthermore, it also shows that both schemes can support up to 1.6Gbps decoding throughput when they are implemented in a fully pipelined parallel architecture.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125968517","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
扫码关注我们
求助内容：
应助结果提醒方式：