Pub Date : 2009-03-30DOI: 10.1109/SARNOF.2009.4850331
S. Hussain, Y. Louét
Software Radio (SWR) system being a combination of different standards, where each standard consisting of multi-carrier signals makes SWR signal extremely power fluctuating which results in high Peak to Average Power Ratio (PAPR). OFDM and SWR signals due to their multi-carrier nature inherit the same PAPR distribution characteristics and this fact makes it possible to employ already developed OFDM PAPR reduction techniques to SWR signals. Several techniques have been devised to reduce the PAPR of the OFDM signal. One of these PAPR reduction techniques is based on Peak Reducing Carriers (PRC) concept where a set of subcarriers is employed to reduce the temporal signal's peak. This paper employs PRC method for SWR signal PAPR reduction. A SWR base station would transmit a multiplex of standards signal where each standard having its own transmitting power requirements different from the other standards present in the SWR signal. An initial study is done for a bi-standard SWR system to see the variations in PAPR reduction gain with the variations in transmit power gap between the standards. Then PRC method is employed to reduce PAPR of a bi-standard SWR system containing standards with transmit power gap of 25 dB. PAPR is not only reduced by using in-band unused carriers of the standards as peak reducing carriers but also some inter-standard out-of-band (OOB) carriers are also used to reduce PAPR. The PAPR reduction performance by inband and OOB peak reducing carriers is compared. Also the effect of variation in mean power of OOB peak reducing carriers on PAPR reduction performance is discussed.
{"title":"PAPR reduction of Software Radio signals using PRC method","authors":"S. Hussain, Y. Louét","doi":"10.1109/SARNOF.2009.4850331","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850331","url":null,"abstract":"Software Radio (SWR) system being a combination of different standards, where each standard consisting of multi-carrier signals makes SWR signal extremely power fluctuating which results in high Peak to Average Power Ratio (PAPR). OFDM and SWR signals due to their multi-carrier nature inherit the same PAPR distribution characteristics and this fact makes it possible to employ already developed OFDM PAPR reduction techniques to SWR signals. Several techniques have been devised to reduce the PAPR of the OFDM signal. One of these PAPR reduction techniques is based on Peak Reducing Carriers (PRC) concept where a set of subcarriers is employed to reduce the temporal signal's peak. This paper employs PRC method for SWR signal PAPR reduction. A SWR base station would transmit a multiplex of standards signal where each standard having its own transmitting power requirements different from the other standards present in the SWR signal. An initial study is done for a bi-standard SWR system to see the variations in PAPR reduction gain with the variations in transmit power gap between the standards. Then PRC method is employed to reduce PAPR of a bi-standard SWR system containing standards with transmit power gap of 25 dB. PAPR is not only reduced by using in-band unused carriers of the standards as peak reducing carriers but also some inter-standard out-of-band (OOB) carriers are also used to reduce PAPR. The PAPR reduction performance by inband and OOB peak reducing carriers is compared. Also the effect of variation in mean power of OOB peak reducing carriers on PAPR reduction performance is discussed.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125653317","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-03-30DOI: 10.1109/SARNOF.2009.4850371
Maria Fresia, Ozgun Y. Bursalioglu, G. Caire, H. Poor
In this paper, the multicasting of digitally encoded images on a heterogeneous network is considered. In order to obtain analytically tractable problems, the wavelet transform coefficients of a digital image are modeled as a set of parallel Gaussian sources. Also, a general network transport mechanism subject to packet losses is modeled as an erasure broadcast channel where users are affected by possibly very different erasure probabilities. In the proposed setting, the convex nature of the rate distortion function allows relevant optimization problems corresponding to various performance criteria to be solved. The solutions of these optimization problems serve as starting points for the design of source-channel codes based on embedded scalar quantization, on linear rateless encoders that map directly the (redundant) bits generated by the quantizer into channel symbols, and on progressive transmission of the encoded symbols organized into “layers”, such that users with higher capacity achieve better end-to-end distortion. At the decoders, iterative belief propagation decoding, multi-stage sequential decoding of the layers and soft-bit reconstruction are used. Numerical experiment sshow that 1) the proposed model is sufficiently accurate to provide system design guidelines for the case of real-life images, and 2) the proposed coding scheme achieves ratedistortion performance very close to the theoretical optimum.
{"title":"Multicasting of digital images over erasure broadcast channels using rateless codes","authors":"Maria Fresia, Ozgun Y. Bursalioglu, G. Caire, H. Poor","doi":"10.1109/SARNOF.2009.4850371","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850371","url":null,"abstract":"In this paper, the multicasting of digitally encoded images on a heterogeneous network is considered. In order to obtain analytically tractable problems, the wavelet transform coefficients of a digital image are modeled as a set of parallel Gaussian sources. Also, a general network transport mechanism subject to packet losses is modeled as an erasure broadcast channel where users are affected by possibly very different erasure probabilities. In the proposed setting, the convex nature of the rate distortion function allows relevant optimization problems corresponding to various performance criteria to be solved. The solutions of these optimization problems serve as starting points for the design of source-channel codes based on embedded scalar quantization, on linear rateless encoders that map directly the (redundant) bits generated by the quantizer into channel symbols, and on progressive transmission of the encoded symbols organized into “layers”, such that users with higher capacity achieve better end-to-end distortion. At the decoders, iterative belief propagation decoding, multi-stage sequential decoding of the layers and soft-bit reconstruction are used. Numerical experiment sshow that 1) the proposed model is sufficiently accurate to provide system design guidelines for the case of real-life images, and 2) the proposed coding scheme achieves ratedistortion performance very close to the theoretical optimum.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124647624","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-03-30DOI: 10.1109/SARNOF.2009.4850301
N. Vlajic, D. Stevanovic
The use of sink mobility in wireless sensor networks (WSN) is commonly recognized as one of the most effective means of load balancing, ultimately leading to fewer failed nodes and longer network lifetime.
{"title":"Sink mobility in wireless sensor networks: When theory meets reality","authors":"N. Vlajic, D. Stevanovic","doi":"10.1109/SARNOF.2009.4850301","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850301","url":null,"abstract":"The use of sink mobility in wireless sensor networks (WSN) is commonly recognized as one of the most effective means of load balancing, ultimately leading to fewer failed nodes and longer network lifetime.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130083961","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-03-30DOI: 10.1109/SARNOF.2009.4850312
Shatnawi Heba, Gami Hiren, M. Qasaymeh, Tayem Nizar, M. E. Sawan, R. Pendse
Joint Time Delay and Frequency Estimation (JTDFE) problem of complex sinusoidal signals received at two separated sensors is an attractive problem that has been studied for many engineering applications. In this paper, the Rank-Revealing QR factorization is applied to the real data matrix obtained via the unitary transformation of the square Toeplitz complex data matrix. Then the MUSIC spectrum estimation function is used to estimate the frequencies. The time delay is estimated by applying RRQR to the complex data matrix. The unitary transformation from complex to real would reduce the processing time of frequency estimation by almost a factor of four, since the cost of complex manipulations is four times the real manipulations. Also RRQR is an important tool in numerical linear algebra because it provides accurate information about rank and numerical null space. The simulation results validate the performance of the proposed method.
{"title":"High resolution Joint Time Delay and Frequency Estimation","authors":"Shatnawi Heba, Gami Hiren, M. Qasaymeh, Tayem Nizar, M. E. Sawan, R. Pendse","doi":"10.1109/SARNOF.2009.4850312","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850312","url":null,"abstract":"Joint Time Delay and Frequency Estimation (JTDFE) problem of complex sinusoidal signals received at two separated sensors is an attractive problem that has been studied for many engineering applications. In this paper, the Rank-Revealing QR factorization is applied to the real data matrix obtained via the unitary transformation of the square Toeplitz complex data matrix. Then the MUSIC spectrum estimation function is used to estimate the frequencies. The time delay is estimated by applying RRQR to the complex data matrix. The unitary transformation from complex to real would reduce the processing time of frequency estimation by almost a factor of four, since the cost of complex manipulations is four times the real manipulations. Also RRQR is an important tool in numerical linear algebra because it provides accurate information about rank and numerical null space. The simulation results validate the performance of the proposed method.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122527825","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-03-30DOI: 10.1109/SARNOF.2009.4850304
S. Kulkarni, P. S. Prasad, P. Agrawal
Spatial diversity achieved via nodal cooperation is known to alleviate the ill effects of channel fading in wireless networks. But to exploit this phenomenon the idea of node cooperation needs to be extended to other layers of the protocol stack, especially the MAC layer. This paper takes a close look at Synergy MAC, a cooperative MAC protocol, proposed for wireless mobile ad hoc networks. The studied protocol also leverages on the multi-rate capability of 802.11b to allow nodes with low SNR to their destination make use of intermediate relays, to transmit data at rates higher than otherwise possible. The performance improvement achieved by this protocol in comparison to 802.11b is then evaluated through extensive simulations.
{"title":"Enabling cooperation in mobile ad hoc networks","authors":"S. Kulkarni, P. S. Prasad, P. Agrawal","doi":"10.1109/SARNOF.2009.4850304","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850304","url":null,"abstract":"Spatial diversity achieved via nodal cooperation is known to alleviate the ill effects of channel fading in wireless networks. But to exploit this phenomenon the idea of node cooperation needs to be extended to other layers of the protocol stack, especially the MAC layer. This paper takes a close look at Synergy MAC, a cooperative MAC protocol, proposed for wireless mobile ad hoc networks. The studied protocol also leverages on the multi-rate capability of 802.11b to allow nodes with low SNR to their destination make use of intermediate relays, to transmit data at rates higher than otherwise possible. The performance improvement achieved by this protocol in comparison to 802.11b is then evaluated through extensive simulations.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125505007","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-03-30DOI: 10.1109/SARNOF.2009.4850348
Yi Xie, Xiapu Luo, R. Chang
Energy management in a wireless LAN is an important problem, as the viability of wireless devices depends very much on their battery life. In this paper, we propose a centralized power saving mode (C-PSM), an AP-centric PSM for 802.11 infrastructure networks. Having the AP select optimal PSM parameters, such as the beacon and listen intervals, CPSM is able to maximize the total energy efficiency for all clients. Moreover, C-PSM provides a first-wake-up schedule to further increase the energy efficiency by reducing clients' simultaneous wake-ups. Extensive simulation experiments show that C-PSM outperforms the standard PSM by a very significant margin. In our set of experiments, C-PSM reduces power consumption and increases energy efficiency by as much as 76% and 320%, respectively. As a side benefit, C-PSM also decreases the frame buffering delay at the AP by 88%. The wake-up schedule can save clients' energy consumption by 22% at most. Moreover, the improvement increases with the number of clients.
{"title":"Centralized PSM: An AP-centric power saving Mode for 802.11 infrastructure networks","authors":"Yi Xie, Xiapu Luo, R. Chang","doi":"10.1109/SARNOF.2009.4850348","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850348","url":null,"abstract":"Energy management in a wireless LAN is an important problem, as the viability of wireless devices depends very much on their battery life. In this paper, we propose a centralized power saving mode (C-PSM), an AP-centric PSM for 802.11 infrastructure networks. Having the AP select optimal PSM parameters, such as the beacon and listen intervals, CPSM is able to maximize the total energy efficiency for all clients. Moreover, C-PSM provides a first-wake-up schedule to further increase the energy efficiency by reducing clients' simultaneous wake-ups. Extensive simulation experiments show that C-PSM outperforms the standard PSM by a very significant margin. In our set of experiments, C-PSM reduces power consumption and increases energy efficiency by as much as 76% and 320%, respectively. As a side benefit, C-PSM also decreases the frame buffering delay at the AP by 88%. The wake-up schedule can save clients' energy consumption by 22% at most. Moreover, the improvement increases with the number of clients.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125517733","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-03-30DOI: 10.1109/SARNOF.2009.4850361
Shweta Jain, A. Saleem, Hongbo Liu, Yanyong Zhang, D. Raychaudhuri
Cache-and-Forward (CNF) is a future Internet architecture designed for content delivery to mobile users over wireless networks with varying link quality and intermittent connectivity. The CNF protocol is based on strict hop-by-hop transport of media files with in-network storage at each router or wireless access point. The protocol also incorporates content caching capabilities for efficient delivery of popular media files. In this paper, we briefly describe the CNF architecture, present a survey of prior work, and describe new CNF link and routing protocols. Throughput results comparing CNF with TCP/IP are summarized for an example wide-area Internet scenario with wireless access networks. The design of a reliable CNF link layer protocol is discussed and performance results are given for multihop wireless scenarios. The paper concludes with an outline of dynamic CNF routing algorithms which consider both short-term and long-term path quality along with available in-network storage.
{"title":"Design of link and routing protocols for Cache-and-Forward networks","authors":"Shweta Jain, A. Saleem, Hongbo Liu, Yanyong Zhang, D. Raychaudhuri","doi":"10.1109/SARNOF.2009.4850361","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850361","url":null,"abstract":"Cache-and-Forward (CNF) is a future Internet architecture designed for content delivery to mobile users over wireless networks with varying link quality and intermittent connectivity. The CNF protocol is based on strict hop-by-hop transport of media files with in-network storage at each router or wireless access point. The protocol also incorporates content caching capabilities for efficient delivery of popular media files. In this paper, we briefly describe the CNF architecture, present a survey of prior work, and describe new CNF link and routing protocols. Throughput results comparing CNF with TCP/IP are summarized for an example wide-area Internet scenario with wireless access networks. The design of a reliable CNF link layer protocol is discussed and performance results are given for multihop wireless scenarios. The paper concludes with an outline of dynamic CNF routing algorithms which consider both short-term and long-term path quality along with available in-network storage.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126743118","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-03-30DOI: 10.1109/SARNOF.2009.4850317
E. Oki, A. Iwaki
This paper compares performances of optimal routing by the pipe, hose, and intermediate models. The pipe model, which is specified by the exact traffic matrix, provides the best routing performance, while the traffic matrix is difficult to measure and predict accurately. On the other hand, the hose model is specified by the traffic as just the total outgoing/incoming traffic from/to each node, but it has a problem that its routing performance is degraded compared to the pipe model, due to insufficient traffic information. The intermediate model, where the upper and lower bounds of traffic demands for source-destination pairs are added as constraints, is a construction that lies between the pipe and hose models. The intermediate model, which lightens the difficulty of the pipe model, but narrows the range of traffic conditions specified by the hose model, enhances the routing performance compared to the hose model. An optimal-routing formulation extended from the pipe model to the intermediate model can not be solved as a regular linear programming (LP) problem. Our solution, the introduction of a duality theorem, turns our problem into an LP formulation that can be easily solved. Numerical results show that the network congestion ratio for the pipe model is much lower than that of hose model. The differences of network congestion ratios between the pipe and hose models lie in the range from 27% to 45% for the various examined network topologies. The intermediate model offers better routing performance than the hose model. The reduction effect of the network congestion ratio by the intermediate model is 26% compared to the hose model, when the upper-bound margin is set 25%.
{"title":"Performance comparisons of optimal routing by pipe, hose, and intermediate models","authors":"E. Oki, A. Iwaki","doi":"10.1109/SARNOF.2009.4850317","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850317","url":null,"abstract":"This paper compares performances of optimal routing by the pipe, hose, and intermediate models. The pipe model, which is specified by the exact traffic matrix, provides the best routing performance, while the traffic matrix is difficult to measure and predict accurately. On the other hand, the hose model is specified by the traffic as just the total outgoing/incoming traffic from/to each node, but it has a problem that its routing performance is degraded compared to the pipe model, due to insufficient traffic information. The intermediate model, where the upper and lower bounds of traffic demands for source-destination pairs are added as constraints, is a construction that lies between the pipe and hose models. The intermediate model, which lightens the difficulty of the pipe model, but narrows the range of traffic conditions specified by the hose model, enhances the routing performance compared to the hose model. An optimal-routing formulation extended from the pipe model to the intermediate model can not be solved as a regular linear programming (LP) problem. Our solution, the introduction of a duality theorem, turns our problem into an LP formulation that can be easily solved. Numerical results show that the network congestion ratio for the pipe model is much lower than that of hose model. The differences of network congestion ratios between the pipe and hose models lie in the range from 27% to 45% for the various examined network topologies. The intermediate model offers better routing performance than the hose model. The reduction effect of the network congestion ratio by the intermediate model is 26% compared to the hose model, when the upper-bound margin is set 25%.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117337705","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-03-30DOI: 10.1109/SARNOF.2009.4850285
Stanley S. K. Ho, C. Saavedra
A novel CMOS frequency doubler circuit is presented in this paper. A common source transistor pair biased at threshold is used to rectify the input signal in both the positive and negative cycles. The rectified signals are then subtracted to generate a double frequency signal. Measurement results show that there is more than 20 dB fundamental rejection with the input power level ranging from −20 dBm to −10.3 dBm. The 3rd and 4th harmonic rejections are above 20 dB with input power up to −10 dBm without any on-chip or off-chip filtering.
{"title":"Frequency doubler employing active fundamental cancellation in CMOS","authors":"Stanley S. K. Ho, C. Saavedra","doi":"10.1109/SARNOF.2009.4850285","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850285","url":null,"abstract":"A novel CMOS frequency doubler circuit is presented in this paper. A common source transistor pair biased at threshold is used to rectify the input signal in both the positive and negative cycles. The rectified signals are then subtracted to generate a double frequency signal. Measurement results show that there is more than 20 dB fundamental rejection with the input power level ranging from −20 dBm to −10.3 dBm. The 3rd and 4th harmonic rejections are above 20 dB with input power up to −10 dBm without any on-chip or off-chip filtering.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129177615","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-03-30DOI: 10.1109/SARNOF.2009.4850294
B. Mennenga, G. Fettweis
Tree search based detection algorithms provide a promising approach to solve the detection problems in MIMO systems. Depth-first, Breadth-first or Metric-first search strategies provide near max-log detection at reduced but still significant complexity. In this paper we show how the incurred complexity can be reduced substantially. In order to reduce the number of metric calculations to a minimum, we propose a novel relative determination of search sequences for QAM constellations, usable inexpensively independent of the underlying constellation size and search strategy and moreover also usable for soft-in soft-out detection. Based on its application to a sphere detector, we will demonstrate the impact on complexity and performance of the detection as well as on the detector structure. Building on the results, we propose refinements of the resulting detector providing a very good performance at minimized complexity, making the resulting detector particularly favorable for implementation.
{"title":"Search sequence determination for tree search based detection algorithms","authors":"B. Mennenga, G. Fettweis","doi":"10.1109/SARNOF.2009.4850294","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850294","url":null,"abstract":"Tree search based detection algorithms provide a promising approach to solve the detection problems in MIMO systems. Depth-first, Breadth-first or Metric-first search strategies provide near max-log detection at reduced but still significant complexity. In this paper we show how the incurred complexity can be reduced substantially. In order to reduce the number of metric calculations to a minimum, we propose a novel relative determination of search sequences for QAM constellations, usable inexpensively independent of the underlying constellation size and search strategy and moreover also usable for soft-in soft-out detection. Based on its application to a sphere detector, we will demonstrate the impact on complexity and performance of the detection as well as on the detector structure. Building on the results, we propose refinements of the resulting detector providing a very good performance at minimized complexity, making the resulting detector particularly favorable for implementation.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"269 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116580130","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
扫码关注我们
求助内容：
应助结果提醒方式：