Pub Date : 2009-12-31DOI: 10.1109/WCSP.2009.5371630
Lv Heng, Ge Weimin, Luo Yongmei, Zhao Dongxue
There are a variety of reasons for packet loss in ad hoc wireless networks, but the upper-layer does not distinguish the reasons, takes control blindly, and leads to the overall performance of TCP be affected. To solve the problems, this paper proposes a proposal to improve the performance of TCP. The proposal takes advantage of the mechanisms and characters of AODV, and makes use of cross-layer information of MAC layer, network layer and transport layer to improve the performance of TCP. We have implemented the proposal in NS2, and tested it in lots of scenarios. The simulation results show that it can decline the numbers of TCP slow-start, reduces the number of route discover, in static scenarios it can improve the throughput by about 15% to 20%; in dynamic scenarios, it can also improve the throughput slightly.
ad hoc无线网络中丢包的原因多种多样，但上层不区分原因，盲目控制，导致TCP的整体性能受到影响。针对这些问题，本文提出了一种改进TCP性能的方案。该方案利用AODV的机制和特点，利用MAC层、网络层和传输层的跨层信息来提高TCP的性能。我们已经在NS2中实现了该提议，并在许多场景中进行了测试。仿真结果表明，该方法可以减少TCP慢启动次数，减少路由发现次数，在静态场景下可将吞吐量提高15% ~ 20%;在动态场景中，它还可以略微提高吞吐量。
{"title":"A new method for TCP congestion control based on AODV congestion indication","authors":"Lv Heng, Ge Weimin, Luo Yongmei, Zhao Dongxue","doi":"10.1109/WCSP.2009.5371630","DOIUrl":"https://doi.org/10.1109/WCSP.2009.5371630","url":null,"abstract":"There are a variety of reasons for packet loss in ad hoc wireless networks, but the upper-layer does not distinguish the reasons, takes control blindly, and leads to the overall performance of TCP be affected. To solve the problems, this paper proposes a proposal to improve the performance of TCP. The proposal takes advantage of the mechanisms and characters of AODV, and makes use of cross-layer information of MAC layer, network layer and transport layer to improve the performance of TCP. We have implemented the proposal in NS2, and tested it in lots of scenarios. The simulation results show that it can decline the numbers of TCP slow-start, reduces the number of route discover, in static scenarios it can improve the throughput by about 15% to 20%; in dynamic scenarios, it can also improve the throughput slightly.","PeriodicalId":244652,"journal":{"name":"2009 International Conference on Wireless Communications & Signal Processing","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134174849","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 : 2009-12-31DOI: 10.1109/WCSP.2009.5371549
Anna Kacewicz, S. Wicker
We consider a multiple path wireless network and address the problem of coding and routing a message in a manner that guarantees both robustness and security. Each path in the network is assumed to be a wiretap channel that includes both a main channel and a wiretap monitored by an eavesdropper. We then show that Raptor codes can be used to achieve both perfect secrecy and zero error probability. This work is an extension of recent work by Thangaraj, Dihidar, Calderbank, McLaughlin, and Merolla in which they show the efficacy of using LDPC codes for similar purposes over a wiretap channel. We show how to simultaneously construct the parameters of the code and robustly route the codeword while minimizing information flow to the adversary.
{"title":"Secrecy and reliability using Raptor codes in the presence of a wiretapper in a multiple path wireless network","authors":"Anna Kacewicz, S. Wicker","doi":"10.1109/WCSP.2009.5371549","DOIUrl":"https://doi.org/10.1109/WCSP.2009.5371549","url":null,"abstract":"We consider a multiple path wireless network and address the problem of coding and routing a message in a manner that guarantees both robustness and security. Each path in the network is assumed to be a wiretap channel that includes both a main channel and a wiretap monitored by an eavesdropper. We then show that Raptor codes can be used to achieve both perfect secrecy and zero error probability. This work is an extension of recent work by Thangaraj, Dihidar, Calderbank, McLaughlin, and Merolla in which they show the efficacy of using LDPC codes for similar purposes over a wiretap channel. We show how to simultaneously construct the parameters of the code and robustly route the codeword while minimizing information flow to the adversary.","PeriodicalId":244652,"journal":{"name":"2009 International Conference on Wireless Communications & Signal Processing","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131648020","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 : 2009-12-31DOI: 10.1109/WCSP.2009.5371760
Emil Bjornson, Björn E. Ottersten
Cooperative precoding is an attractive way of improving the performance in multicell downlink scenarios. By serving each terminal through multiple surrounding base stations, inter-cell interference can be coordinated and higher spectral efficiency achieved, especially for terminals at cell edges. The optimal performance of multicell precoding is well-known as it can be treated as a single cell with distributed antennas. However, the requirements on backhaul signaling and computational power scales rapidly in large and dense networks, which often makes such fully centralized approaches impractical. In this paper, we review and generalize some recent work on multicell precoding with both centralized and distributed cooperation. We propose practical precoding strategies under Rician channel conditions, and illustrate how the major gain of multicell precoding originates from having good base station synchronization and not from making centralized precoding decisions.
{"title":"On the principles of multicell precoding with centralized and distributed cooperation","authors":"Emil Bjornson, Björn E. Ottersten","doi":"10.1109/WCSP.2009.5371760","DOIUrl":"https://doi.org/10.1109/WCSP.2009.5371760","url":null,"abstract":"Cooperative precoding is an attractive way of improving the performance in multicell downlink scenarios. By serving each terminal through multiple surrounding base stations, inter-cell interference can be coordinated and higher spectral efficiency achieved, especially for terminals at cell edges. The optimal performance of multicell precoding is well-known as it can be treated as a single cell with distributed antennas. However, the requirements on backhaul signaling and computational power scales rapidly in large and dense networks, which often makes such fully centralized approaches impractical. In this paper, we review and generalize some recent work on multicell precoding with both centralized and distributed cooperation. We propose practical precoding strategies under Rician channel conditions, and illustrate how the major gain of multicell precoding originates from having good base station synchronization and not from making centralized precoding decisions.","PeriodicalId":244652,"journal":{"name":"2009 International Conference on Wireless Communications & Signal Processing","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126594907","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 : 2009-12-31DOI: 10.1109/WCSP.2009.5371426
Jinhua Jiang, Wei Heng, Huan Zhang, Gang Wu, Haifeng Wang
In multi-hop relay network, there may be several Relay Nodes(RNs) subordinated to the base station(BS) in a cell. When an user equipment (UE) moves from one cell to another, or an UE moves between two different RNs, a handover will happen. Since the coverage of a relay is small, the handover between two RNs or RN and base station (BS) maybe happen frequently. In terms of whether the UE is located at the same cell, the handover in relay network can be classified into two categories, intra MR-BS handover and inter MR-BS handover. In this paper, we proposed a new handover scheme exploiting uplink signal and downlink signal for intra MR-BS handover with transparent RN. In the scheme, the handover decision is divided into two steps. The first step is based on uplink quality, and the second step based on downlink quality to affirm the first decision. The simulation results show that the proposed handover scheme reduces the handover probability and outage probability compared to the current intra MR-BS handover with transparent RN.
{"title":"A novel handover scheme for multi-hop transparent relay network","authors":"Jinhua Jiang, Wei Heng, Huan Zhang, Gang Wu, Haifeng Wang","doi":"10.1109/WCSP.2009.5371426","DOIUrl":"https://doi.org/10.1109/WCSP.2009.5371426","url":null,"abstract":"In multi-hop relay network, there may be several Relay Nodes(RNs) subordinated to the base station(BS) in a cell. When an user equipment (UE) moves from one cell to another, or an UE moves between two different RNs, a handover will happen. Since the coverage of a relay is small, the handover between two RNs or RN and base station (BS) maybe happen frequently. In terms of whether the UE is located at the same cell, the handover in relay network can be classified into two categories, intra MR-BS handover and inter MR-BS handover. In this paper, we proposed a new handover scheme exploiting uplink signal and downlink signal for intra MR-BS handover with transparent RN. In the scheme, the handover decision is divided into two steps. The first step is based on uplink quality, and the second step based on downlink quality to affirm the first decision. The simulation results show that the proposed handover scheme reduces the handover probability and outage probability compared to the current intra MR-BS handover with transparent RN.","PeriodicalId":244652,"journal":{"name":"2009 International Conference on Wireless Communications & Signal Processing","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128862174","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 : 2009-12-31DOI: 10.1109/WCSP.2009.5371650
Xiaoyan Huang, Xi'an Feng, Tiande Gao
The mainly task of sonar simulation signal source is to generate real time dynamic echo signal using the underwater acoustic signal properties, the relative motion properties and the underwater environment noise. Sonar simulation signal source is applied in a semi-physical simulation system. So real time ability and high-speed transmission is the main factors in the system design. This paper using the embedded soft real time processor combining high speed hard real time module to generate 128 channel simulation signals based on FPGA parallel technology. Single frequency pulse signal (CW), line frequency modulation pulse signal (LFM), hyperbolic frequency modulation pulse signal (HFM), this three type of pulses signals have dynamic generated through above technology in the system. The system test results show that the average compute time of FPGA module is consumed 9.13867ms when working at 192 KHz, the highest system sampling rate to generate 128 channel signals. Meanwhile, less than 2.5K system flash memory space is needed to ensure continuous simulation signal output. Experimental results show that System has high real time ability and reliability.
{"title":"The design of high-speed real time multi-channel sonar simulation signal source based on FPGA parallel technology","authors":"Xiaoyan Huang, Xi'an Feng, Tiande Gao","doi":"10.1109/WCSP.2009.5371650","DOIUrl":"https://doi.org/10.1109/WCSP.2009.5371650","url":null,"abstract":"The mainly task of sonar simulation signal source is to generate real time dynamic echo signal using the underwater acoustic signal properties, the relative motion properties and the underwater environment noise. Sonar simulation signal source is applied in a semi-physical simulation system. So real time ability and high-speed transmission is the main factors in the system design. This paper using the embedded soft real time processor combining high speed hard real time module to generate 128 channel simulation signals based on FPGA parallel technology. Single frequency pulse signal (CW), line frequency modulation pulse signal (LFM), hyperbolic frequency modulation pulse signal (HFM), this three type of pulses signals have dynamic generated through above technology in the system. The system test results show that the average compute time of FPGA module is consumed 9.13867ms when working at 192 KHz, the highest system sampling rate to generate 128 channel signals. Meanwhile, less than 2.5K system flash memory space is needed to ensure continuous simulation signal output. Experimental results show that System has high real time ability and reliability.","PeriodicalId":244652,"journal":{"name":"2009 International Conference on Wireless Communications & Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131280919","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 : 2009-12-31DOI: 10.1109/WCSP.2009.5371752
Linning Peng, J. Pan, Lenan Wu
Signals in HF radio channels are suffered from the effect of delay spread, time-varying interference and additive Gaussian noise. The performances of two differential modulation methods FDDD and TDDD for OFDM system are analyzed in this paper. By analysis and simulations, the relationship of the subcarrier bandwidth and BER is demonstrated, which shows that the selection of optimal subcarrier bandwidth contributes largely to the performance of HF communications.
{"title":"Differential modulated OFDM system for HF communications","authors":"Linning Peng, J. Pan, Lenan Wu","doi":"10.1109/WCSP.2009.5371752","DOIUrl":"https://doi.org/10.1109/WCSP.2009.5371752","url":null,"abstract":"Signals in HF radio channels are suffered from the effect of delay spread, time-varying interference and additive Gaussian noise. The performances of two differential modulation methods FDDD and TDDD for OFDM system are analyzed in this paper. By analysis and simulations, the relationship of the subcarrier bandwidth and BER is demonstrated, which shows that the selection of optimal subcarrier bandwidth contributes largely to the performance of HF communications.","PeriodicalId":244652,"journal":{"name":"2009 International Conference on Wireless Communications & Signal Processing","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114406357","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 : 2009-12-31DOI: 10.1109/WCSP.2009.5371523
Yin Chen, Karol Kowalik, M. Davis
A core problem of fast handoff is when handoff should perform and which Mesh Node (MN) should associated with. We have developed a fast handoff management scheme called MeshScan to provide a novel use of channel scanning latency, by employing open system authentication in both Passive Handoff and Active Handoff. This scheme comprises three steps: firstly a client device takes advantage of the Wireless Mesh Network (WMN) architecture to maintain a list of active MNs. Secondly MeshScan Handoff Sensor performs handoff when it receives a disassociation management frame from the serving MN or when the measured signal strength from the serving MN exceeds a given threshold. Thirdly when handoff is required, a client transmits Authentication Request frames to all MNs from the list instead of broadcasting Probe Request frames, as in an active scan to discover the available MNs. The handoff delay is used as criteria for system performance. Numerical results are presented to demonstrate the feasibility of MeshScan with Active Handoff algorithm. This fast handoff scheme is feasible by upgrading the software only on the client side. This paper compares the theoretical handoff latency of MeshScan with other approaches and we demonstrate the effectiveness of our scheme through experiment.
{"title":"MeshScan: Performance of Passive Handoff and Active Handoff","authors":"Yin Chen, Karol Kowalik, M. Davis","doi":"10.1109/WCSP.2009.5371523","DOIUrl":"https://doi.org/10.1109/WCSP.2009.5371523","url":null,"abstract":"A core problem of fast handoff is when handoff should perform and which Mesh Node (MN) should associated with. We have developed a fast handoff management scheme called MeshScan to provide a novel use of channel scanning latency, by employing open system authentication in both Passive Handoff and Active Handoff. This scheme comprises three steps: firstly a client device takes advantage of the Wireless Mesh Network (WMN) architecture to maintain a list of active MNs. Secondly MeshScan Handoff Sensor performs handoff when it receives a disassociation management frame from the serving MN or when the measured signal strength from the serving MN exceeds a given threshold. Thirdly when handoff is required, a client transmits Authentication Request frames to all MNs from the list instead of broadcasting Probe Request frames, as in an active scan to discover the available MNs. The handoff delay is used as criteria for system performance. Numerical results are presented to demonstrate the feasibility of MeshScan with Active Handoff algorithm. This fast handoff scheme is feasible by upgrading the software only on the client side. This paper compares the theoretical handoff latency of MeshScan with other approaches and we demonstrate the effectiveness of our scheme through experiment.","PeriodicalId":244652,"journal":{"name":"2009 International Conference on Wireless Communications & Signal Processing","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114809827","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 : 2009-12-31DOI: 10.1109/WCSP.2009.5371601
A. Yarmohammad, R. Tafazolli
Many radio access networks (RAN) operate in various bands, providing both common and distinct services. Currently the fixed allocation of spectrum (FSA) to various RANs creates inflexibility that leads to inefficient use of the spectrum. In this work a robust, technology neutral, decentralized, Inter-RAN dynamic spectrum selection (DSS) scheme is proposed. This work has sought to establish the basis for a generic method of DSS, wherein user equipment (UE) can obtain the most appropriate RAN for operation. Low complexity and low signaling overhead have been two important factors in designing this scheme. The impact of the proposed scheme on spectral efficiency and signaling load has been investigated. The results show an improvement in spectral efficiency with considerably low signaling overhead. Fairness in sharing, which is one of the important issues in spectrum sharing, can be easily achieved with this scheme.
{"title":"Decentralized inter-radio access network dynamic spectrum selection scheme","authors":"A. Yarmohammad, R. Tafazolli","doi":"10.1109/WCSP.2009.5371601","DOIUrl":"https://doi.org/10.1109/WCSP.2009.5371601","url":null,"abstract":"Many radio access networks (RAN) operate in various bands, providing both common and distinct services. Currently the fixed allocation of spectrum (FSA) to various RANs creates inflexibility that leads to inefficient use of the spectrum. In this work a robust, technology neutral, decentralized, Inter-RAN dynamic spectrum selection (DSS) scheme is proposed. This work has sought to establish the basis for a generic method of DSS, wherein user equipment (UE) can obtain the most appropriate RAN for operation. Low complexity and low signaling overhead have been two important factors in designing this scheme. The impact of the proposed scheme on spectral efficiency and signaling load has been investigated. The results show an improvement in spectral efficiency with considerably low signaling overhead. Fairness in sharing, which is one of the important issues in spectrum sharing, can be easily achieved with this scheme.","PeriodicalId":244652,"journal":{"name":"2009 International Conference on Wireless Communications & Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117063391","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 : 2009-12-31DOI: 10.1109/WCSP.2009.5371441
Jingwen Chen, Fengfan Yang, Shunwan Zhang, Lei Tang, Lin Luo, T. Le-Ngoc
In this paper a new kind of simple-encoding irregular systematic LDPC codes suitable for one-relay coded cooperation is designed, where the proposed joint iterative decoding is performed effectively in the destination regarding the two different irregular LDPC codes used by the source and relay in ideal and non-ideal coded cooperation. The theoretical analysis and simulations show that this new cooperation scheme clearly outperforms the non-cooperative one under the same conditions, and the convergence of the iterative decoding is also significantly accelerated due to the mutual exchange of extrinsic information resulted by the counterpart decoders corresponding to the LDPC codes used by the source and relay in both ideal and non-ideal channels.
{"title":"Joint iterative decoding for irregular-LDPC-based coded cooperation over a non-ideal relay channel","authors":"Jingwen Chen, Fengfan Yang, Shunwan Zhang, Lei Tang, Lin Luo, T. Le-Ngoc","doi":"10.1109/WCSP.2009.5371441","DOIUrl":"https://doi.org/10.1109/WCSP.2009.5371441","url":null,"abstract":"In this paper a new kind of simple-encoding irregular systematic LDPC codes suitable for one-relay coded cooperation is designed, where the proposed joint iterative decoding is performed effectively in the destination regarding the two different irregular LDPC codes used by the source and relay in ideal and non-ideal coded cooperation. The theoretical analysis and simulations show that this new cooperation scheme clearly outperforms the non-cooperative one under the same conditions, and the convergence of the iterative decoding is also significantly accelerated due to the mutual exchange of extrinsic information resulted by the counterpart decoders corresponding to the LDPC codes used by the source and relay in both ideal and non-ideal channels.","PeriodicalId":244652,"journal":{"name":"2009 International Conference on Wireless Communications & Signal Processing","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124791914","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 : 2009-12-31DOI: 10.1109/WCSP.2009.5371625
K. Yi, Wengang Li, Yongjun Sun, Daixian Zhu
In order to reduce the inter-user interference in multiuser Multiple-Input Multiple-Output (MIMO) wireless communication systems, e.g., MIMO-Orthogonal Frequency Division Multiplexing (MIMO-OFDM) systems, it is often desirable to the complex pre-processing at the transmitter. In this paper, we propose a multi-user beamfoming algorithm with sub-codebook selection. Based on the minimal leakage criterion, the codebook selection, limited feed-forward and MMSE detection are combined in the proposed algorithm. This avoids the complex channel matrix decomposition and inversion. Consequently, the computational complexity at the transmitter is significantly reduced. Simulation results show that the proposed algorithm performs better than existing beamforming algorithms.
{"title":"Low complexity beamfoming algorithm for multiuser MIMO systems","authors":"K. Yi, Wengang Li, Yongjun Sun, Daixian Zhu","doi":"10.1109/WCSP.2009.5371625","DOIUrl":"https://doi.org/10.1109/WCSP.2009.5371625","url":null,"abstract":"In order to reduce the inter-user interference in multiuser Multiple-Input Multiple-Output (MIMO) wireless communication systems, e.g., MIMO-Orthogonal Frequency Division Multiplexing (MIMO-OFDM) systems, it is often desirable to the complex pre-processing at the transmitter. In this paper, we propose a multi-user beamfoming algorithm with sub-codebook selection. Based on the minimal leakage criterion, the codebook selection, limited feed-forward and MMSE detection are combined in the proposed algorithm. This avoids the complex channel matrix decomposition and inversion. Consequently, the computational complexity at the transmitter is significantly reduced. Simulation results show that the proposed algorithm performs better than existing beamforming algorithms.","PeriodicalId":244652,"journal":{"name":"2009 International Conference on Wireless Communications & Signal Processing","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129736062","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
扫码关注我们
求助内容：
应助结果提醒方式：