Pub Date : 2009-10-08DOI: 10.1109/APCC.2009.5375568
Sugang Xu, W. Ren, H. Harai
In this paper we address the optical grid network (OGN) construction issues in a large-scale multi-domain wavelength switched optical network (WSON). Based upon user's needs for high-performance distributed computation, a group of lightpaths are established dynamically among the distributed computer resources forming an on-demand application-oriented communication environment. We propose an optical grid network infrastructure (OGNI) to construct OGNs automatically in a distributed fashion providing an integrated and self-contained grid service to users. We present a possible design and validate this design through experiments on a developed OGNI prototype and a WSON test-bed network.
{"title":"A P2P-style on-demand optical grid network construction over multi-domain WSONs","authors":"Sugang Xu, W. Ren, H. Harai","doi":"10.1109/APCC.2009.5375568","DOIUrl":"https://doi.org/10.1109/APCC.2009.5375568","url":null,"abstract":"In this paper we address the optical grid network (OGN) construction issues in a large-scale multi-domain wavelength switched optical network (WSON). Based upon user's needs for high-performance distributed computation, a group of lightpaths are established dynamically among the distributed computer resources forming an on-demand application-oriented communication environment. We propose an optical grid network infrastructure (OGNI) to construct OGNs automatically in a distributed fashion providing an integrated and self-contained grid service to users. We present a possible design and validate this design through experiments on a developed OGNI prototype and a WSON test-bed network.","PeriodicalId":217893,"journal":{"name":"2009 15th Asia-Pacific Conference on Communications","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133757390","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-10-08DOI: 10.1109/APCC.2009.5375495
Jiaqing Huang, Liang Wang, Tiyuan Zhang, Hui Li
Network coding in cyclic networks may have better performance than network coding in acyclic networks with regard to the multi-unicast scenarios. Harvey et al. showed that network coding in cyclic networks can be strictly better than fractional routing in conservative networks which have widely practical scenarios such as P2P networks. Hence, we motivated investigating how to achieve that better performance of network coding in cyclic networks by a general construction algorithm. Li et al. presented there are four levels for network code in cyclic networks, including Basic Convolutional Network Code(BCNC), Convolutional Dispersion(CD), Convolutional Broadcast(CB) and Convolutional Multicast(CM). Subsequently, it is interesting to investigate how to construct all four levels of network coding in cyclic networks. Based on our previous work of construction algorithm of BCNC, we proposed a unified algorithm to construct network coding in cyclic networks using notion of flow set. Our contributions were as follows:(1)we showed insights of the essential difference between two classes(i.e. BCNC and CD/CB/CM) of network codes in cyclic networks. (2)we showed insights how to uniformly handle cycles for these two classes of network codes in cyclic networks by proposing the unified construction algorithm. Here, we used the cycles classifications defined by Barbero et al., including link cycles but flow-acyclic, simple flow cycles and flow knots(simply knots).
{"title":"Unified construction algorithm of network coding in cyclic networks","authors":"Jiaqing Huang, Liang Wang, Tiyuan Zhang, Hui Li","doi":"10.1109/APCC.2009.5375495","DOIUrl":"https://doi.org/10.1109/APCC.2009.5375495","url":null,"abstract":"Network coding in cyclic networks may have better performance than network coding in acyclic networks with regard to the multi-unicast scenarios. Harvey et al. showed that network coding in cyclic networks can be strictly better than fractional routing in conservative networks which have widely practical scenarios such as P2P networks. Hence, we motivated investigating how to achieve that better performance of network coding in cyclic networks by a general construction algorithm. Li et al. presented there are four levels for network code in cyclic networks, including Basic Convolutional Network Code(BCNC), Convolutional Dispersion(CD), Convolutional Broadcast(CB) and Convolutional Multicast(CM). Subsequently, it is interesting to investigate how to construct all four levels of network coding in cyclic networks. Based on our previous work of construction algorithm of BCNC, we proposed a unified algorithm to construct network coding in cyclic networks using notion of flow set. Our contributions were as follows:(1)we showed insights of the essential difference between two classes(i.e. BCNC and CD/CB/CM) of network codes in cyclic networks. (2)we showed insights how to uniformly handle cycles for these two classes of network codes in cyclic networks by proposing the unified construction algorithm. Here, we used the cycles classifications defined by Barbero et al., including link cycles but flow-acyclic, simple flow cycles and flow knots(simply knots).","PeriodicalId":217893,"journal":{"name":"2009 15th Asia-Pacific Conference on Communications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114237439","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-10-08DOI: 10.1109/APCC.2009.5375570
H. Imaizumi, Li Hui, K. Watabe, Takuo Tanemura, Y. Nakano, H. Morikawa
This paper presents a novel Hybrid Optical neTwork ARchitecUre concept named HOTARU which combines multi-wavelength optical packet switching (MW-OPS) and optical circuit switching (OCS) in WDM networks; herein, we also experimentally demonstrate its feasibility in a 400 Gbps network testbed.
{"title":"HOTARU: A novel concept of hybrid optical network architecture combining multi-wavelength packet and circuit switching","authors":"H. Imaizumi, Li Hui, K. Watabe, Takuo Tanemura, Y. Nakano, H. Morikawa","doi":"10.1109/APCC.2009.5375570","DOIUrl":"https://doi.org/10.1109/APCC.2009.5375570","url":null,"abstract":"This paper presents a novel Hybrid Optical neTwork ARchitecUre concept named HOTARU which combines multi-wavelength optical packet switching (MW-OPS) and optical circuit switching (OCS) in WDM networks; herein, we also experimentally demonstrate its feasibility in a 400 Gbps network testbed.","PeriodicalId":217893,"journal":{"name":"2009 15th Asia-Pacific Conference on Communications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114751031","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-10-08DOI: 10.1109/APCC.2009.5375638
Hyoungjoo Lee, Illsoo Sohn, K. Lee
In this paper, a practical downlink multiuser multiple-input multiple-output (MU-MIMO) scheme with low-rate feedback channel is considered. Firstly, we propose a preferred-beam feedback method, which effectively conveys information of user channel and inter-user interference. Secondly, we propose a new low-complexity method to compute unitary preprocessing matrix based on the feedback method. The proposed method reduces considerably computational complexity by utilizing SVD operation compared to the conventional unitary preprocessing scheme. Finally, for the case that the number of users exceeds the number of transmit antennas, we provide two simple user selection algorithms to exploit multiuser diversity. Numerical results show that the proposed low-complexity unitary preprocessing scheme achieves higher sum-rate than previous linear preprocessing schemes, especially at low SNR or with small number of active users.
{"title":"Low-complexity unitary preprocessing scheme for limited feedback multiuser MIMO systems","authors":"Hyoungjoo Lee, Illsoo Sohn, K. Lee","doi":"10.1109/APCC.2009.5375638","DOIUrl":"https://doi.org/10.1109/APCC.2009.5375638","url":null,"abstract":"In this paper, a practical downlink multiuser multiple-input multiple-output (MU-MIMO) scheme with low-rate feedback channel is considered. Firstly, we propose a preferred-beam feedback method, which effectively conveys information of user channel and inter-user interference. Secondly, we propose a new low-complexity method to compute unitary preprocessing matrix based on the feedback method. The proposed method reduces considerably computational complexity by utilizing SVD operation compared to the conventional unitary preprocessing scheme. Finally, for the case that the number of users exceeds the number of transmit antennas, we provide two simple user selection algorithms to exploit multiuser diversity. Numerical results show that the proposed low-complexity unitary preprocessing scheme achieves higher sum-rate than previous linear preprocessing schemes, especially at low SNR or with small number of active users.","PeriodicalId":217893,"journal":{"name":"2009 15th Asia-Pacific Conference on Communications","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116322930","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-10-08DOI: 10.1109/apcc.2009.5375667
M. Silva, R. Dinis, A. Correia
We consider block transmission techniques combined with rate-1 space time block coding (STBC) for two or four transmit antennas. Since our STBC with 4 transmit antennas is not orthogonal, our receiver includes the cancellation of the residual interference, allowing performances close to the ones of an orthogonal code. We propose an iterative STBC receiver with joint detection and channel estimation. Our performance results show that the proposed single channel - frequency domain equalization (SC-FDE) STBC receiver allows excellent performance with the use of channel data obtained from channel estimation.
{"title":"Joint detection and channel estimation for SC-FDE with STBC","authors":"M. Silva, R. Dinis, A. Correia","doi":"10.1109/apcc.2009.5375667","DOIUrl":"https://doi.org/10.1109/apcc.2009.5375667","url":null,"abstract":"We consider block transmission techniques combined with rate-1 space time block coding (STBC) for two or four transmit antennas. Since our STBC with 4 transmit antennas is not orthogonal, our receiver includes the cancellation of the residual interference, allowing performances close to the ones of an orthogonal code. We propose an iterative STBC receiver with joint detection and channel estimation. Our performance results show that the proposed single channel - frequency domain equalization (SC-FDE) STBC receiver allows excellent performance with the use of channel data obtained from channel estimation.","PeriodicalId":217893,"journal":{"name":"2009 15th Asia-Pacific Conference on Communications","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116354504","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-10-08DOI: 10.1109/APCC.2009.5375666
Z. Wang, L. Mao
The downlink signal in Time Division Synchronous CDMA (TD-SCDMA) system typically has high peak to average power ratio (PAR) due to the multi-code nature of the system. In order to accommodate high peaks, power amplifier (PA) has to operate with considerable back-off, which leads to low operating efficiency. By means of various crest factor reduction (CFR) techniques, the PAR of the transmitted signal can be reduced to a level so as to achieve an efficient utilization of PA. Based on the analyses of this paper, an optimized CFR processor is proposed aiming to provide a more efficient PA while keeping the distortion of the downlink signal to a minimum. This solution has been verified with FPGA implementation and is proved to be of high performance in the TD-SCDMA transmission system.
{"title":"High efficiency crest factor reduction for downlink TD-SCDMA system","authors":"Z. Wang, L. Mao","doi":"10.1109/APCC.2009.5375666","DOIUrl":"https://doi.org/10.1109/APCC.2009.5375666","url":null,"abstract":"The downlink signal in Time Division Synchronous CDMA (TD-SCDMA) system typically has high peak to average power ratio (PAR) due to the multi-code nature of the system. In order to accommodate high peaks, power amplifier (PA) has to operate with considerable back-off, which leads to low operating efficiency. By means of various crest factor reduction (CFR) techniques, the PAR of the transmitted signal can be reduced to a level so as to achieve an efficient utilization of PA. Based on the analyses of this paper, an optimized CFR processor is proposed aiming to provide a more efficient PA while keeping the distortion of the downlink signal to a minimum. This solution has been verified with FPGA implementation and is proved to be of high performance in the TD-SCDMA transmission system.","PeriodicalId":217893,"journal":{"name":"2009 15th Asia-Pacific Conference on Communications","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116355516","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-10-08DOI: 10.1109/APCC.2009.5375592
Guijin Tang, Xiuchang Zhu
Error concealment can be regarded as a sort of error resilient coding techniques. This paper proposes a method to recover lost blocks in stereoscopic images. We first utilize the correlation to perform disparity estimation to match the corresponding blocks for lost ones. And then we calculate the boundary smooth degree (BSD) for each recovered block. If BSD exceeds the threshold, it means that the boundary is discontinuous which mainly results from high detailed blocks, edge blocks or occluded blocks. So we consider neighboring blocks' BSD and estimate the content of a lost block, and adaptively use different methods to conceal it. Experimental results show that the proposed algorithm can greatly improve the subjective and objective quality of the reconstructed image.
{"title":"Error concealment for stereoscopic images using boundary smooth degree","authors":"Guijin Tang, Xiuchang Zhu","doi":"10.1109/APCC.2009.5375592","DOIUrl":"https://doi.org/10.1109/APCC.2009.5375592","url":null,"abstract":"Error concealment can be regarded as a sort of error resilient coding techniques. This paper proposes a method to recover lost blocks in stereoscopic images. We first utilize the correlation to perform disparity estimation to match the corresponding blocks for lost ones. And then we calculate the boundary smooth degree (BSD) for each recovered block. If BSD exceeds the threshold, it means that the boundary is discontinuous which mainly results from high detailed blocks, edge blocks or occluded blocks. So we consider neighboring blocks' BSD and estimate the content of a lost block, and adaptively use different methods to conceal it. Experimental results show that the proposed algorithm can greatly improve the subjective and objective quality of the reconstructed image.","PeriodicalId":217893,"journal":{"name":"2009 15th Asia-Pacific Conference on Communications","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125968867","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-10-08DOI: 10.1109/APCC.2009.5375594
Jianguo Yan, J. Ping, Qian Huang, Jianfeng Cao
In this paper we presented results assessing the role of space VLBI tracking data for precision orbit determination (POD) for Chang'E-1 and corresponding lunar gravity field solution based on tracking data of Chang'E-1, China's first lunar exploration mission. The POD of the lunar orbit segment of Chang'E-1 was performed using S-band two-way Range and Range Rate (R&RR) data, together with VLBI delay and delay rate data. The role of VLBI data in the POD of Chang'E-1 had been analyzed, and the orbit accuracy was given with different orbit solution strategies. We concluded that the VLBI tracking data contributed significantly to the Chang'E-1 POD. Based on POD of Chang'E-1, the lunar gravity field solution CEGM based on six months tracking data was presented, the accuracy of the model was assessed by gravity field power spectrum and admittance/coherence between gravity and topography, the result showed that CEGM had significant improvement than a prior model GLGM-2.
{"title":"Chang'E-1 precision orbit determination and lunar gravity field solution","authors":"Jianguo Yan, J. Ping, Qian Huang, Jianfeng Cao","doi":"10.1109/APCC.2009.5375594","DOIUrl":"https://doi.org/10.1109/APCC.2009.5375594","url":null,"abstract":"In this paper we presented results assessing the role of space VLBI tracking data for precision orbit determination (POD) for Chang'E-1 and corresponding lunar gravity field solution based on tracking data of Chang'E-1, China's first lunar exploration mission. The POD of the lunar orbit segment of Chang'E-1 was performed using S-band two-way Range and Range Rate (R&RR) data, together with VLBI delay and delay rate data. The role of VLBI data in the POD of Chang'E-1 had been analyzed, and the orbit accuracy was given with different orbit solution strategies. We concluded that the VLBI tracking data contributed significantly to the Chang'E-1 POD. Based on POD of Chang'E-1, the lunar gravity field solution CEGM based on six months tracking data was presented, the accuracy of the model was assessed by gravity field power spectrum and admittance/coherence between gravity and topography, the result showed that CEGM had significant improvement than a prior model GLGM-2.","PeriodicalId":217893,"journal":{"name":"2009 15th Asia-Pacific Conference on Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126102970","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-10-08DOI: 10.1109/APCC.2009.5375683
Lei Wang, B. Zheng, Jingwu Cui, Feng Tian
Based on free probability theory, a new scheme for frequency band sensing of spreading communication system is proposed. Unlike previous studies in the field, the new scheme does not require the knowledge of the spreading sequences of users and is related to the asymptotic free behavior of random matrices. Simulation result shows that the convergence characteristic holds true even for a small number of observations, which makes the new scheme well suited for realistic time-varing scenario. The sensing performance of new scheme is also much better than that of classical energy detection scheme.
{"title":"Spectrum sensing for spreading communication system based on free probability theory","authors":"Lei Wang, B. Zheng, Jingwu Cui, Feng Tian","doi":"10.1109/APCC.2009.5375683","DOIUrl":"https://doi.org/10.1109/APCC.2009.5375683","url":null,"abstract":"Based on free probability theory, a new scheme for frequency band sensing of spreading communication system is proposed. Unlike previous studies in the field, the new scheme does not require the knowledge of the spreading sequences of users and is related to the asymptotic free behavior of random matrices. Simulation result shows that the convergence characteristic holds true even for a small number of observations, which makes the new scheme well suited for realistic time-varing scenario. The sensing performance of new scheme is also much better than that of classical energy detection scheme.","PeriodicalId":217893,"journal":{"name":"2009 15th Asia-Pacific Conference on Communications","volume":"42 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123511339","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-10-08DOI: 10.1109/APCC.2009.5375463
Wenyu Shen, A. Tsutsui, Y. Tsukishima, H. Hadama
With the wide proliferation of high-performance Information and Communication Technology (ICT) devices, power consumption in the networking field has become a paramount issue. This paper focuses on data transmission between two end hosts and proposes a novel implementation model from the viewpoint of power efficiency during data transmission. Through inter-component coordination and traffic-driven control of power-efficient components, significant power saving is anticipated without any influence on the data transmission throughput. Experimental results verify the feasibility of the implementation model, and show that by using this implementation model, more power can be saved than in traditional approaches, which are based solely on individual components.
{"title":"Implementation model for end hosts to achieve power-efficient data transmission","authors":"Wenyu Shen, A. Tsutsui, Y. Tsukishima, H. Hadama","doi":"10.1109/APCC.2009.5375463","DOIUrl":"https://doi.org/10.1109/APCC.2009.5375463","url":null,"abstract":"With the wide proliferation of high-performance Information and Communication Technology (ICT) devices, power consumption in the networking field has become a paramount issue. This paper focuses on data transmission between two end hosts and proposes a novel implementation model from the viewpoint of power efficiency during data transmission. Through inter-component coordination and traffic-driven control of power-efficient components, significant power saving is anticipated without any influence on the data transmission throughput. Experimental results verify the feasibility of the implementation model, and show that by using this implementation model, more power can be saved than in traditional approaches, which are based solely on individual components.","PeriodicalId":217893,"journal":{"name":"2009 15th Asia-Pacific Conference on Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129726301","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
扫码关注我们
求助内容：
应助结果提醒方式：