Pub Date : 2009-03-18DOI: 10.1109/CISS.2009.5054845
Richard Primerano, M. Kam, K. Dandekar
As low cost, low power wireless networking technologies continue to gain popularity in industrial control and remote sensing applications, greater demand is being placed on network reliability and robustness. The numerous metallic objects found in many industrial environments can make reliable RF coverage difficult to obtain. In cases where system components are physically isolated from one another by metallic barriers (e.g. bulkheads or storage tank walls), direct RF communication between components is not possible. Prior research into the use of ultrasonic signaling as a means of passing data across metallic barriers has proven successful, but it has been observed that acoustic echoing in the channel leads to significant intersymbol interference (ISI) when symbol rate approaches the hundred kilosymbol/second range. An echo cancelation technique was developed to partially suppress these echoes, but its performance was limited due to simplicity of the channel model used. In this paper, we develop a more accurate channel model and use it as the basis for constructing an improved echo cancelation pulse. The new pulse suppresses echoes to a level comparable to the RMS noise amplitude of the channel, greatly reducing ISI. The resulting transceiver is capable of transmitting data at over 5 Mbps using simple pulse amplitude modulation (PAM). This technique thus represents a data rate increase by a factor of five over prior work.
{"title":"High bit rate ultrasonic communication through metal channels","authors":"Richard Primerano, M. Kam, K. Dandekar","doi":"10.1109/CISS.2009.5054845","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054845","url":null,"abstract":"As low cost, low power wireless networking technologies continue to gain popularity in industrial control and remote sensing applications, greater demand is being placed on network reliability and robustness. The numerous metallic objects found in many industrial environments can make reliable RF coverage difficult to obtain. In cases where system components are physically isolated from one another by metallic barriers (e.g. bulkheads or storage tank walls), direct RF communication between components is not possible. Prior research into the use of ultrasonic signaling as a means of passing data across metallic barriers has proven successful, but it has been observed that acoustic echoing in the channel leads to significant intersymbol interference (ISI) when symbol rate approaches the hundred kilosymbol/second range. An echo cancelation technique was developed to partially suppress these echoes, but its performance was limited due to simplicity of the channel model used. In this paper, we develop a more accurate channel model and use it as the basis for constructing an improved echo cancelation pulse. The new pulse suppresses echoes to a level comparable to the RMS noise amplitude of the channel, greatly reducing ISI. The resulting transceiver is capable of transmitting data at over 5 Mbps using simple pulse amplitude modulation (PAM). This technique thus represents a data rate increase by a factor of five over prior work.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131981275","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-18DOI: 10.1109/CISS.2009.5054694
Jiaxi Xiao, A. Karbaschi, A. Adibi, S. McLaughlin
We propose a computationally efficient scheme to decode two-dimensional (2D) intersymbol interference (ISI) channel with M-ary input. The basic idea is to equalize the channel stage by stage. To begin with the stage with the highest signal power level, the BCJR algorithm is used to equalize each level by averaging the interference of the undecoded levels. Both the hard and soft decisions are passed to the next stages. The scheme hugely reduces the complexity of full-branch BCJR on the entire received page of data and makes the equalization applicable. Based on the statistic output of each stage the overall information rates are evaluated. Furthermore, the coding simulation results are presented. All of these results show the proposed scheme is a good candidate for decoding such M-ary 2D ISI channels.
{"title":"Multilevel coding and multistage decoding for M-ary two-dimensional ISI channels","authors":"Jiaxi Xiao, A. Karbaschi, A. Adibi, S. McLaughlin","doi":"10.1109/CISS.2009.5054694","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054694","url":null,"abstract":"We propose a computationally efficient scheme to decode two-dimensional (2D) intersymbol interference (ISI) channel with M-ary input. The basic idea is to equalize the channel stage by stage. To begin with the stage with the highest signal power level, the BCJR algorithm is used to equalize each level by averaging the interference of the undecoded levels. Both the hard and soft decisions are passed to the next stages. The scheme hugely reduces the complexity of full-branch BCJR on the entire received page of data and makes the equalization applicable. Based on the statistic output of each stage the overall information rates are evaluated. Furthermore, the coding simulation results are presented. All of these results show the proposed scheme is a good candidate for decoding such M-ary 2D ISI channels.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":" 36","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132011941","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-18DOI: 10.1109/CISS.2009.5054683
Guanchun Wang, S. Kulkarni, H. Poor
In this paper, practical algorithms for solving the probabilistic judgment aggregation problem are given. First, the scalable Coherent Approximation Principle (CAP) algorithm proposed by Predd, et al., and its computational savings gained through Successive Orthogonal Projection are explained. Implications of de Finetti's theorem in this situation are also discussed. Then a coherence penalty is defined and the Coherence Penalty Weighted Principle (CPWP) is proposed to take advantage of the data structure alongside the coherence approximation. Justification is given for the guideline that more coherent judges should be given larger weights. Simulation results with Brier Scores on both a collected database and simulated data are given for comparison. In addition to the CPWP, a recursive online variant with weight updates is presented to accommodate real-time aggregation problems.
{"title":"Aggregating disparate judgments using a coherence penalty","authors":"Guanchun Wang, S. Kulkarni, H. Poor","doi":"10.1109/CISS.2009.5054683","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054683","url":null,"abstract":"In this paper, practical algorithms for solving the probabilistic judgment aggregation problem are given. First, the scalable Coherent Approximation Principle (CAP) algorithm proposed by Predd, et al., and its computational savings gained through Successive Orthogonal Projection are explained. Implications of de Finetti's theorem in this situation are also discussed. Then a coherence penalty is defined and the Coherence Penalty Weighted Principle (CPWP) is proposed to take advantage of the data structure alongside the coherence approximation. Justification is given for the guideline that more coherent judges should be given larger weights. Simulation results with Brier Scores on both a collected database and simulated data are given for comparison. In addition to the CPWP, a recursive online variant with weight updates is presented to accommodate real-time aggregation problems.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"20 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131614583","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-18DOI: 10.1109/CISS.2009.5054701
M. A. Haleem, A. Haimovich
This paper presents studies on the range and speed resolution in distributed MIMO radar with the use of finite duration Gaussian pulse trains. We consider a network of transmit and receive sensors, where the distance between the randomly placed sensors is comparable to the distance to the target. While the resolution capability of a single transmitter-receiver pair is determined by the carrier frequency and parameters of the pulse train, namely the pulse width, pulse interval and the number of pulses, the orientations of the sensors with respect to the target has a major effect on the ambiguity due to subsidiary peaks. The randomness in the sensor locations randomizes the relative positions of subsidiary peaks of the ambiguity function. With multiple transmitter-receiver pairs, the randomness in the locations of sensors in effect reduces the subsidiary peaks in the ambiguity function of a single transmitter receiver-pair by a factor of MN, where M and N are the number of transmitters and receivers.
{"title":"Range and speed resolution in coherent distributed MIMO radar with Gaussian pulse trains","authors":"M. A. Haleem, A. Haimovich","doi":"10.1109/CISS.2009.5054701","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054701","url":null,"abstract":"This paper presents studies on the range and speed resolution in distributed MIMO radar with the use of finite duration Gaussian pulse trains. We consider a network of transmit and receive sensors, where the distance between the randomly placed sensors is comparable to the distance to the target. While the resolution capability of a single transmitter-receiver pair is determined by the carrier frequency and parameters of the pulse train, namely the pulse width, pulse interval and the number of pulses, the orientations of the sensors with respect to the target has a major effect on the ambiguity due to subsidiary peaks. The randomness in the sensor locations randomizes the relative positions of subsidiary peaks of the ambiguity function. With multiple transmitter-receiver pairs, the randomness in the locations of sensors in effect reduces the subsidiary peaks in the ambiguity function of a single transmitter receiver-pair by a factor of MN, where M and N are the number of transmitters and receivers.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125235690","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-18DOI: 10.1109/CISS.2009.5054835
P. Rogan
Transcribed exons in genes are joined together at donor and acceptor splice sites precisely and efficiently to generate mRNAs capa1ble of being translated into proteins. The sequence variability in individual splice sites can be modeled using Shannon information theory. In the laboratory, the degree of individual splice site use is inferred from the structures of mRNAs and their relative abundance. These structures can be predicted using a bipartite information theory framework that is guided by current knowledge of biological mechanisms for exon recognition. We present the results of this analysis for the complete dataset of all expressed human exons.
{"title":"Ab initio exon definition using an information theory-based approach","authors":"P. Rogan","doi":"10.1109/CISS.2009.5054835","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054835","url":null,"abstract":"Transcribed exons in genes are joined together at donor and acceptor splice sites precisely and efficiently to generate mRNAs capa1ble of being translated into proteins. The sequence variability in individual splice sites can be modeled using Shannon information theory. In the laboratory, the degree of individual splice site use is inferred from the structures of mRNAs and their relative abundance. These structures can be predicted using a bipartite information theory framework that is guided by current knowledge of biological mechanisms for exon recognition. We present the results of this analysis for the complete dataset of all expressed human exons.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131251264","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-18DOI: 10.1109/CISS.2009.5054800
Seyed Ali Ahmadzadeh, A. Motahari, A. Khandani
In this paper, a single-hop single-relay system with a direct link between the source and the destination is considered when the relay operates in the half-duplex mode. Motivated by the concept of signal space diversity, this paper introduces signal space cooperation, in which cooperation between the source and the relay is achieved using a novel constellation design. In this approach, the original constellation is expanded so that each member of the new constellation inherits its components from members of the original signal set. The expanded constellation enables the relay to extract the required information in order to cooperate in the relay phase, and it helps the destination to effectively combine received signals during the broadcast phase and the relay phase. The analytical study of the proposed scheme leads to the development of two design criteria for the constellation expansion. Numerical results depict superior performance in comparison with other cooperative schemes such as the distributed turbo code schemes.
{"title":"Constellation Design for Cooperative Communication","authors":"Seyed Ali Ahmadzadeh, A. Motahari, A. Khandani","doi":"10.1109/CISS.2009.5054800","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054800","url":null,"abstract":"In this paper, a single-hop single-relay system with a direct link between the source and the destination is considered when the relay operates in the half-duplex mode. Motivated by the concept of signal space diversity, this paper introduces signal space cooperation, in which cooperation between the source and the relay is achieved using a novel constellation design. In this approach, the original constellation is expanded so that each member of the new constellation inherits its components from members of the original signal set. The expanded constellation enables the relay to extract the required information in order to cooperate in the relay phase, and it helps the destination to effectively combine received signals during the broadcast phase and the relay phase. The analytical study of the proposed scheme leads to the development of two design criteria for the constellation expansion. Numerical results depict superior performance in comparison with other cooperative schemes such as the distributed turbo code schemes.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133745172","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-18DOI: 10.1109/CISS.2009.5054799
T. Renk, F. Jondral
Cooperative networking as a means of creating spatial diversity is used in order to mitigate the adverse effect of fading in a wireless channel and increase reliability of communications. We investigate signal-to-noise ratio (SNR) gain in wireless cooperative networks. We show that the differential SNR gain in the high data rate regime, which we refer to as SNR gain exponent ζ∞, is independent of the relaying strategy and only depends on the number of transmission phases used for communication. Furthermore, a straight-line upper and lower bound is derived based on geometric considerations. It is shown that the approximation error of the upper bound with respect to the exact SNR gain tends to zero for R → ∞. For the lower bound, the approximation error tends asymptotically to a constant factor δ for R → ∞. Both bounds are the best possible straight-line bounds with respect to absolute error.
{"title":"Upper and lower bound on signal-to-noise ratio gains for cooperative relay networks","authors":"T. Renk, F. Jondral","doi":"10.1109/CISS.2009.5054799","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054799","url":null,"abstract":"Cooperative networking as a means of creating spatial diversity is used in order to mitigate the adverse effect of fading in a wireless channel and increase reliability of communications. We investigate signal-to-noise ratio (SNR) gain in wireless cooperative networks. We show that the differential SNR gain in the high data rate regime, which we refer to as SNR gain exponent ζ∞, is independent of the relaying strategy and only depends on the number of transmission phases used for communication. Furthermore, a straight-line upper and lower bound is derived based on geometric considerations. It is shown that the approximation error of the upper bound with respect to the exact SNR gain tends to zero for R → ∞. For the lower bound, the approximation error tends asymptotically to a constant factor δ for R → ∞. Both bounds are the best possible straight-line bounds with respect to absolute error.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115407832","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-18DOI: 10.1109/CISS.2009.5054769
A. Cassidy, A. Andreou
In this paper, we revisit Amdahl's law, expanding it to a generalized form, incorporating energy costs, and exploring its application to chip-multiprocessor architecture optimization. By formulating a system objective function that encompasses the system costs, we can solve for the optimal multiprocessor architecture for a given set of application and architectural parameters. First we use the derived cost function to examine the performance components of two architectures. Second, we apply it to a design example, finding the optimal architecture for a given set of application characteristics.
{"title":"Analytical methods for the design and optimization of chip-multiprocessor architectures","authors":"A. Cassidy, A. Andreou","doi":"10.1109/CISS.2009.5054769","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054769","url":null,"abstract":"In this paper, we revisit Amdahl's law, expanding it to a generalized form, incorporating energy costs, and exploring its application to chip-multiprocessor architecture optimization. By formulating a system objective function that encompasses the system costs, we can solve for the optimal multiprocessor architecture for a given set of application and architectural parameters. First we use the derived cost function to examine the performance components of two architectures. Second, we apply it to a design example, finding the optimal architecture for a given set of application characteristics.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115552296","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-18DOI: 10.1109/CISS.2009.5054738
Xiang He, A. Yener
In this work, we derive new outer bounds for the two-user interference channel with confidential messages. An upper bound is found for the sum rate. When the interfering link of the first user is greater than 1, a new upper bound on 2R1 + R2 is obtained by studying a special form of the three-user interference channel. The bounds are then compared with known bounds for the symmetric interference channel under strong interference regime. In particular, examples are presented to showcase for channel parameters where positive secrecy rates are known to be achievable, the new bounds improve upon the known outer bounds on the secrecy capacity region. It is shown that, in some cases, the 2R1+R2 bound also improves the bound on the sum rate.
{"title":"A new outer bound for the gaussian interference channel with confidential messages","authors":"Xiang He, A. Yener","doi":"10.1109/CISS.2009.5054738","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054738","url":null,"abstract":"In this work, we derive new outer bounds for the two-user interference channel with confidential messages. An upper bound is found for the sum rate. When the interfering link of the first user is greater than 1, a new upper bound on 2R1 + R2 is obtained by studying a special form of the three-user interference channel. The bounds are then compared with known bounds for the symmetric interference channel under strong interference regime. In particular, examples are presented to showcase for channel parameters where positive secrecy rates are known to be achievable, the new bounds improve upon the known outer bounds on the secrecy capacity region. It is shown that, in some cases, the 2R1+R2 bound also improves the bound on the sum rate.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114543273","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-18DOI: 10.1109/CISS.2009.5054791
Longbi Lin, N. Shroff
The past decade has witnessed increasing interest in developing sensor networks. The applications of such wireless networks range from monitoring natural habitat of endangered species to providing safety messages and location information in an ad hoc network set up for disaster relief efforts.
{"title":"Energy-aware time synchronization in sensor networks: a Two-clock approach","authors":"Longbi Lin, N. Shroff","doi":"10.1109/CISS.2009.5054791","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054791","url":null,"abstract":"The past decade has witnessed increasing interest in developing sensor networks. The applications of such wireless networks range from monitoring natural habitat of endangered species to providing safety messages and location information in an ad hoc network set up for disaster relief efforts.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117097471","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
扫码关注我们
求助内容：
应助结果提醒方式：