Pub Date : 2004-12-20DOI: 10.1109/ACSSC.2004.1399261
D. Bliss, K. W. Forsythe
Multiple-input multiple-output (MIMO) wireless communication provides a number of potential advantages over traditional single-input single-output (SISO) approaches, including increased data rates for a given total transmit power and improved robustness to interference. In this paper, the details of a variety of receivers are incorporated into the effects of the channel so that information-theoretic performance bounds can be exploited to evaluate receiver approaches. Two classes of environments are considered: first, channel complexity, characterized by the distribution of the narrowband channel-matrix singular values and second, external interference. Receiver approaches discussed in this paper include minimum-mean-squared error, minimum-interference, as well as an iterative receiver that incorporates estimation subtraction, denoted here as multichannel multiuser detection (MCMUD). Various assumptions are made about the limitations on channel and interference estimation. Receiver performance implications are also demonstrated using experimental data.
{"title":"Information theoretic comparison of MIMO wireless communication receivers in the presence of interference","authors":"D. Bliss, K. W. Forsythe","doi":"10.1109/ACSSC.2004.1399261","DOIUrl":"https://doi.org/10.1109/ACSSC.2004.1399261","url":null,"abstract":"Multiple-input multiple-output (MIMO) wireless communication provides a number of potential advantages over traditional single-input single-output (SISO) approaches, including increased data rates for a given total transmit power and improved robustness to interference. In this paper, the details of a variety of receivers are incorporated into the effects of the channel so that information-theoretic performance bounds can be exploited to evaluate receiver approaches. Two classes of environments are considered: first, channel complexity, characterized by the distribution of the narrowband channel-matrix singular values and second, external interference. Receiver approaches discussed in this paper include minimum-mean-squared error, minimum-interference, as well as an iterative receiver that incorporates estimation subtraction, denoted here as multichannel multiuser detection (MCMUD). Various assumptions are made about the limitations on channel and interference estimation. Receiver performance implications are also demonstrated using experimental data.","PeriodicalId":396779,"journal":{"name":"Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117172461","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 : 2004-12-01DOI: 10.1109/ACSSC.2004.1399271
Solomon Wu, U. Mitra, C.-C. Jay Kuo
A joint channel estimation and symbol detection scheme is proposed for asynchronous code-division multiple-access systems over multipath fading channels. A low-complexity Kalman-like filter is developed for blind channel tracking using the recursive expectation maximization (EM) algorithm and the maximum a posteriori probability (MAP) symbol detection method. The recursive EM algorithm yields channel estimates with discrete valued phase ambiguities. By exploiting the statistical properties of the EM-based blind estimators as well as the robustness of noncoherent MAP detection to phase errors, a method to resolve the phase ambiguity problem even in the presence of a deep fading environment is proposed. Based on the proposed blind channel estimator and phase corrector, an iterative structure is introduced for joint channel estimation, symbol detection and soft multiple access interference cancellation.
{"title":"Iterative MAP channel estimation and multiuser detection for DS-CDMA in frequency-selective fading channels","authors":"Solomon Wu, U. Mitra, C.-C. Jay Kuo","doi":"10.1109/ACSSC.2004.1399271","DOIUrl":"https://doi.org/10.1109/ACSSC.2004.1399271","url":null,"abstract":"A joint channel estimation and symbol detection scheme is proposed for asynchronous code-division multiple-access systems over multipath fading channels. A low-complexity Kalman-like filter is developed for blind channel tracking using the recursive expectation maximization (EM) algorithm and the maximum a posteriori probability (MAP) symbol detection method. The recursive EM algorithm yields channel estimates with discrete valued phase ambiguities. By exploiting the statistical properties of the EM-based blind estimators as well as the robustness of noncoherent MAP detection to phase errors, a method to resolve the phase ambiguity problem even in the presence of a deep fading environment is proposed. Based on the proposed blind channel estimator and phase corrector, an iterative structure is introduced for joint channel estimation, symbol detection and soft multiple access interference cancellation.","PeriodicalId":396779,"journal":{"name":"Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004.","volume":"180 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123000597","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 : 2004-12-01DOI: 10.1109/ACSSC.2004.1399191
Yu Zhang, Zhongfeng Wang, K. Parhi
This paper studies load imbalance problem in the two stages of belief propagation decoding algorithm for LDPC codes and redistributes computational load between two stages. To further reduce the critical path delay, new look-up-tables (LUT) are developed to replace both conventional LUTs and data format transformation blocks. The adder trees are also reorganized for speed. This novel approach can reduce the critical path delay by 41.0% with negligible increase in the logic core size. This paper also exploits the similarity between these two stages and derives an area efficient design that remaps the functional units for these two stages onto the same hardware, which can reduce the logic core size by 10.2% and reduce the critical path delay by 16.2%.
{"title":"Efficient high-speed quasicyclic LDPC decoder architecture","authors":"Yu Zhang, Zhongfeng Wang, K. Parhi","doi":"10.1109/ACSSC.2004.1399191","DOIUrl":"https://doi.org/10.1109/ACSSC.2004.1399191","url":null,"abstract":"This paper studies load imbalance problem in the two stages of belief propagation decoding algorithm for LDPC codes and redistributes computational load between two stages. To further reduce the critical path delay, new look-up-tables (LUT) are developed to replace both conventional LUTs and data format transformation blocks. The adder trees are also reorganized for speed. This novel approach can reduce the critical path delay by 41.0% with negligible increase in the logic core size. This paper also exploits the similarity between these two stages and derives an area efficient design that remaps the functional units for these two stages onto the same hardware, which can reduce the logic core size by 10.2% and reduce the critical path delay by 16.2%.","PeriodicalId":396779,"journal":{"name":"Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130668679","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 : 2004-12-01DOI: 10.1109/ACSSC.2004.1399116
C. Abbey, R. Zemp, Jie Liu, Michael F. Insana
We investigate an ideal observer approach to signal processing in ultrasonic imaging. In two-class discrimination tasks of the sort explored in this work, the ideal observer approach rests on the use of the likelihood ratio as a test statistic. We derive this test statistic in the domain of the radio frequency (RF) signal under multivariate Gaussian assumptions and we describe a power series approach for inverting the large covariance matrices that result. We also show how a Wiener-filter for deconvolution emerges from a first-order truncation of the power series. We then use the ideal observer approach to investigate performance in a number of tasks idealized from the use of ultrasonic imaging for the discrimination of malignant and benign breast tissue. We consider both standard B-mode processing, and the effect of Weiner filtering the RF data. We report the statistical efficiency of human observers in these tasks-as evaluated by psychophysical studies-with respect to the ideal observer. The ideal observer allows us to compute the statistical efficiency with which suboptimal observers-such as humans-perform these tasks and how they are influenced by signal processing parameters.
{"title":"Observer efficiency in discrimination tasks simulating malignant and benign breast lesions with ultrasound","authors":"C. Abbey, R. Zemp, Jie Liu, Michael F. Insana","doi":"10.1109/ACSSC.2004.1399116","DOIUrl":"https://doi.org/10.1109/ACSSC.2004.1399116","url":null,"abstract":"We investigate an ideal observer approach to signal processing in ultrasonic imaging. In two-class discrimination tasks of the sort explored in this work, the ideal observer approach rests on the use of the likelihood ratio as a test statistic. We derive this test statistic in the domain of the radio frequency (RF) signal under multivariate Gaussian assumptions and we describe a power series approach for inverting the large covariance matrices that result. We also show how a Wiener-filter for deconvolution emerges from a first-order truncation of the power series. We then use the ideal observer approach to investigate performance in a number of tasks idealized from the use of ultrasonic imaging for the discrimination of malignant and benign breast tissue. We consider both standard B-mode processing, and the effect of Weiner filtering the RF data. We report the statistical efficiency of human observers in these tasks-as evaluated by psychophysical studies-with respect to the ideal observer. The ideal observer allows us to compute the statistical efficiency with which suboptimal observers-such as humans-perform these tasks and how they are influenced by signal processing parameters.","PeriodicalId":396779,"journal":{"name":"Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121270802","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 : 2004-12-01DOI: 10.1109/ACSSC.2004.1399449
C. Storlie, C. Davis, T. Hoar, T. Lee, D. Nychka, J. B. Weiss, Brandon Whitcher
We present a statistical approach to object tracking, which allows for paths to merge together or split apart. Paths are also allowed to be born, die, and go undetected for several frames. The splitting and merging of paths is a novel addition for a statistically based tracking algorithm. This addition is essential for storm tracking, which is the motivation for this work. The utility of this tracker extends well beyond the tracking of storms. However, it can be valuable in other tracking applications that have splitting or merging, such as vortices, radar/sonar signals, or groups of people. The method assumes that the location of an object behaves like a Gaussian process when it is observable. Objects are required to be born, die, split, or merge according to a Markov state model. An algorithm that finds the paths that maximize the likelihood of the assumed model achieves path correspondence.
{"title":"Identifying and tracking turbulence structures","authors":"C. Storlie, C. Davis, T. Hoar, T. Lee, D. Nychka, J. B. Weiss, Brandon Whitcher","doi":"10.1109/ACSSC.2004.1399449","DOIUrl":"https://doi.org/10.1109/ACSSC.2004.1399449","url":null,"abstract":"We present a statistical approach to object tracking, which allows for paths to merge together or split apart. Paths are also allowed to be born, die, and go undetected for several frames. The splitting and merging of paths is a novel addition for a statistically based tracking algorithm. This addition is essential for storm tracking, which is the motivation for this work. The utility of this tracker extends well beyond the tracking of storms. However, it can be valuable in other tracking applications that have splitting or merging, such as vortices, radar/sonar signals, or groups of people. The method assumes that the location of an object behaves like a Gaussian process when it is observable. Objects are required to be born, die, split, or merge according to a Markov state model. An algorithm that finds the paths that maximize the likelihood of the assumed model achieves path correspondence.","PeriodicalId":396779,"journal":{"name":"Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004.","volume":"49 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116319444","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 : 2004-12-01DOI: 10.1109/ACSSC.2004.1399445
S. Pillai, B. Himed, K. Li
Space-based radars (SBR) by virtue of their motion generate a Doppler frequency component to the clutter return from any point on the Earth as a function of the SBR - Earth geometry. The effect of Earth's rotation around its own axis also adds an additional component to this Doppler frequency. The overall effect of the Earth's rotation on the Doppler turns out to be two correction factors in terms of a crab angle affecting the azimuth angle, and a crab magnitude scaling the Doppler magnitude of the clutter patch. Interestingly, both these quantities depend only on the SBR orbit inclination and its latitude and not on the location of the clutter patch of interest. Further the crab angle has maximum effect for an SBR on a polar orbit that is above the equator. The crab magnitude on the other hand peaks for an SBR on an equatorial orbit. A detailed derivation of these results is presented in this paper.
{"title":"Modeling of Earth's rotation for space based radar","authors":"S. Pillai, B. Himed, K. Li","doi":"10.1109/ACSSC.2004.1399445","DOIUrl":"https://doi.org/10.1109/ACSSC.2004.1399445","url":null,"abstract":"Space-based radars (SBR) by virtue of their motion generate a Doppler frequency component to the clutter return from any point on the Earth as a function of the SBR - Earth geometry. The effect of Earth's rotation around its own axis also adds an additional component to this Doppler frequency. The overall effect of the Earth's rotation on the Doppler turns out to be two correction factors in terms of a crab angle affecting the azimuth angle, and a crab magnitude scaling the Doppler magnitude of the clutter patch. Interestingly, both these quantities depend only on the SBR orbit inclination and its latitude and not on the location of the clutter patch of interest. Further the crab angle has maximum effect for an SBR on a polar orbit that is above the equator. The crab magnitude on the other hand peaks for an SBR on an equatorial orbit. A detailed derivation of these results is presented in this paper.","PeriodicalId":396779,"journal":{"name":"Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123995980","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 : 2004-12-01DOI: 10.1109/ACSSC.2004.1399176
X. Zhang, K. K. Parhi
This paper presents novel high-speed architectures for the hardware implementation of the advanced encryption standard (AES) algorithm. Unlike previous works, which rely on look-up tables to implement the subbytes and invsubbytes transformations of the AES algorithm, the proposed design employs combinational logic only. As a direct consequence, the unbreakable delay incurred by look-up tables in the conventional approaches is eliminated and the advantage of subpipelining can be further explored. Furthermore, composite field arithmetic is employed to reduce the area requirements and different implementations for the inversion in subfield GF(2/sup 4/) are compared. In addition, efficient key expansion architecture suitable for the subpipelined round units is also presented. Using the proposed architecture, a fully subpipelined encryptor with 7 substages in each round unit can achieve a throughput of 21.56 Gbps on a Xilinx XCV 1000e-8bg560 device in nonfeedback modes, which is faster and is 79% more efficient than the fastest previous FPGA implementation known to date.
{"title":"An efficient 21.56 Gbps AES implementation on FPGA","authors":"X. Zhang, K. K. Parhi","doi":"10.1109/ACSSC.2004.1399176","DOIUrl":"https://doi.org/10.1109/ACSSC.2004.1399176","url":null,"abstract":"This paper presents novel high-speed architectures for the hardware implementation of the advanced encryption standard (AES) algorithm. Unlike previous works, which rely on look-up tables to implement the subbytes and invsubbytes transformations of the AES algorithm, the proposed design employs combinational logic only. As a direct consequence, the unbreakable delay incurred by look-up tables in the conventional approaches is eliminated and the advantage of subpipelining can be further explored. Furthermore, composite field arithmetic is employed to reduce the area requirements and different implementations for the inversion in subfield GF(2/sup 4/) are compared. In addition, efficient key expansion architecture suitable for the subpipelined round units is also presented. Using the proposed architecture, a fully subpipelined encryptor with 7 substages in each round unit can achieve a throughput of 21.56 Gbps on a Xilinx XCV 1000e-8bg560 device in nonfeedback modes, which is faster and is 79% more efficient than the fastest previous FPGA implementation known to date.","PeriodicalId":396779,"journal":{"name":"Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004.","volume":"159 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132057766","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 : 2004-12-01DOI: 10.1109/ACSSC.2004.1399514
A. Ahmed, R. Koetter, N. Shanbhag
A gradient descent, iterative soft-decision algorithm for decoding Reed-Solomon codes using adaptive parity check matrices has been proposed recently. This algorithm outperforms all known Reed-Solomon soft-decoding algorithms at moderate SNR. However, many applications operate at a high SNR with frame error rate requirements in the range of 10/sup -10/ /spl sim/ 10/sup -20/. At these frame error rates, simulation based performance validation is prohibitive. In this paper, we present a model to analytically compute the soft-decoding algorithm performance. Using the insight obtained from this model, we propose a low complexity, non-iterative algorithm using adaptive parity check matrices, with a similar decoding performance as the original iterative algorithm. We also propose an extension to the non-iterative algorithm , which improves on the decoding performance of the iterative algorithm.
{"title":"Performance analysis of the adaptive parity check matrix based soft-decision decoding algorithm","authors":"A. Ahmed, R. Koetter, N. Shanbhag","doi":"10.1109/ACSSC.2004.1399514","DOIUrl":"https://doi.org/10.1109/ACSSC.2004.1399514","url":null,"abstract":"A gradient descent, iterative soft-decision algorithm for decoding Reed-Solomon codes using adaptive parity check matrices has been proposed recently. This algorithm outperforms all known Reed-Solomon soft-decoding algorithms at moderate SNR. However, many applications operate at a high SNR with frame error rate requirements in the range of 10/sup -10/ /spl sim/ 10/sup -20/. At these frame error rates, simulation based performance validation is prohibitive. In this paper, we present a model to analytically compute the soft-decoding algorithm performance. Using the insight obtained from this model, we propose a low complexity, non-iterative algorithm using adaptive parity check matrices, with a similar decoding performance as the original iterative algorithm. We also propose an extension to the non-iterative algorithm , which improves on the decoding performance of the iterative algorithm.","PeriodicalId":396779,"journal":{"name":"Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004.","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121674456","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 : 2004-12-01DOI: 10.1109/ACSSC.2004.1399472
W. Jin, M. Scordilis, A. Iliev
An audio resampler is built to convert the sampling rate from 44.1 kHz to 16 kHz. An interpolator and decimator are created separately to change the sampling rate by an integer factor. The low pass filters used by the interpolator and decimator are obtained by two different approaches: namely the window method and the equiripple design. Vie performances of these two filters are evaluated in terms of 3-dB bandwidth and pass-band signal to noise ratios. The filters are implemented using the multistage interpolated FIR approach. Polyphase structures are used to further reduce the computational load. The resampler is implemented on 16-bit fixed-point simulations. The described approach drastically reduces the filter order and thus the computational cost.
{"title":"Comparison and implementation of a 16-bit fixed-point audio resampler","authors":"W. Jin, M. Scordilis, A. Iliev","doi":"10.1109/ACSSC.2004.1399472","DOIUrl":"https://doi.org/10.1109/ACSSC.2004.1399472","url":null,"abstract":"An audio resampler is built to convert the sampling rate from 44.1 kHz to 16 kHz. An interpolator and decimator are created separately to change the sampling rate by an integer factor. The low pass filters used by the interpolator and decimator are obtained by two different approaches: namely the window method and the equiripple design. Vie performances of these two filters are evaluated in terms of 3-dB bandwidth and pass-band signal to noise ratios. The filters are implemented using the multistage interpolated FIR approach. Polyphase structures are used to further reduce the computational load. The resampler is implemented on 16-bit fixed-point simulations. The described approach drastically reduces the filter order and thus the computational cost.","PeriodicalId":396779,"journal":{"name":"Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004.","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122872408","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 : 2004-12-01DOI: 10.1109/ACSSC.2004.1399346
Lichuan Liu, H. Ge
In this work, the idea of cross-layer design for wireless sensor networks is exploited to improve the network performance. We present a new energy efficient cooperative routing scheme with space diversity using space-time block codes (STBCs) as well as the link quality. In our solution, the selected multiple nodes act as multiple transmitting and receiving antennas. Full diversity from the orthogonal STBC is utilized to overcome multipath fading and to enhance power efficiency. The steady state network performance measures, such as, network throughput and delay are analyzed via Markov chain modelling. Compared with the traditional single relay routing method and the single receiving diversity routing method, our proposed method outperforms the other two in low SNR environments and provides higher throughput and similar delay in high SNR environments.
{"title":"Space-time coding for wireless sensor networks with cooperative routing diversity","authors":"Lichuan Liu, H. Ge","doi":"10.1109/ACSSC.2004.1399346","DOIUrl":"https://doi.org/10.1109/ACSSC.2004.1399346","url":null,"abstract":"In this work, the idea of cross-layer design for wireless sensor networks is exploited to improve the network performance. We present a new energy efficient cooperative routing scheme with space diversity using space-time block codes (STBCs) as well as the link quality. In our solution, the selected multiple nodes act as multiple transmitting and receiving antennas. Full diversity from the orthogonal STBC is utilized to overcome multipath fading and to enhance power efficiency. The steady state network performance measures, such as, network throughput and delay are analyzed via Markov chain modelling. Compared with the traditional single relay routing method and the single receiving diversity routing method, our proposed method outperforms the other two in low SNR environments and provides higher throughput and similar delay in high SNR environments.","PeriodicalId":396779,"journal":{"name":"Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004.","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124505715","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
扫码关注我们
求助内容：
应助结果提醒方式：