{"title":"Interference cancellation schemes with model-based channel estimator for space-time-coded MIMO-MC-CDMA uplink system","authors":"Jeng-Kuang Hwang, Hung-Ta Lin, R. Chung","doi":"10.1109/ICCS.2004.1359384","DOIUrl":"https://doi.org/10.1109/ICCS.2004.1359384","url":null,"abstract":"Interference cancellation (IC) schemes are often used for multiuser detection (MUD) or spatial multiplexing (SM) problems. This paper treats an MC-CDMA uplink system over MC-MIMO multipath fading channel. Assuming each uplink data stream is space-time-coded, two MUD structures based on parallel or serial interference cancellation (SIC/PIC) mechanism are presented. Since the accuracy of channel estimator has a determining effect on the receiver performance, a frequency-domain model-based multipath channel estimator is adopted. Based on the famous modified forward-backward linear prediction (MFBLP) method, this estimator can accurately estimate the path delays and attenuations. Computer simulation results are included to illustrate the channel estimation performance, and show that the PIC or SIC multiuser detector using the proposed channel estimator can attain a performance close to the single user bound","PeriodicalId":333629,"journal":{"name":"The Ninth International Conference onCommunications Systems, 2004. ICCS 2004.","volume":"178 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124407189","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}
{"title":"An analytical model of a distributed wireless MAC with service differentation","authors":"A. Firag, H. Sirisena, KrzysztoJ Pawlikowski","doi":"10.1109/ICCS.2004.1359343","DOIUrl":"https://doi.org/10.1109/ICCS.2004.1359343","url":null,"abstract":"This paper presents a mathematical model of a fully distributed multiple access control (MAC) scheme that supports service differentiation in a wireless LAN environment. In the scheme, stations use CSMA for channel access, with collisions between stations of different priorities resolved by sending beacons in a predefined manner. Performance of this MAC scheme has been evaluated in a scenario with two priority levels of data traffic. The analytical results, which are validated by discrete-event simulations, show that the scheme provides good service differentiation between the different priorities of traffic","PeriodicalId":333629,"journal":{"name":"The Ninth International Conference onCommunications Systems, 2004. ICCS 2004.","volume":"587 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123039782","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}
{"title":"on equivalence of channel estimation with transform and without transform for multicarrier signals","authors":"S. Takaoka, F. Adachi","doi":"10.1109/ICCS.2004.1359413","DOIUrl":"https://doi.org/10.1109/ICCS.2004.1359413","url":null,"abstract":"Accurate channel estimation is necessary for coherent detection and adaptive control techniques, e.g., adaptive modulation and channel coding, of multicarrier signals. In this paper, we study frequency-(or time)-domain channel estimation with transform and without transform, using frequency (or time)-multiplexed pilot. It is shown that the frequency (or time)-domain channel estimation is equivalent to windowing of the delay time-domain impulse response (or Doppler frequency-domain spectrum) obtained by discrete transform as discrete Fourier transform (DFT)","PeriodicalId":333629,"journal":{"name":"The Ninth International Conference onCommunications Systems, 2004. ICCS 2004.","volume":"201 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115019314","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}
{"title":"Joint POCS algorithm with sub-pixel motion estimation for super-resolution of diffraction-limited images","authors":"Huifang Li, Minghui Du","doi":"10.1109/ICCS.2004.1359373","DOIUrl":"https://doi.org/10.1109/ICCS.2004.1359373","url":null,"abstract":"This paper proposes a novel super-resolution restoration algorithm based on jointly projecting onto convex sets (POCS) and sub-pixel motion estimation, which differs from the super-resolution algorithms proposed in the previous studies. This scheme specially considers: (1) motion estimation and reconstruction interrelations; (2) sub-pixel relative motion between observation frames contributes novel information which provides constraints for the high-resolution images. Hence, our algorithm offers a greater flexibility for simultaneously estimating sub-pixel motion parameters within the reconstruction iteration. By numerical experiments, the approach achieves better reconstruction performance","PeriodicalId":333629,"journal":{"name":"The Ninth International Conference onCommunications Systems, 2004. ICCS 2004.","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122441864","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}
E. Kurniawati, E. Kurniawan, C. Lau, B. Premkumar, J. Absar, S. George
{"title":"Error concealment scheme for MPEG-AAC","authors":"E. Kurniawati, E. Kurniawan, C. Lau, B. Premkumar, J. Absar, S. George","doi":"10.1109/ICCS.2004.1359375","DOIUrl":"https://doi.org/10.1109/ICCS.2004.1359375","url":null,"abstract":"MPEG-AAC is the state-of-the-art in audio compression technology. Promising CD quality at 64 kbps, AAC is the leading option for low bandwidth audio streaming applications. In spite of the support from channel coding and the error resilience features of AAC itself, handling erroneous transmission requires the decoder to be equipped with error concealment scheme to cater for missing packets. However, complexity is limited by the real time requirement in this application. We present in this paper a novel scheme of error concealment, specifically for AAC. This scheme exploits the time domain aliasing cancellation property of MDCT based codec and the block-switching feature of AAC. Preliminary simulations show significant improvement in both error performance and subjective quality testing compared to general method of concealment. The scheme does not introduce major computational load, and hence suitable for real time low power decoder","PeriodicalId":333629,"journal":{"name":"The Ninth International Conference onCommunications Systems, 2004. ICCS 2004.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114389373","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}
{"title":"A probability random scheme of distributed routing algorithm for MANETS","authors":"Yang Qin, Chia Yui Lee","doi":"10.1109/ICCS.2004.1359340","DOIUrl":"https://doi.org/10.1109/ICCS.2004.1359340","url":null,"abstract":"Since the mobile hosts in a MANET keep moving, topological changes take place frequently in the network. This causes routing information kept by the nodes to get outdated easily. These problems become more complex in wireless networks, where bandwidth is limited. This paper proposes a probability random routing algorithm as a solution to this problem. The proposed algorithm, the probability random routing scheme (PRS), has a route discovery feature that when a source needs to find a routing path to a destination, it does not flood the network with control packets, which is an approach widely used in most of the ad hoc routing algorithms. Instead, the source randomly selects one of its neighbors to send out a route request packet. The operations in the algorithm are designed to generate a small number of control packets. The question that how much the successful rate is in finding a path without flooding has been studied in this paper. Our studies show that the successful rate in finding a path with only one attempt can be as high as 90%. Through simulations, we study the performance of the network using the proposed PRS routing algorithm, and compare with the well known on-demand routing protocol, dynamic source routing (DSR) and zone routing protocol (ZRP). Our PRS is simple and can be easily implemented while produces better performance","PeriodicalId":333629,"journal":{"name":"The Ninth International Conference onCommunications Systems, 2004. ICCS 2004.","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129044371","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}
{"title":"Subspace-based blind channel estimation in multirate DS-CDMA system","authors":"Rongbo Zhu, Xiaozhu Liu, Yuhang Yang","doi":"10.1109/ICCS.2004.1359455","DOIUrl":"https://doi.org/10.1109/ICCS.2004.1359455","url":null,"abstract":"Channel estimation is very important in wireless communication system. On discussing the signal model of variable spread spectrum gain multirate DS-CDMA system, this paper proposed a multirate subspace-based blind channel estimation algorithm. To overcome the high-complexity shortage of this algorithm, a modified approach is devised that offers tradeoff between performance and complexity. Finally performance analysis for multirate subspace-based blind algorithm and its modified algorithm are conducted. Simulation results proved the efficiency of the proposed algorithms","PeriodicalId":333629,"journal":{"name":"The Ninth International Conference onCommunications Systems, 2004. ICCS 2004.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129324325","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}
{"title":"A geometric approach to post nonlinear mixture in blind source separation","authors":"T.V. Nguyen, J. Patra, A. Das","doi":"10.1109/ICCS.2004.1359379","DOIUrl":"https://doi.org/10.1109/ICCS.2004.1359379","url":null,"abstract":"In this paper, a novel approach for the post nonlinear mixture blind source separation (PNL BSS) is introduced. The new approach exploits the difference between a linear and nonlinear mixture from their nature of distributions in a multi-dimensional space. The nonlinear mixture is represented by a curved surface while the linear mixture is represented by a plane. A geometric-based algorithm named as geometric post nonlinear independent component analysis (gpnlCA) is developed. This two-stage algorithm geometrically transforms the curved surface of the nonlinear mixture to a plane, i.e., a linear mixture, and then applies a normal linear ICA to extract the unknown signals. Experiments were carried out to illustrate the algorithm performance","PeriodicalId":333629,"journal":{"name":"The Ninth International Conference onCommunications Systems, 2004. ICCS 2004.","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121103875","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}
{"title":"Adaptive power allocation with user prioritization fr downlink orthogonal frequency division multiple access systems","authors":"T. Chee, C. Lim, Jinho Choi","doi":"10.1109/ICCS.2004.1359369","DOIUrl":"https://doi.org/10.1109/ICCS.2004.1359369","url":null,"abstract":"Maximizing the capacity of a downlink orthogonal frequency division multiple access (OFDMA) system with prioritization of user-services is investigated. An iterative algorithm is proposed to determine the capacity of individual user from a limited and varying power budget when the channel is subjected to fading, shadowing and propagation path loss. Simulation shows that the proposed algorithm not only can obtain achievable capacity of the users' requested services but also conserve excess transmit power if a lesser power budget is adequate to achieve the desired capacity","PeriodicalId":333629,"journal":{"name":"The Ninth International Conference onCommunications Systems, 2004. ICCS 2004.","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121415478","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}
{"title":"Sub-reconfiguration of backup paths based on shared path protection for WDM networks with dynamic traffic pattern","authors":"Xuzhou He, G. Poo","doi":"10.1109/ICCS.2004.1359405","DOIUrl":"https://doi.org/10.1109/ICCS.2004.1359405","url":null,"abstract":"The survivability of optical networks based on WDM technology is a critical concern. Shared path protection provides fast recovery from network failure. To ensure high resource usage efficiency, optimal configuration of lightpaths is needed. This is possible in static traffic but not so in dynamic traffic. How to reconfigure the WDM networks to accommodate changes in traffic demand poses a new challenge. Carrying out a full reconfiguration of all backup paths is a way to achieve a good performance. However, it is time-consuming and not for practical use. In this paper, we propose a new technique called sub-reconfiguration to rearrange the backup paths for WDM networks. This technique captures the property of backup path sharing to achieve fast reconfiguration of backup resources. So, the resource usage efficiency can be improved effectively. We carry out simulation experiments with dynamic traffic input. The results show that our sub-reconfiguration technique can save up to 10% wavelength usage and can significantly lower the protection overbuild. It can support fast reconfiguration and improve the resource usage efficiency effectively","PeriodicalId":333629,"journal":{"name":"The Ninth International Conference onCommunications Systems, 2004. ICCS 2004.","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121501490","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}