Pub Date : 2009-10-08DOI: 10.1109/APCC.2009.5375552
Xiaoyan Wang, M. Hanawa, Kazuhiko Nakamura, K. Takano, K. Nakagawa
A novel all optical single side-band signal generation filter using optically phase shift scheme with fiber Bragg grating based 4-taps optical Hilbert transformer is experimentally demonstrated. The sideband suppression ratio above 10 dB shows the feasibility of the optically phase-shifted SSB scheme which is applicable for high-speed transmission with bandwidth efficiency.
{"title":"Sideband suppression characteristics of optical SSB generation filter with sampled FBG based 4-taps optical Hilbert transformer","authors":"Xiaoyan Wang, M. Hanawa, Kazuhiko Nakamura, K. Takano, K. Nakagawa","doi":"10.1109/APCC.2009.5375552","DOIUrl":"https://doi.org/10.1109/APCC.2009.5375552","url":null,"abstract":"A novel all optical single side-band signal generation filter using optically phase shift scheme with fiber Bragg grating based 4-taps optical Hilbert transformer is experimentally demonstrated. The sideband suppression ratio above 10 dB shows the feasibility of the optically phase-shifted SSB scheme which is applicable for high-speed transmission with bandwidth efficiency.","PeriodicalId":217893,"journal":{"name":"2009 15th Asia-Pacific Conference on Communications","volume":"41 10 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":"129669359","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.5375603
Yu‐Lin Wang, M. Her, Hsin-Hung Lin
The aim of this paper to probe into the low power voltage amplifier which can achieve the high gain and fine flatness. The high gain Low Noise Amplifier (LNA) was designed for an Ultra Wide-Band (UWB) application. This CMOS LNA with three cascade circuits can enhance the gain and bandwidth, middle inductor can suppress the miller effect, and used the RC feedback network to maintain the flatness. Input matching stage adopts an improved Chebyshev filter to achieve the input return loss and the source follower applied to the output matching. The UWB LNA exhibits the maximum gain S21 is 17.74 dB. The power consumption is 13.08 mW at VDD=1 V.
{"title":"Design and implementation of LNA with high gain and low power consumption for UWB system","authors":"Yu‐Lin Wang, M. Her, Hsin-Hung Lin","doi":"10.1109/APCC.2009.5375603","DOIUrl":"https://doi.org/10.1109/APCC.2009.5375603","url":null,"abstract":"The aim of this paper to probe into the low power voltage amplifier which can achieve the high gain and fine flatness. The high gain Low Noise Amplifier (LNA) was designed for an Ultra Wide-Band (UWB) application. This CMOS LNA with three cascade circuits can enhance the gain and bandwidth, middle inductor can suppress the miller effect, and used the RC feedback network to maintain the flatness. Input matching stage adopts an improved Chebyshev filter to achieve the input return loss and the source follower applied to the output matching. The UWB LNA exhibits the maximum gain S21 is 17.74 dB. The power consumption is 13.08 mW at VDD=1 V.","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":"129672775","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.5375611
Pengfei Sun, Li X. Zhang
For the uplink transmission of an orthogonal frequency division multiple access (OFDMA) system, frequency synchronizaion is particularly challenging due to the presence of multiple Carrier Frequency Offsets (CFOs), which destroy the orthogonality among subcarriers and introduce massive multiuser interference (MUI) and inter-carrier interference (ICI). To prevent the consequent performance degradation, CFOs must be accurately estimated and properly corrected to cancel the interference. Among all the proposed interference cancelation solutions for OFDMA uplink, the best performance is achieved by an algorithm proposed in [1], which is however prohibitively complex. A banded matrix approximation was proposed in the same paper to reduce the complexity, however, at the cost of performance degradation. In this paper, a decision aided interative interference cancelation algorithm is proposed based on the banded matrix, which exploits the detected signal to interatively reconstruct and eliminate the residual interference incurred by the banded system. The simulation results show that the interative algorithm could entirely overcome the performance degradation and achieve the best performance. At the same time, it significantly reduces the computational complexity required by the interference cancelation.
{"title":"Low complexity iterative interference cancelation for OFDMA uplnik with carrier frequency offsets","authors":"Pengfei Sun, Li X. Zhang","doi":"10.1109/APCC.2009.5375611","DOIUrl":"https://doi.org/10.1109/APCC.2009.5375611","url":null,"abstract":"For the uplink transmission of an orthogonal frequency division multiple access (OFDMA) system, frequency synchronizaion is particularly challenging due to the presence of multiple Carrier Frequency Offsets (CFOs), which destroy the orthogonality among subcarriers and introduce massive multiuser interference (MUI) and inter-carrier interference (ICI). To prevent the consequent performance degradation, CFOs must be accurately estimated and properly corrected to cancel the interference. Among all the proposed interference cancelation solutions for OFDMA uplink, the best performance is achieved by an algorithm proposed in [1], which is however prohibitively complex. A banded matrix approximation was proposed in the same paper to reduce the complexity, however, at the cost of performance degradation. In this paper, a decision aided interative interference cancelation algorithm is proposed based on the banded matrix, which exploits the detected signal to interatively reconstruct and eliminate the residual interference incurred by the banded system. The simulation results show that the interative algorithm could entirely overcome the performance degradation and achieve the best performance. At the same time, it significantly reduces the computational complexity required by the interference cancelation.","PeriodicalId":217893,"journal":{"name":"2009 15th Asia-Pacific Conference on Communications","volume":"9 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":"130141000","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.5375643
Tingting Xu, Zhen Yang, Xi Shao
Compressed Sensing (CS) is an emerging signal acquisition theory that provides a universal approach for characterizing signals which are sparse or compressible on some basis at sub-Nyquist sampling rate. This paper focuses on the realization of CS on natural speech signals. We construct an over-complete data-driven dictionary as the sparse basis specialized for speech signals. Based on this, CS sampling and reconstruction of speech signal are realized. Furthermore, we propose to choose the sensing matrix adaptively, according to the energy distribution of original speech signal. Experimental results show significant improvement of speech reconstruction quality by using such adaptive approach against using traditional random sensing matrix.
{"title":"Adaptive compressed sensing of speech signal based on data-driven dictionary","authors":"Tingting Xu, Zhen Yang, Xi Shao","doi":"10.1109/APCC.2009.5375643","DOIUrl":"https://doi.org/10.1109/APCC.2009.5375643","url":null,"abstract":"Compressed Sensing (CS) is an emerging signal acquisition theory that provides a universal approach for characterizing signals which are sparse or compressible on some basis at sub-Nyquist sampling rate. This paper focuses on the realization of CS on natural speech signals. We construct an over-complete data-driven dictionary as the sparse basis specialized for speech signals. Based on this, CS sampling and reconstruction of speech signal are realized. Furthermore, we propose to choose the sensing matrix adaptively, according to the energy distribution of original speech signal. Experimental results show significant improvement of speech reconstruction quality by using such adaptive approach against using traditional random sensing matrix.","PeriodicalId":217893,"journal":{"name":"2009 15th Asia-Pacific Conference on Communications","volume":"46 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":"127839002","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.5375639
Qi Zhang, Ju Liu, Peng Lan, Lei Chen
The downlink of multi-user multiple-input single-output (MU-MISO) wireless system with ERB (equal rate and BER) precoding scheme is considered in this paper, where the base station is equipped with multiple antennas and each mobile user is constrained to a single antenna. Since the number of users supported by the BS is limited by the number of transmit RF chains, the system should exploit user scheduling scheme for user selection. In this paper, we focus on transmit antenna and user selection scheme simultaneously in a MU-MISO system. Because exhaustive search is computationally prohibitive, we propose a suboptimal algorithm for transmit antenna and user subset selection. Then its simplified version with lower complexity is described. The simulation results show the performance of the proposed algorithms is almost the same as the optimal one.
{"title":"Antenna and user subset selection in downlink multi-user equal rate and BER systems","authors":"Qi Zhang, Ju Liu, Peng Lan, Lei Chen","doi":"10.1109/APCC.2009.5375639","DOIUrl":"https://doi.org/10.1109/APCC.2009.5375639","url":null,"abstract":"The downlink of multi-user multiple-input single-output (MU-MISO) wireless system with ERB (equal rate and BER) precoding scheme is considered in this paper, where the base station is equipped with multiple antennas and each mobile user is constrained to a single antenna. Since the number of users supported by the BS is limited by the number of transmit RF chains, the system should exploit user scheduling scheme for user selection. In this paper, we focus on transmit antenna and user selection scheme simultaneously in a MU-MISO system. Because exhaustive search is computationally prohibitive, we propose a suboptimal algorithm for transmit antenna and user subset selection. Then its simplified version with lower complexity is described. The simulation results show the performance of the proposed algorithms is almost the same as the optimal one.","PeriodicalId":217893,"journal":{"name":"2009 15th Asia-Pacific Conference on Communications","volume":"37 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":"131682340","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.5375596
Mingyuan Wang, Xian Shi, N. Jian, R. Yan, J. Ping
China's first lunar satellite Chang'E-1(CE-1) was launched on Oct. 24th 2007. During its flight to the Moon, a series of maneuvers were performed to keep the satellite in the correct trajectory. Among these maneuvers, the one performed for Lunar Orbit Insertion (LOI) was the most important since it directly decided whether the satellite could enter the mission orbit or not. Therefore, real time monitoring and estimation of the satellite's state during this stage became crucial. Our work was to set up a system to accomplish this task using as few data as possible. This system included real time data transmission as well as real time data analysis which could provide the difference between the predicted and observed measurements in the first place, and then, most importantly, it also gives the ensuing orbit insertion conditions, i.e. predicts probable future orbit parameters after the maneuver. Our method was applied for the LOI process during the actual mission. The system worked well and achieved the preconcerted goal.
{"title":"Real time monitoring of the Chang'E-1 lunar orbit insertion","authors":"Mingyuan Wang, Xian Shi, N. Jian, R. Yan, J. Ping","doi":"10.1109/APCC.2009.5375596","DOIUrl":"https://doi.org/10.1109/APCC.2009.5375596","url":null,"abstract":"China's first lunar satellite Chang'E-1(CE-1) was launched on Oct. 24th 2007. During its flight to the Moon, a series of maneuvers were performed to keep the satellite in the correct trajectory. Among these maneuvers, the one performed for Lunar Orbit Insertion (LOI) was the most important since it directly decided whether the satellite could enter the mission orbit or not. Therefore, real time monitoring and estimation of the satellite's state during this stage became crucial. Our work was to set up a system to accomplish this task using as few data as possible. This system included real time data transmission as well as real time data analysis which could provide the difference between the predicted and observed measurements in the first place, and then, most importantly, it also gives the ensuing orbit insertion conditions, i.e. predicts probable future orbit parameters after the maneuver. Our method was applied for the LOI process during the actual mission. The system worked well and achieved the preconcerted goal.","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":"123194809","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.5375574
Seoksu Song, Jinwoo Park
An all-optical flexible packet buffer system is proposed, which consists of a circulating fiber loop and a delay controller implemented by using optical logic AND and XOR gates. The buffer holding time of the proposed system can be controlled in the unit of a loop-circulating delay time. The operational performance is demonstrated by computer simulations.
{"title":"All-optical packet buffer system using a circulating loop and a SOA-Based controller","authors":"Seoksu Song, Jinwoo Park","doi":"10.1109/APCC.2009.5375574","DOIUrl":"https://doi.org/10.1109/APCC.2009.5375574","url":null,"abstract":"An all-optical flexible packet buffer system is proposed, which consists of a circulating fiber loop and a delay controller implemented by using optical logic AND and XOR gates. The buffer holding time of the proposed system can be controlled in the unit of a loop-circulating delay time. The operational performance is demonstrated by computer simulations.","PeriodicalId":217893,"journal":{"name":"2009 15th Asia-Pacific Conference on Communications","volume":"46 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":"121425959","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.5375551
Xunjian Xu, K. Nonaka
A simple fiber optic pulse correlation sesning system was proposed for high resolution and wide dynamic measurable range temperature measurement. This sensing system uses the second harmonic generation (SHG) to detect the correlation value of the monitoring and reference pulses. The correlation value is proportional to the temperature or strain change in the monitoring fiber. By combining long and short monitoring fibers using optical switch, it is able to reach high resolution and wide range measurement. And by employing an optical time delay component, it is possible to achieve a dynamic ranges measurement.
{"title":"High resolution and wide dynamic range fiber optic pulse correlation sensing system","authors":"Xunjian Xu, K. Nonaka","doi":"10.1109/APCC.2009.5375551","DOIUrl":"https://doi.org/10.1109/APCC.2009.5375551","url":null,"abstract":"A simple fiber optic pulse correlation sesning system was proposed for high resolution and wide dynamic measurable range temperature measurement. This sensing system uses the second harmonic generation (SHG) to detect the correlation value of the monitoring and reference pulses. The correlation value is proportional to the temperature or strain change in the monitoring fiber. By combining long and short monitoring fibers using optical switch, it is able to reach high resolution and wide range measurement. And by employing an optical time delay component, it is possible to achieve a dynamic ranges measurement.","PeriodicalId":217893,"journal":{"name":"2009 15th Asia-Pacific Conference on Communications","volume":"32 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":"126607774","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.5375468
K. Hattori, K. Ogawa, M. Katayama, S. Chaki
This paper discusses the efficiency of TCP transmission over a bandwidth-guaranteed network, where the bandwidth for each flow is guaranteed by traffic policing at edge nodes. In particular, it explores a method for improving TCP performance focusing on the size of the buffer to absorb jitter and promote a faster increase in the congestion window size. We propose a rate control method at an edge node based on controlling the advertised window for improving TCP performance in a bandwidth-guaranteed network. We also evaluate the effectiveness of the proposed method using a prototype.
{"title":"The method for improving TCP performance in bandwidth-guaranteed network","authors":"K. Hattori, K. Ogawa, M. Katayama, S. Chaki","doi":"10.1109/APCC.2009.5375468","DOIUrl":"https://doi.org/10.1109/APCC.2009.5375468","url":null,"abstract":"This paper discusses the efficiency of TCP transmission over a bandwidth-guaranteed network, where the bandwidth for each flow is guaranteed by traffic policing at edge nodes. In particular, it explores a method for improving TCP performance focusing on the size of the buffer to absorb jitter and promote a faster increase in the congestion window size. We propose a rate control method at an edge node based on controlling the advertised window for improving TCP performance in a bandwidth-guaranteed network. We also evaluate the effectiveness of the proposed method using a prototype.","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":"121521915","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.5375595
Ki-Hyeon Park, Hong‐Yeop Song
In this paper, we propose a fast algorithm for checking the Hadamard equivalence of two binary matrices, and give an intuitive analysis on its time complexity. For this, we define Hadamard-equivalence on the set of binary matrices, and a function which induces a total order on them. With respect to this order relation, we define the minimal element which is used as a representative of an equivalence class. We applied the proposed algorithm to Hadamard matrices of smaller sizes, and show the results. Especially, the result for those of Payley type I and II of the same size 60 shows they are not equivalent. Finally, we discuss a new combinatorial problem of counting the number of and enumerating all the inequivalent binary minimal matrices of size m×n, and show the solutions for small values of m, n ≤ 4, leaving many of the observed properties as open problems.
{"title":"Hadamard equivalence of binary matrices","authors":"Ki-Hyeon Park, Hong‐Yeop Song","doi":"10.1109/APCC.2009.5375595","DOIUrl":"https://doi.org/10.1109/APCC.2009.5375595","url":null,"abstract":"In this paper, we propose a fast algorithm for checking the Hadamard equivalence of two binary matrices, and give an intuitive analysis on its time complexity. For this, we define Hadamard-equivalence on the set of binary matrices, and a function which induces a total order on them. With respect to this order relation, we define the minimal element which is used as a representative of an equivalence class. We applied the proposed algorithm to Hadamard matrices of smaller sizes, and show the results. Especially, the result for those of Payley type I and II of the same size 60 shows they are not equivalent. Finally, we discuss a new combinatorial problem of counting the number of and enumerating all the inequivalent binary minimal matrices of size m×n, and show the solutions for small values of m, n ≤ 4, leaving many of the observed properties as open problems.","PeriodicalId":217893,"journal":{"name":"2009 15th Asia-Pacific Conference on Communications","volume":"6 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":"125310595","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
扫码关注我们
求助内容：
应助结果提醒方式：