Pub Date : 1999-12-01DOI: 10.1109/PACRIM.1999.799470
R. Matsuo, M. Matsuo, T. Ohtsuki, T. Udagawa, I. Sasase
We analyze the bit error rate (BER) performance of indoor infrared wireless systems using on-off keying (OOK) code division multiple access (CDMA) on diffuse channels by taking the effects of intersymbol interference (ISI) over several chips into account. We evaluate how much the transmitted power should be increased on diffuse channels to compensate the performance degradation due to the ISI.
{"title":"Performance analysis of indoor infrared wireless systems using OOK CDMA on diffuse channels","authors":"R. Matsuo, M. Matsuo, T. Ohtsuki, T. Udagawa, I. Sasase","doi":"10.1109/PACRIM.1999.799470","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799470","url":null,"abstract":"We analyze the bit error rate (BER) performance of indoor infrared wireless systems using on-off keying (OOK) code division multiple access (CDMA) on diffuse channels by taking the effects of intersymbol interference (ISI) over several chips into account. We evaluate how much the transmitted power should be increased on diffuse channels to compensate the performance degradation due to the ISI.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121878305","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 : 1999-12-01DOI: 10.1109/PACRIM.1999.799572
K. Sato, T. Takada, S. Aoyagi, T. Hirotsu, T. Sugawara
This paper presents a novel framework for seamlessly integrating continuous media, such as audio and video, with the World Wide Web (WWW). Continuous Media with the Web (Cmew) enhances the interactivity of continuous media by associating hyperlinks with spatial-temporal parts of the media. The scenario control architecture in Cmew provides flexible and dynamic control over continuous media in multimedia documents. The Cmew media player has been implemented as a Java applet, which enables its use in the current WWW environment.
{"title":"Dynamic multimedia integration with the WWW","authors":"K. Sato, T. Takada, S. Aoyagi, T. Hirotsu, T. Sugawara","doi":"10.1109/PACRIM.1999.799572","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799572","url":null,"abstract":"This paper presents a novel framework for seamlessly integrating continuous media, such as audio and video, with the World Wide Web (WWW). Continuous Media with the Web (Cmew) enhances the interactivity of continuous media by associating hyperlinks with spatial-temporal parts of the media. The scenario control architecture in Cmew provides flexible and dynamic control over continuous media in multimedia documents. The Cmew media player has been implemented as a Java applet, which enables its use in the current WWW environment.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"19 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125634574","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 : 1999-12-01DOI: 10.1109/PACRIM.1999.799471
T. Sonoda, K. Kamakura, T. Ohtsuki, I. Sasase, S. Mori
This paper proposes frequency-encoding code-division multiple-access (FE-CDMA) systems using time-encoding for multiple access interference (MAI) mitigation. Time-encoding is that an incident ultrashort light pulse is split into several pulses with smaller power. In the proposed systems, MAI can be mitigated due to the smaller power and the multiplicity position of those pulses split by time-encoding. We show that the proposed system is effective to reduce the effect of the MAI when the received optical power is large.
{"title":"Optical frequency-encoding CDMA systems using time-encoding for MAI mitigation","authors":"T. Sonoda, K. Kamakura, T. Ohtsuki, I. Sasase, S. Mori","doi":"10.1109/PACRIM.1999.799471","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799471","url":null,"abstract":"This paper proposes frequency-encoding code-division multiple-access (FE-CDMA) systems using time-encoding for multiple access interference (MAI) mitigation. Time-encoding is that an incident ultrashort light pulse is split into several pulses with smaller power. In the proposed systems, MAI can be mitigated due to the smaller power and the multiplicity position of those pulses split by time-encoding. We show that the proposed system is effective to reduce the effect of the MAI when the received optical power is large.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"2011 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127365590","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 : 1999-08-22DOI: 10.1109/PACRIM.1999.799464
J. Malgosa-Sanahuja, J. García-Haro, A. Jaulin-Frances
Most of the services that an ATM broadband integrated services digital network (B-ISDN) has to offer have a multicast nature. For this type of services, a source of traffic transmits information to multiple destinations. In consequence, the ATM switching nodes have to support multi-point connections and they require some mechanisms to allow the replication of ATM multicast cells to subsequently route them. In this paper, we investigate some of the troubles along with their solutions found in a large ATM switch to provide multicast. Large switches apply in wide area network (WAN) environments where the number of multiplexed connections is often large as well as the number of necessary ports in the switching architecture. First, we describe the multicast switching technologies for local area networks (LANs). In this case, the number of ports is normally quite small (8 up to 32). Then, two common approaches to increase the switch size are outlined: one based on a Clos-like network and the other employing the knockout effect. Our contributions in this work are both the evaluation of the knockout effect in a multicast scenario and the evaluation of several routing algorithms in a three stage Clos-like network. The results obtained by computer simulation are presented and the most relevant conclusions addressed.
{"title":"Scalability issues in multicast ATM switching architectures. Problems and solutions","authors":"J. Malgosa-Sanahuja, J. García-Haro, A. Jaulin-Frances","doi":"10.1109/PACRIM.1999.799464","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799464","url":null,"abstract":"Most of the services that an ATM broadband integrated services digital network (B-ISDN) has to offer have a multicast nature. For this type of services, a source of traffic transmits information to multiple destinations. In consequence, the ATM switching nodes have to support multi-point connections and they require some mechanisms to allow the replication of ATM multicast cells to subsequently route them. In this paper, we investigate some of the troubles along with their solutions found in a large ATM switch to provide multicast. Large switches apply in wide area network (WAN) environments where the number of multiplexed connections is often large as well as the number of necessary ports in the switching architecture. First, we describe the multicast switching technologies for local area networks (LANs). In this case, the number of ports is normally quite small (8 up to 32). Then, two common approaches to increase the switch size are outlined: one based on a Clos-like network and the other employing the knockout effect. Our contributions in this work are both the evaluation of the knockout effect in a multicast scenario and the evaluation of several routing algorithms in a three stage Clos-like network. The results obtained by computer simulation are presented and the most relevant conclusions addressed.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125319771","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 : 1999-08-22DOI: 10.1109/PACRIM.1999.799603
Seokho Yoon, I. Song, Ju Mi Lee, Sun Yong Kim
When the code phase offset between two sequences is within one chip duration, the sum of two successive matched filter outputs has a constant value regardless of the residual code phase offset if the noise is absent. Based on this observation, we propose a new code acquisition scheme, which is robust to the variation of the residual code phase offset and outperforms the conventional scheme. Numerical results are also given to show that the proposed scheme is more robust to the variation of the residual code phase offset and has better performance than the conventional scheme on the average.
{"title":"A new DS/CDMA code acquisition scheme for reducing the effect of residual code phase offset","authors":"Seokho Yoon, I. Song, Ju Mi Lee, Sun Yong Kim","doi":"10.1109/PACRIM.1999.799603","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799603","url":null,"abstract":"When the code phase offset between two sequences is within one chip duration, the sum of two successive matched filter outputs has a constant value regardless of the residual code phase offset if the noise is absent. Based on this observation, we propose a new code acquisition scheme, which is robust to the variation of the residual code phase offset and outperforms the conventional scheme. Numerical results are also given to show that the proposed scheme is more robust to the variation of the residual code phase offset and has better performance than the conventional scheme on the average.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114887322","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 : 1999-08-22DOI: 10.1109/PACRIM.1999.799502
E. Dubrova, D.M. Miller
The relation between the number of nodes in a ROBDD and the number of implicants in the disjoint cover of the function represented by that ROBDD is studied. We identify a class of functions for which there are disjoint covers such that a cover of a larger size can be represented by a ROBDD with a smaller number of nodes. This shows that the size of a ROBDD is not a monotonically increasing function of the size of the disjoint cover.
{"title":"On disjoint covers and ROBDD size","authors":"E. Dubrova, D.M. Miller","doi":"10.1109/PACRIM.1999.799502","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799502","url":null,"abstract":"The relation between the number of nodes in a ROBDD and the number of implicants in the disjoint cover of the function represented by that ROBDD is studied. We identify a class of functions for which there are disjoint covers such that a cover of a larger size can be represented by a ROBDD with a smaller number of nodes. This shows that the size of a ROBDD is not a monotonically increasing function of the size of the disjoint cover.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114247332","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 : 1999-08-22DOI: 10.1109/PACRIM.1999.799612
X. Yang, M. Meng
The application of neural networks to real-time motion planning of robotic systems is studied. The proposed framework, using biologically inspired neural networks, for robot motion planning with obstacle avoidance in a nonstationary environment is computationally efficient. The neural dynamics of each neuron in the topologically organized neural network is characterized by a simple shunting equation derived from Hodgkin and Huxley's (1952) membrane model. The real-time optimal robot motion is planned through the dynamic activity landscape of the neural network that represents the dynamic environment. The proposed model can deal with point mobile robots, manipulation robots, holonomic and nonholonomic car-like robots and multi-robot systems. The efficiency and effectiveness are demonstrated by simulation studies.
{"title":"Neural network application in robot motion planning","authors":"X. Yang, M. Meng","doi":"10.1109/PACRIM.1999.799612","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799612","url":null,"abstract":"The application of neural networks to real-time motion planning of robotic systems is studied. The proposed framework, using biologically inspired neural networks, for robot motion planning with obstacle avoidance in a nonstationary environment is computationally efficient. The neural dynamics of each neuron in the topologically organized neural network is characterized by a simple shunting equation derived from Hodgkin and Huxley's (1952) membrane model. The real-time optimal robot motion is planned through the dynamic activity landscape of the neural network that represents the dynamic environment. The proposed model can deal with point mobile robots, manipulation robots, holonomic and nonholonomic car-like robots and multi-robot systems. The efficiency and effectiveness are demonstrated by simulation studies.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116850252","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 : 1999-08-22DOI: 10.1109/PACRIM.1999.799565
D. Rankin, T. Gulliver
This paper considers single parity check (SPC) product codes which are randomly interleaved between the dimensions of the code. The aim of the random interleaving is to reduce the number of codewords at minimum distance and potentially improve the minimum distance of the code. The performance is significantly improved with a three or more dimensional interleaved SPC product code.
{"title":"Randomly interleaved single parity check product codes","authors":"D. Rankin, T. Gulliver","doi":"10.1109/PACRIM.1999.799565","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799565","url":null,"abstract":"This paper considers single parity check (SPC) product codes which are randomly interleaved between the dimensions of the code. The aim of the random interleaving is to reduce the number of codewords at minimum distance and potentially improve the minimum distance of the code. The performance is significantly improved with a three or more dimensional interleaved SPC product code.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117082320","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 : 1999-08-22DOI: 10.1109/PACRIM.1999.799485
V. Kravtchenko, J. Little
The goal of our work is efficient color object segmentation from a sequence of live images for use in real-time applications including object tracking, system navigation, and material inspection. A novel, compact, look-up table color representation of a dielectric object that models the behavior of a color cluster, yields real-time performance, accounts for non-white illumination, shadows, highlights, and variable viewing and camera operating conditions is proposed.
{"title":"Efficient color object segmentation using the dichromatic reflection model","authors":"V. Kravtchenko, J. Little","doi":"10.1109/PACRIM.1999.799485","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799485","url":null,"abstract":"The goal of our work is efficient color object segmentation from a sequence of live images for use in real-time applications including object tracking, system navigation, and material inspection. A novel, compact, look-up table color representation of a dielectric object that models the behavior of a color cluster, yields real-time performance, accounts for non-white illumination, shadows, highlights, and variable viewing and camera operating conditions is proposed.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130371728","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 : 1999-08-22DOI: 10.1109/PACRIM.1999.799606
J.P.Y. Lee
A multi-channel digital receiver architecture is studied and its performance is analyzed for electronic warfare applications. It is found that this architecture has excellent performance for the intrapulse analysis and direction-finding of radar signals. Three unique features are identified: (a) both AOA and intrapulse information can be extracted from the same data set; (b) improvement in the quality of intrapulse information is obtained by a simple averaging of the digitized data profiles from all channels; and (c) since both the AOA and intrapulse information are interrelated, the quality of one parameter can be verified by the other in a multipath environment.
{"title":"A multi-channel digital receiver for intrapulse analysis and direction-finding","authors":"J.P.Y. Lee","doi":"10.1109/PACRIM.1999.799606","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799606","url":null,"abstract":"A multi-channel digital receiver architecture is studied and its performance is analyzed for electronic warfare applications. It is found that this architecture has excellent performance for the intrapulse analysis and direction-finding of radar signals. Three unique features are identified: (a) both AOA and intrapulse information can be extracted from the same data set; (b) improvement in the quality of intrapulse information is obtained by a simple averaging of the digitized data profiles from all channels; and (c) since both the AOA and intrapulse information are interrelated, the quality of one parameter can be verified by the other in a multipath environment.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123902294","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
扫码关注我们
求助内容：
应助结果提醒方式：