Pub Date : 2005-09-11DOI: 10.1109/PIMRC.2005.1651923
Jinfan Zhang, Shidong Zhou, Jing Wang
Direct-sequence code-division multiple access (DS-CDMA) is a popular wireless technology. In DS-CDMA communications, all of the users' signals overlap in time and frequency and cause mutual interference. Serial interference cancellation (SIC) multiuser detection is a very promising low complexity approach to handle this problem. In conventional single timeslot based SIC scheme, SIC is performed first, then followed by deinterleaving and Viterbi decoding which use the outputs of the last stage of the SlC as the input. In this paper, a novel multiple timeslots based SIC multiuser detection scheme for coded synchronous DS-CDMA is proposed. The new detector performs joint multiple timeslots successive interference cancellation (JMT-SIC) and Viterbi decoding (VD) in each step of the interference cancellation. Simulation results within the framework of the third generation wireless communication standard TD-SCDMA has shown that the BER performance of the proposed scheme is much better than the conventional one
{"title":"A new serial interference cancellation algorithm based on joint multiple timeslots processing","authors":"Jinfan Zhang, Shidong Zhou, Jing Wang","doi":"10.1109/PIMRC.2005.1651923","DOIUrl":"https://doi.org/10.1109/PIMRC.2005.1651923","url":null,"abstract":"Direct-sequence code-division multiple access (DS-CDMA) is a popular wireless technology. In DS-CDMA communications, all of the users' signals overlap in time and frequency and cause mutual interference. Serial interference cancellation (SIC) multiuser detection is a very promising low complexity approach to handle this problem. In conventional single timeslot based SIC scheme, SIC is performed first, then followed by deinterleaving and Viterbi decoding which use the outputs of the last stage of the SlC as the input. In this paper, a novel multiple timeslots based SIC multiuser detection scheme for coded synchronous DS-CDMA is proposed. The new detector performs joint multiple timeslots successive interference cancellation (JMT-SIC) and Viterbi decoding (VD) in each step of the interference cancellation. Simulation results within the framework of the third generation wireless communication standard TD-SCDMA has shown that the BER performance of the proposed scheme is much better than the conventional one","PeriodicalId":293442,"journal":{"name":"The 7th International Conference on Advanced Communication Technology, 2005, ICACT 2005.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124026539","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 : 2005-07-11DOI: 10.1109/ICACT.2005.245956
Vinod Mann
Continuous media (CM) applications have very critical performance requirements. System resources (CPU, file systems, networks etc) have to be steered to deliver maximum performance. However, a big question mark springs up when it comes to reservation of these resources in an efficient manner. The concept of metascheduling is proposed which serves non-real-time clients just as well as real-time ones. The quintessential pillar of metascheduling, the CM-resource model is captured to the core in this paper. This model extends a mathematical treatment to the concepts of 'workload' and 'delay', proposes a pseudo code for reservation of multi-resources and describes the necessaries of compound sessions and its parameters. This paper not only converges on performance but also focuses on CM-resource model's support to various communication topologies
{"title":"Metascheduling: an elixir for performance-tuning of compound sessions based on the CM-resource model","authors":"Vinod Mann","doi":"10.1109/ICACT.2005.245956","DOIUrl":"https://doi.org/10.1109/ICACT.2005.245956","url":null,"abstract":"Continuous media (CM) applications have very critical performance requirements. System resources (CPU, file systems, networks etc) have to be steered to deliver maximum performance. However, a big question mark springs up when it comes to reservation of these resources in an efficient manner. The concept of metascheduling is proposed which serves non-real-time clients just as well as real-time ones. The quintessential pillar of metascheduling, the CM-resource model is captured to the core in this paper. This model extends a mathematical treatment to the concepts of 'workload' and 'delay', proposes a pseudo code for reservation of multi-resources and describes the necessaries of compound sessions and its parameters. This paper not only converges on performance but also focuses on CM-resource model's support to various communication topologies","PeriodicalId":293442,"journal":{"name":"The 7th International Conference on Advanced Communication Technology, 2005, ICACT 2005.","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127533162","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 : 2005-07-11DOI: 10.1109/ICACT.2005.246203
Yoon-Sik Yoo, S. Lim, J. Huh
This paper describes that we propose context-aware computing based model in ubiquitous computing's subset for refreshing of human's sleep and examine technological possibility. Human can do fatigue recovery and growth through sleep and we propose methodology with model form in more effective and most suitable context for refreshing sleep in this paper.
{"title":"Modeling of refreshing sleep aid service based on ubiquitous computing","authors":"Yoon-Sik Yoo, S. Lim, J. Huh","doi":"10.1109/ICACT.2005.246203","DOIUrl":"https://doi.org/10.1109/ICACT.2005.246203","url":null,"abstract":"This paper describes that we propose context-aware computing based model in ubiquitous computing's subset for refreshing of human's sleep and examine technological possibility. Human can do fatigue recovery and growth through sleep and we propose methodology with model form in more effective and most suitable context for refreshing sleep in this paper.","PeriodicalId":293442,"journal":{"name":"The 7th International Conference on Advanced Communication Technology, 2005, ICACT 2005.","volume":"16 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126047263","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 : 2005-07-11DOI: 10.1109/ICACT.2005.245853
SeoungYoung Lee, In-Yong Hwang, Hong-shik Park
In optical burst switching (OBS) networks, class differentiation is achieved by assigning an adequately long offset time between a burst control packet (BCP) and a data burst (DB). Blocking probability is one of the main performance measures in OBS networks. Though the effects of length distribution of low-class burst and the ratio of arrival rates of low-class and high-class on high-class blocking probability have been studied, there has been no examination of the effects of the length of low-class on burst blocking probability. In this paper, we analyze loss performance of OBS network by examining the burst size of low-class bursts. When we vary the burst size of low-class burst from large to small, the evaluation results show that while the high-class blocking probability remains same, the low-class blocking probability decreases significantly. These results imply that it is important for OBS network designers to take into account the burst size of low-class to improve system performance in OBS networks
{"title":"The influence of burst length in optical burst switching system with completely isolated classes","authors":"SeoungYoung Lee, In-Yong Hwang, Hong-shik Park","doi":"10.1109/ICACT.2005.245853","DOIUrl":"https://doi.org/10.1109/ICACT.2005.245853","url":null,"abstract":"In optical burst switching (OBS) networks, class differentiation is achieved by assigning an adequately long offset time between a burst control packet (BCP) and a data burst (DB). Blocking probability is one of the main performance measures in OBS networks. Though the effects of length distribution of low-class burst and the ratio of arrival rates of low-class and high-class on high-class blocking probability have been studied, there has been no examination of the effects of the length of low-class on burst blocking probability. In this paper, we analyze loss performance of OBS network by examining the burst size of low-class bursts. When we vary the burst size of low-class burst from large to small, the evaluation results show that while the high-class blocking probability remains same, the low-class blocking probability decreases significantly. These results imply that it is important for OBS network designers to take into account the burst size of low-class to improve system performance in OBS networks","PeriodicalId":293442,"journal":{"name":"The 7th International Conference on Advanced Communication Technology, 2005, ICACT 2005.","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123284578","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 : 2005-07-11DOI: 10.1109/ICACT.2005.246210
Youngok Jung, Hag-Young Kim, Myoung-Joon Kim
In the environment of the streaming of high bit-rate contents, the performance degradation of a streaming server may be caused by too frequent accesses to the disk and too many copies of streamed data in the system, that lead the exhaustion of the disk bandwidth resource and CPU resource. The new hardware called by network storage (NS) card which is developed by Internet Server Group, ETRI for streaming high-bit rate contents provides the function of high-speed disk access with large block size and delivery of disk-stored stream data through the network with a so-called zero-copy method. In this paper, we introduce the NS card and propose the corresponding streaming service framework. The streaming service framework takes care of up to 4 NS cards and is designed and implemented to support the maximum throughput. The evaluation result shows much better performance in comparison with other streaming systems
在高比特率内容流环境下，由于对磁盘的访问过于频繁，系统中流数据副本过多，导致磁盘带宽资源和CPU资源耗尽，可能会导致流服务器的性能下降。ETRI Internet Server Group开发的用于流式传输高比特率内容的新型硬件——网络存储(NS)卡，提供了高速访问大块大小的磁盘的功能，并以所谓的零拷贝方式通过网络传输磁盘存储的流数据。本文介绍了NS卡，并提出了相应的流媒体服务框架。流媒体服务框架最多可支持4张NS卡，其设计和实现旨在支持最大吞吐量。评估结果表明，与其他流系统相比，该系统的性能要好得多
{"title":"Streaming service framework based on high-performance hardware for high bit-rate contents","authors":"Youngok Jung, Hag-Young Kim, Myoung-Joon Kim","doi":"10.1109/ICACT.2005.246210","DOIUrl":"https://doi.org/10.1109/ICACT.2005.246210","url":null,"abstract":"In the environment of the streaming of high bit-rate contents, the performance degradation of a streaming server may be caused by too frequent accesses to the disk and too many copies of streamed data in the system, that lead the exhaustion of the disk bandwidth resource and CPU resource. The new hardware called by network storage (NS) card which is developed by Internet Server Group, ETRI for streaming high-bit rate contents provides the function of high-speed disk access with large block size and delivery of disk-stored stream data through the network with a so-called zero-copy method. In this paper, we introduce the NS card and propose the corresponding streaming service framework. The streaming service framework takes care of up to 4 NS cards and is designed and implemented to support the maximum throughput. The evaluation result shows much better performance in comparison with other streaming systems","PeriodicalId":293442,"journal":{"name":"The 7th International Conference on Advanced Communication Technology, 2005, ICACT 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123329914","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 : 2005-07-11DOI: 10.1109/ICACT.2005.245824
D. Athanasios, K. Grigorios
Signal-to-noise ratio (SNR) is a crucial parameter in receiving systems to improve their performance. In this paper, two SNR estimators, the squared signal-to-noise variance estimator and the iterative SNR estimator, originally proposed for single carrier systems, are properly modified and applied to an OFDM transceiver complying with the physical layer of HiperLAN/2. We compare their performance in additive white Gaussian noise (AWGN) channel. Simulations showed that for both algorithms SNR estimation accuracy can be accomplished in low SNR values. The impact of the channel estimation method used to improve signal's reception, on the SNR estimation accuracy is examined. Finally the number of iterations that is needed for the second algorithm to converge to the actual SNR is estimated from simulations
{"title":"BPSK SNR estimation algorithms for HiperLAN/2 transceiver in AWGN channel","authors":"D. Athanasios, K. Grigorios","doi":"10.1109/ICACT.2005.245824","DOIUrl":"https://doi.org/10.1109/ICACT.2005.245824","url":null,"abstract":"Signal-to-noise ratio (SNR) is a crucial parameter in receiving systems to improve their performance. In this paper, two SNR estimators, the squared signal-to-noise variance estimator and the iterative SNR estimator, originally proposed for single carrier systems, are properly modified and applied to an OFDM transceiver complying with the physical layer of HiperLAN/2. We compare their performance in additive white Gaussian noise (AWGN) channel. Simulations showed that for both algorithms SNR estimation accuracy can be accomplished in low SNR values. The impact of the channel estimation method used to improve signal's reception, on the SNR estimation accuracy is examined. Finally the number of iterations that is needed for the second algorithm to converge to the actual SNR is estimated from simulations","PeriodicalId":293442,"journal":{"name":"The 7th International Conference on Advanced Communication Technology, 2005, ICACT 2005.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122293878","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 : 2005-07-11DOI: 10.1109/ICACT.2005.246177
Jeongyun Kim, Sangki Kim, Byungsun Lee, Junkyun Choi
Recently, 3GPP introduced IMS-specific QoS mechanisms and service-based local policy control to support QoS-enabled services including VoIP. The IMS architecture is evolving to a more generic QoS and policy framework to simplify the introduction of new services and to implement service-based control of the access for a whole range of services. In this paper, we proposed the QoS control API for 3 party service provider to demand the required bandwidth onto network operators policy server. Also, QoS control scenario is described to support the video on demand service
{"title":"Policy-based QoS control for open services in BcN","authors":"Jeongyun Kim, Sangki Kim, Byungsun Lee, Junkyun Choi","doi":"10.1109/ICACT.2005.246177","DOIUrl":"https://doi.org/10.1109/ICACT.2005.246177","url":null,"abstract":"Recently, 3GPP introduced IMS-specific QoS mechanisms and service-based local policy control to support QoS-enabled services including VoIP. The IMS architecture is evolving to a more generic QoS and policy framework to simplify the introduction of new services and to implement service-based control of the access for a whole range of services. In this paper, we proposed the QoS control API for 3 party service provider to demand the required bandwidth onto network operators policy server. Also, QoS control scenario is described to support the video on demand service","PeriodicalId":293442,"journal":{"name":"The 7th International Conference on Advanced Communication Technology, 2005, ICACT 2005.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114419544","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 : 2005-07-11DOI: 10.1109/ICACT.2005.246112
M. Paakkonen
The capability of multiprotocol label switching (MPLS) of explicit routing as well as of transferring the traffic flows on several, possible equal cost, paths allows load balancing scheme. Exploiting this capability of MPLS, a revenue aware load balancing mechanism is proposed in this paper. The main goal of this proposal is to maximize total network revenue so that quality of service (QoS) requirements of different service classes are fulfilled. The performance of the load balancing algorithm is evaluated by using NS-2 simulator. Simulation results are provided to illustrate the operation of the load balancing algorithm. In addition, the performance of proposed algorithm is compared with the performance of representative dynamic load distribution approaches
{"title":"Providing QoS guarantees by load balancing in MPLS networks","authors":"M. Paakkonen","doi":"10.1109/ICACT.2005.246112","DOIUrl":"https://doi.org/10.1109/ICACT.2005.246112","url":null,"abstract":"The capability of multiprotocol label switching (MPLS) of explicit routing as well as of transferring the traffic flows on several, possible equal cost, paths allows load balancing scheme. Exploiting this capability of MPLS, a revenue aware load balancing mechanism is proposed in this paper. The main goal of this proposal is to maximize total network revenue so that quality of service (QoS) requirements of different service classes are fulfilled. The performance of the load balancing algorithm is evaluated by using NS-2 simulator. Simulation results are provided to illustrate the operation of the load balancing algorithm. In addition, the performance of proposed algorithm is compared with the performance of representative dynamic load distribution approaches","PeriodicalId":293442,"journal":{"name":"The 7th International Conference on Advanced Communication Technology, 2005, ICACT 2005.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122174219","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 : 2005-07-11DOI: 10.1109/ICACT.2005.245891
M. Ida, T. Nozawa, F. Yoshikane, K. Miyazaki, H. Kita
In this paper analyzing a structure of higher education information, we propose syllabus XML database, Web services on education information, and curriculum analyzing system based on advanced communication technology.
{"title":"Syllabus database and Web service on higher education","authors":"M. Ida, T. Nozawa, F. Yoshikane, K. Miyazaki, H. Kita","doi":"10.1109/ICACT.2005.245891","DOIUrl":"https://doi.org/10.1109/ICACT.2005.245891","url":null,"abstract":"In this paper analyzing a structure of higher education information, we propose syllabus XML database, Web services on education information, and curriculum analyzing system based on advanced communication technology.","PeriodicalId":293442,"journal":{"name":"The 7th International Conference on Advanced Communication Technology, 2005, ICACT 2005.","volume":"230 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117003181","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 : 2005-07-11DOI: 10.1109/ICACT.2005.246155
R. Glasberg, K. Elazouzi, T. Sikora
We present a new approach for classifying MPEG-video sequences as `cartoon' or `noncartoon' by analyzing specific color, texture and motion features of consecutive frames in real-time. This is part of the well-known video-genre-classification problem, where popular TV-broadcast genres like cartoon, commercial, music, news and sports are studied. Such applications have also been discussed in the context of MPEG-7 [T. Sikora et al. (2002)]. In our method the extracted features from the visual descriptors are nonlinear weighted with a sigmoid-function and afterwards combined using a multilayered perceptron to produce a reliable recognition. The results demonstrate a high identification rate based on a large collection of 100 representative video sequences (20 cartoons and 4*20 noncartoons) gathered from free digital TV-broadcasting
通过实时分析连续帧的特定颜色、纹理和运动特征，提出了一种将mpeg视频序列分类为“卡通”或“非卡通”的新方法。这是众所周知的视频类型分类问题的一部分，该问题研究了流行的电视广播类型，如卡通、商业、音乐、新闻和体育。这些应用也在MPEG-7 [T]的背景下进行了讨论。Sikora et al.(2002)。在我们的方法中，从视觉描述符中提取的特征用s型函数进行非线性加权，然后使用多层感知器进行组合以产生可靠的识别。结果表明，基于从免费数字电视广播中收集的100个代表性视频序列(20个动画片和4*20个非动画片)的大量集合，具有很高的识别率
{"title":"Video-genre-classification: recognizing cartoons in real-time using visual-descriptors and a multilayer-percetpron","authors":"R. Glasberg, K. Elazouzi, T. Sikora","doi":"10.1109/ICACT.2005.246155","DOIUrl":"https://doi.org/10.1109/ICACT.2005.246155","url":null,"abstract":"We present a new approach for classifying MPEG-video sequences as `cartoon' or `noncartoon' by analyzing specific color, texture and motion features of consecutive frames in real-time. This is part of the well-known video-genre-classification problem, where popular TV-broadcast genres like cartoon, commercial, music, news and sports are studied. Such applications have also been discussed in the context of MPEG-7 [T. Sikora et al. (2002)]. In our method the extracted features from the visual descriptors are nonlinear weighted with a sigmoid-function and afterwards combined using a multilayered perceptron to produce a reliable recognition. The results demonstrate a high identification rate based on a large collection of 100 representative video sequences (20 cartoons and 4*20 noncartoons) gathered from free digital TV-broadcasting","PeriodicalId":293442,"journal":{"name":"The 7th International Conference on Advanced Communication Technology, 2005, ICACT 2005.","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129415108","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
扫码关注我们
求助内容：
应助结果提醒方式：