Pub Date : 2003-04-09DOI: 10.1109/ICCT.2003.1209891
Jianxin Yan, Z. Dong, W. Dou
In this paper, a scalable audio scheme is presented, which is mainly based on an embedded zerotree wavelet (EZW) coding technology. Firstly, 29 critical subbands are obtained by splitting audio signals with a digital wavelet package transform (DPWT). Then a zerotree coding is acted on these subbands. Lastly, an entropy coding is applied to remove redundancy and a specific frame structure is formed. The resulting encoder can support a scalable bit stream from 16 kbps to 64 kbps with a 4 kbps step size for a single audio channel and the graceful degeneration of subjective audio quality can also be provided.
{"title":"A scalable digital audio encoder based on embedded zerotree wavelet","authors":"Jianxin Yan, Z. Dong, W. Dou","doi":"10.1109/ICCT.2003.1209891","DOIUrl":"https://doi.org/10.1109/ICCT.2003.1209891","url":null,"abstract":"In this paper, a scalable audio scheme is presented, which is mainly based on an embedded zerotree wavelet (EZW) coding technology. Firstly, 29 critical subbands are obtained by splitting audio signals with a digital wavelet package transform (DPWT). Then a zerotree coding is acted on these subbands. Lastly, an entropy coding is applied to remove redundancy and a specific frame structure is formed. The resulting encoder can support a scalable bit stream from 16 kbps to 64 kbps with a 4 kbps step size for a single audio channel and the graceful degeneration of subjective audio quality can also be provided.","PeriodicalId":237858,"journal":{"name":"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117122093","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 : 2003-04-09DOI: 10.1109/ICCT.2003.1209892
Ping Wu, Ming Zhao, H. Cui
An implementation of a vocoder at very low bit rate with high quality on TMS320VC33DSP is presented in this paper. Through the technique of partial fixing-point, assembly instructions and mathematical optimization, the memory cost is reduced to fit the target on chip memory capacity and the operation complexity takes only 1/4 of the whole operation ability, meeting the requirement of real-time.
{"title":"An implementation of a high quality vocoder on TMS320VC33","authors":"Ping Wu, Ming Zhao, H. Cui","doi":"10.1109/ICCT.2003.1209892","DOIUrl":"https://doi.org/10.1109/ICCT.2003.1209892","url":null,"abstract":"An implementation of a vocoder at very low bit rate with high quality on TMS320VC33DSP is presented in this paper. Through the technique of partial fixing-point, assembly instructions and mathematical optimization, the memory cost is reduced to fit the target on chip memory capacity and the operation complexity takes only 1/4 of the whole operation ability, meeting the requirement of real-time.","PeriodicalId":237858,"journal":{"name":"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129854525","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 : 2003-04-09DOI: 10.1109/ICCT.2003.1209774
Kunmin Yeo, B. Ryu, Soon-Young Lim
In this paper, a self-adaptive algorithm of a packet scheduler is addressed as a crucial method of high-speed transmission of multimedia traffic in a shared wireless link, in accordance with new architectural functions. In the slot budget that is updated sequentially in the order of priorities of applications and sessions, adaptive modulation and coding options are considered to take into account radio links subject to fading and interference. The dedicated local packet scheduler that is in control of each type of application employs an application-sensitive scheduling algorithm. For real-time scheduler, the forward-equilibrium algorithm is introduced to consider the future state of delay. When it comes to non real-time scheduler, the adaptive-fair-selection algorithm is developed to provide the fairness between sessions. The global packet scheduler manages the overall operation of the dedicated local packet schedulers and supervises the slot budget in each transmission-time-interval making a final decision. The scheduler can provide the local fairness between sessions in each service class. Related to the bounds on delay, real-time sessions can be served with predefined requirements at the cost of increased packet dropping rates. Implementation complexity is thought to be simple, providing a low-complexity algorithm in the local scheduler for the nonreal-time class.
{"title":"A packet scheduler with forward equilibrium and adaptive fair selection method in wireless multimedia traffic environment","authors":"Kunmin Yeo, B. Ryu, Soon-Young Lim","doi":"10.1109/ICCT.2003.1209774","DOIUrl":"https://doi.org/10.1109/ICCT.2003.1209774","url":null,"abstract":"In this paper, a self-adaptive algorithm of a packet scheduler is addressed as a crucial method of high-speed transmission of multimedia traffic in a shared wireless link, in accordance with new architectural functions. In the slot budget that is updated sequentially in the order of priorities of applications and sessions, adaptive modulation and coding options are considered to take into account radio links subject to fading and interference. The dedicated local packet scheduler that is in control of each type of application employs an application-sensitive scheduling algorithm. For real-time scheduler, the forward-equilibrium algorithm is introduced to consider the future state of delay. When it comes to non real-time scheduler, the adaptive-fair-selection algorithm is developed to provide the fairness between sessions. The global packet scheduler manages the overall operation of the dedicated local packet schedulers and supervises the slot budget in each transmission-time-interval making a final decision. The scheduler can provide the local fairness between sessions in each service class. Related to the bounds on delay, real-time sessions can be served with predefined requirements at the cost of increased packet dropping rates. Implementation complexity is thought to be simple, providing a low-complexity algorithm in the local scheduler for the nonreal-time class.","PeriodicalId":237858,"journal":{"name":"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128439859","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 : 2003-04-09DOI: 10.1109/ICCT.2003.1209867
X. Zhu, Min Chen, Yinglin Yu
In this paper, a novel marking algorithm for IP Diffserv based on the transmission condition and the different importance of video streams for decoder has been introduced. Using the marking algorithm, video transmission over the IP Diffserve networks model, which we have set up has been studied. Combined with the error concealment technology in the video decoder, in case of severe congestion, which causes the lose of a lot of IP packets, the algorithm has been proved effective, hence the delay, jitter and the perceived picture quality entirely meet requirement for real-time video transmission.
{"title":"Video transmission based on Diffserv over IP networks","authors":"X. Zhu, Min Chen, Yinglin Yu","doi":"10.1109/ICCT.2003.1209867","DOIUrl":"https://doi.org/10.1109/ICCT.2003.1209867","url":null,"abstract":"In this paper, a novel marking algorithm for IP Diffserv based on the transmission condition and the different importance of video streams for decoder has been introduced. Using the marking algorithm, video transmission over the IP Diffserve networks model, which we have set up has been studied. Combined with the error concealment technology in the video decoder, in case of severe congestion, which causes the lose of a lot of IP packets, the algorithm has been proved effective, hence the delay, jitter and the perceived picture quality entirely meet requirement for real-time video transmission.","PeriodicalId":237858,"journal":{"name":"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128232688","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 : 2003-04-09DOI: 10.1109/ICCT.2003.1209872
Chinchen Chang, Chi-Yien Chung
Digital watermarks are helpful about the possession identification as well as copyright and intellectual property protection for tons and tons of multimedia data transmitted through the Internet. In a buyer-seller watermarking protocol, both seller and buyer have to insert their watermarks into a copy. If unauthorized parties have drifted into market, the watermark detection and extraction algorithm will both identify exactly who has the legal ownership of that copy and trace back to the illegal reseller. In Memon and Wong's protocol, the seller is responsible for watermarks insertion, but she/he has no idea what the buyer's watermark is. As a result, the seller has no way to forge the buyer's watermark. However, the seller doesn't have to use her/his own private information in the watermark insertion process. This may bring about the problem of man in the middle attack. Besides, in their protocol, if there is a dispute, a judge is a must. To improve those shortcomings, we shall propose a new scheme where the seller has to use her/his own private key to do the watermarking insertion job. In our scheme, everyone can be the judge if there is a quarrel over the copyright. This provides a simple and fair solution to the judgment of copy deterrence.
{"title":"An enhanced buyer seller watermarking protocol","authors":"Chinchen Chang, Chi-Yien Chung","doi":"10.1109/ICCT.2003.1209872","DOIUrl":"https://doi.org/10.1109/ICCT.2003.1209872","url":null,"abstract":"Digital watermarks are helpful about the possession identification as well as copyright and intellectual property protection for tons and tons of multimedia data transmitted through the Internet. In a buyer-seller watermarking protocol, both seller and buyer have to insert their watermarks into a copy. If unauthorized parties have drifted into market, the watermark detection and extraction algorithm will both identify exactly who has the legal ownership of that copy and trace back to the illegal reseller. In Memon and Wong's protocol, the seller is responsible for watermarks insertion, but she/he has no idea what the buyer's watermark is. As a result, the seller has no way to forge the buyer's watermark. However, the seller doesn't have to use her/his own private information in the watermark insertion process. This may bring about the problem of man in the middle attack. Besides, in their protocol, if there is a dispute, a judge is a must. To improve those shortcomings, we shall propose a new scheme where the seller has to use her/his own private key to do the watermarking insertion job. In our scheme, everyone can be the judge if there is a quarrel over the copyright. This provides a simple and fair solution to the judgment of copy deterrence.","PeriodicalId":237858,"journal":{"name":"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130031296","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 : 2003-04-09DOI: 10.1109/ICCT.2003.1209885
Ling-yun Lu, Yang Xiao, Cheng Liu
In the multiuser detection (MUD) techniques, one of the most difficult problems is how to reduce the computational complexity and then improve the performance of the system. In this paper, based on the space-time CDMA system, we apply the method of the steepest descent with the noisy gradient to the multiuser detection of the system. In the multiuser detection algorithm, we change the conventional fixed step-size iterations into the time-varying step-size iterations with the noisy gradient. Simulations show that the algorithm of the multiuser detection can converge rapidly and guarantee that space-time CDMA system gets the better performance at the same time.
{"title":"Multiuser detection algorithm for space-time CDMA-systems","authors":"Ling-yun Lu, Yang Xiao, Cheng Liu","doi":"10.1109/ICCT.2003.1209885","DOIUrl":"https://doi.org/10.1109/ICCT.2003.1209885","url":null,"abstract":"In the multiuser detection (MUD) techniques, one of the most difficult problems is how to reduce the computational complexity and then improve the performance of the system. In this paper, based on the space-time CDMA system, we apply the method of the steepest descent with the noisy gradient to the multiuser detection of the system. In the multiuser detection algorithm, we change the conventional fixed step-size iterations into the time-varying step-size iterations with the noisy gradient. Simulations show that the algorithm of the multiuser detection can converge rapidly and guarantee that space-time CDMA system gets the better performance at the same time.","PeriodicalId":237858,"journal":{"name":"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.","volume":"5 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130069548","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 : 2003-04-09DOI: 10.1109/ICCT.2003.1209143
Xiaoguang Zhang, Chaoyang Li, Yuan Zheng, Guangtao Zhou, Yu Shen, Li Yu, Bojun Yang, Hongxiang Wang, Lan Wang, Yuefeng Ji
An experiment of adaptive polarization mode dispersion compensation of optical communication systems is reported in this paper. The compensated PMD value is up to 30 ps. Automatic tracking time is about 1 to 2 seconds. The quasi-real-time adaptive PMD compensation is realized.
{"title":"An experiment of adaptive polarization mode dispersion compensation of optical communication systems","authors":"Xiaoguang Zhang, Chaoyang Li, Yuan Zheng, Guangtao Zhou, Yu Shen, Li Yu, Bojun Yang, Hongxiang Wang, Lan Wang, Yuefeng Ji","doi":"10.1109/ICCT.2003.1209143","DOIUrl":"https://doi.org/10.1109/ICCT.2003.1209143","url":null,"abstract":"An experiment of adaptive polarization mode dispersion compensation of optical communication systems is reported in this paper. The compensated PMD value is up to 30 ps. Automatic tracking time is about 1 to 2 seconds. The quasi-real-time adaptive PMD compensation is realized.","PeriodicalId":237858,"journal":{"name":"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129011851","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 : 2003-04-09DOI: 10.1109/ICCT.2003.1209649
H. Nie, P. Mathiopoulos
In the open technical literature, all the papers investigating the reverse link capacity of the combining macrodiversity simplified their analysis by assuming that the radio signals received by all the base stations in the cellular CDMA system are combined to detect mobile users. Therefore, their analysis results are actually an upper bound of the real reverse link capacity. In this paper, by assuming that only the radio signals received by the base stations in the vicinity of the mobile user are combined to detect the mobile user, we have theoretically analyzed the reverse link capacity of cellular CDMA systems employing the combining macrodiversity. Furthermore, by taking a pedestrian application in cdma2000 as an example, computer simulations are performed, and the obtained simulation results have confirmed our theoretical analysis.
{"title":"Reverse link capacity analysis for cellular CDMA systems employing combining macrodiversity","authors":"H. Nie, P. Mathiopoulos","doi":"10.1109/ICCT.2003.1209649","DOIUrl":"https://doi.org/10.1109/ICCT.2003.1209649","url":null,"abstract":"In the open technical literature, all the papers investigating the reverse link capacity of the combining macrodiversity simplified their analysis by assuming that the radio signals received by all the base stations in the cellular CDMA system are combined to detect mobile users. Therefore, their analysis results are actually an upper bound of the real reverse link capacity. In this paper, by assuming that only the radio signals received by the base stations in the vicinity of the mobile user are combined to detect the mobile user, we have theoretically analyzed the reverse link capacity of cellular CDMA systems employing the combining macrodiversity. Furthermore, by taking a pedestrian application in cdma2000 as an example, computer simulations are performed, and the obtained simulation results have confirmed our theoretical analysis.","PeriodicalId":237858,"journal":{"name":"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130522737","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 : 2003-04-09DOI: 10.1109/ICCT.2003.1209719
Jiang Du, Q. Peng, Yubei Li
In this paper, we investigate the blind algorithm for channel estimation of MIMO-OFDM wireless communication system based on the subspace decomposition of the channel received complex baseband signals and propose a new two-stage blind algorithm. We exploit the second-order cyclostationarity inherent in OFDM with cyclic prefix and the characteristics of the phased antenna, establish the practical HIPERLAN/2 standard based MIMO-OFDM simulator with the sufficient considerations of statistical correlations between the multiple antenna channels under wireless wideband multipath fading environment, and formulate a new two-stage adaptive blind algorithm using rank reduced subspace channel matrix approximation and adaptive CMA (constant modulus algorithm) criteria. The performance of the new method has been justified theoretically and validated through extensive simulations over common wireless and mobile communication links.
{"title":"Adaptive blind equalization for MIMO-OFDM wireless communication systems","authors":"Jiang Du, Q. Peng, Yubei Li","doi":"10.1109/ICCT.2003.1209719","DOIUrl":"https://doi.org/10.1109/ICCT.2003.1209719","url":null,"abstract":"In this paper, we investigate the blind algorithm for channel estimation of MIMO-OFDM wireless communication system based on the subspace decomposition of the channel received complex baseband signals and propose a new two-stage blind algorithm. We exploit the second-order cyclostationarity inherent in OFDM with cyclic prefix and the characteristics of the phased antenna, establish the practical HIPERLAN/2 standard based MIMO-OFDM simulator with the sufficient considerations of statistical correlations between the multiple antenna channels under wireless wideband multipath fading environment, and formulate a new two-stage adaptive blind algorithm using rank reduced subspace channel matrix approximation and adaptive CMA (constant modulus algorithm) criteria. The performance of the new method has been justified theoretically and validated through extensive simulations over common wireless and mobile communication links.","PeriodicalId":237858,"journal":{"name":"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130558780","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 : 2003-04-09DOI: 10.1109/ICCT.2003.1209077
Wenjie Li, Yiping Gong, B. Liu
High performance switch architectures with hundreds of Gbps switching capacity are needed in the next-generation routers. In this paper, we propose and analyze a parallel packet switch, which has a 160 Gbps full-duplex switched backplane, supporting 16 ports, each operating at OC192c (10 Gbps) line rate. This switch uses parallel-processing policy and can support variable-length traffic. Based on it, we also present a simple and novel QoS guaranteed scheduling algorithm, named IPRR (inlet priority round robin). By comparing it with the noted iSLIP algorithm, we prove that IPRR can provide better QoS (quality of service) control to network traffic.
{"title":"Analysis of a QoS-based parallel packet switch for core routers","authors":"Wenjie Li, Yiping Gong, B. Liu","doi":"10.1109/ICCT.2003.1209077","DOIUrl":"https://doi.org/10.1109/ICCT.2003.1209077","url":null,"abstract":"High performance switch architectures with hundreds of Gbps switching capacity are needed in the next-generation routers. In this paper, we propose and analyze a parallel packet switch, which has a 160 Gbps full-duplex switched backplane, supporting 16 ports, each operating at OC192c (10 Gbps) line rate. This switch uses parallel-processing policy and can support variable-length traffic. Based on it, we also present a simple and novel QoS guaranteed scheduling algorithm, named IPRR (inlet priority round robin). By comparing it with the noted iSLIP algorithm, we prove that IPRR can provide better QoS (quality of service) control to network traffic.","PeriodicalId":237858,"journal":{"name":"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130609924","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
扫码关注我们
求助内容：
应助结果提醒方式：