{"title":"An optimal sampling of linear FM signal for efficient aperiodic correlations","authors":"W.K. Lee, J.M. Koh, H. Gam","doi":"10.1109/APCC.2006.255900","DOIUrl":"https://doi.org/10.1109/APCC.2006.255900","url":null,"abstract":"In digital communication and radar pulse signal processing, sequences with low autocorrelation levels are highly desirable. It has become a common practice to perform signal processing in discrete structures instead of continuous domains. The discrete structure of the phase code signal implies a possible potential to manipulate sidelobe patterns as desired, which promises wide dynamic range responses for various applications. This paper shows that a particular sampling rate for linear FM signals may lead to a significant reduction of peak sidelobe level (PSL) at the pulse compression output","PeriodicalId":205758,"journal":{"name":"2006 Asia-Pacific Conference on Communications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125489181","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":"The Fast Correlative Interferometer Direction Finder using I/Q Demodulator","authors":"Cheol-Sun Park, Daeyoung Kim","doi":"10.1109/APCC.2006.255915","DOIUrl":"https://doi.org/10.1109/APCC.2006.255915","url":null,"abstract":"This paper presents the development of the fast correlative interferometer direction finder using I/Q demodulator, which demodulates incoming signals using direct-conversion technique without synthesizer tuning time. Also this paper compares the performance of the two types (i.e. correlation based and LSE based) of CIDF (correlative interferometer direction finding) algorithms with that of the CRLB (Cramer-Rao lower bound) in 5-channel circular equi-spaced array. The CIDF algorithms have several beneficial features that are not shared by conventional DF (direction finding) algorithms such as robust operation in severe environment. This paper presents the results of the field trial using the pilot system with direct-conversion receiving technique. Using fast RF down converter and robust CIDF algorithms, we compare the performance of the pilot system with the result of numerical simulation","PeriodicalId":205758,"journal":{"name":"2006 Asia-Pacific Conference on Communications","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121024407","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":"IP/ATM QoS Solutions for VoIP Traffic","authors":"R.P. Liu, G. Rogers, J. Argyros","doi":"10.1109/APCC.2006.255772","DOIUrl":"https://doi.org/10.1109/APCC.2006.255772","url":null,"abstract":"Transmitting voice through IP data network can provide significant cost savings. However if not managed properly, voice quality can degrade due to data network congestion. This paper presents solutions to the IP/ATM QoS problems in the AARNet VoIP project. The network architecture is IP/VoIP at the edge and ATM carriers at the core. We propose solutions that can guarantee the quality of service (QoS) of voice traffic and at the same time maintain 100% bandwidth utilization for the combined traffic","PeriodicalId":205758,"journal":{"name":"2006 Asia-Pacific Conference on Communications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124908412","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 the Selection of Significant Channel Parameters for OFDM Systems: A Hypotheses Testing Based Approach","authors":"A. El-Sallam, S. Nordholm, H. H. Dam","doi":"10.1109/APCC.2006.255782","DOIUrl":"https://doi.org/10.1109/APCC.2006.255782","url":null,"abstract":"This paper considers multiple hypothesis techniques for the identification of significant channel parameters in OFDM systems. Unlike several OFDM channel estimation methods, where the channel response is estimated based on a pre-defined or an estimated length. In this work, the channel length is assumed unknown and only significant channel parameters will be identified. First, using a training based scenario, a model is proposed for the channel response. Second the model parameters are estimated using least squares (LS). Based on those estimates, multiple hypothesis tests based on F-statistics are constructed to classify each significant parameter. Simulation results show that the method is capable of identifying significant channel parameters with high probability under various SNR. In addition a receiver based on those parameters have a better performance than one which is based on the full model","PeriodicalId":205758,"journal":{"name":"2006 Asia-Pacific Conference on Communications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123435171","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":"Design of Power-efficient Memory-based FFT Processor with New Memory Addressing Scheme","authors":"Seungbeom Lee, Hyoungsoo Kim, Sin-Chong Park","doi":"10.1109/APCC.2006.255899","DOIUrl":"https://doi.org/10.1109/APCC.2006.255899","url":null,"abstract":"This paper presents a new memory-addressing scheme for the realization of power-efficient memory-based FFT processors. The scheme is based on the minimization of the coefficient access and reduction of switching activity by modifying the butterfly sequence. It also results in reducing hardware scale and shortening the critical path delay. Therefore, the power consumption in complex multiplier and memory is reduced","PeriodicalId":205758,"journal":{"name":"2006 Asia-Pacific Conference on Communications","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123521668","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 Intra-Class and Inter-Class Utility-Fair Bandwidth Adaptation Algorithm for Multi-Class Traffic in Wireless Networks","authors":"N. Lu, J. Bigham, N. Nasser","doi":"10.1109/APCC.2006.255822","DOIUrl":"https://doi.org/10.1109/APCC.2006.255822","url":null,"abstract":"Adaptive bandwidth allocation is becoming very attractive in wireless communications since it can adjust the allocated bandwidth of ongoing calls to cope with the network resource fluctuations. In this paper, we present a novel bandwidth adaptation algorithm for multi-class traffic in wireless networks. With the proposed scheme each call in the network is assigned a utility function according to its traffic characteristics. When the network is overloaded the allocated bandwidth of ongoing calls can be dynamically degraded to free bandwidth to accept the new and handoff calls. The objective of bandwidth degradation is to achieve both intra-class and inter-class utility fairness in each individual cell i.e. all calls within the same class receive fair utility and all different classes of calls receive fair utility. Simulation results show that our bandwidth adaptation scheme is effective in attaining both kinds of utility fairness while keeping the call blocking and handoff dropping probabilities of wireless networks substantially low","PeriodicalId":205758,"journal":{"name":"2006 Asia-Pacific Conference on Communications","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121987539","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":"Multiuser Scheduling in Downlink MIMO/OFDMA System with Transmit Preprocessing","authors":"Xu Ning, Wang Ying, Zhang Ping","doi":"10.1109/APCC.2006.255940","DOIUrl":"https://doi.org/10.1109/APCC.2006.255940","url":null,"abstract":"This paper applies a MIMO transmit preprocessing method proposed by Choi, 2004 into OFDMA systems. Multiuser scheduling in joint frequency and spatial domain is studied. A suboptimal two step scheduling (TSS) algorithm for the system throughput maximization is proposed with reduced complexity. The performance is showed by computer simulation with the value of spatial domain scheduling","PeriodicalId":205758,"journal":{"name":"2006 Asia-Pacific Conference on Communications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122795163","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 Novel Multiple Routes Discovery Scheme for Mobile Ad Hoc Networks","authors":"Fang Xie, Lei Du, Yong Bai, Lan Chen","doi":"10.1109/APCC.2006.255962","DOIUrl":"https://doi.org/10.1109/APCC.2006.255962","url":null,"abstract":"Multiple route information is often necessary for ad hoc networks, to recover from quick topology and link status change, and to support load balanced multi-path routing as well as QoS consideration. However, most such research focused on multiple routes utilization or specific QoS metric design, and few of them consider how to obtain such multiple route information efficiently. In this paper we propose a novel multiple routes discovery scheme to obtain multiple route information within a short period. In this scheme, multiple route request (RREQ) are collected and corresponding route information are incorporated into one route reply (RREP). Furthermore, cooperation between routing layer and media access control (MAC) layer is used to avoid duplicate RREP transmissions and reduce collisions. Consequently, multiple route information can be obtained promptly and efficiently. Simulation results show that compared with conventional routing protocols, this scheme could achieve better performance in terms of average route discovery latency, normalized routing/MAC load, as well as the packet delay and delivery ratio","PeriodicalId":205758,"journal":{"name":"2006 Asia-Pacific Conference on Communications","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123549018","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":"Simultaneous allocation of multiple resources for computer communications networks","authors":"S. Tsumura, S. Kuribayashi","doi":"10.1109/APCC.2006.255775","DOIUrl":"https://doi.org/10.1109/APCC.2006.255775","url":null,"abstract":"In computer communications networks, all services are provided using servers (computing resource and storage resource) distributed in various locations and network bandwidth which connects the selected server and the user terminal. Therefore, for each service request, it is necessary to assign multiple types of resource simultaneously and effectively. This paper proposes a new method of allocating multiple types of resource simultaneously in a computer communications network. The key idea of the proposed method is first to identify the resource type for which the requested amount is the largest proportion of the maximum resource of that type, and then to select the center with the least available amount of the selected resource type. Moreover, this paper proposes another method of allocating multiple types of resource which takes account of the network delay time. It is demonstrated by simulation evaluations that the proposed method could reduce the amount of the resource of 20% in the maximum, compared with the existing method","PeriodicalId":205758,"journal":{"name":"2006 Asia-Pacific Conference on Communications","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131272894","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 Corrupt Packet Detection Mechanism for WCDMA Receivers","authors":"S. Van Der Werf, JingXian Mei, K. Chung","doi":"10.1109/APCC.2006.255830","DOIUrl":"https://doi.org/10.1109/APCC.2006.255830","url":null,"abstract":"This paper presents a mechanism for a corrupt packet detection (CPD) scheme that can be used in the physical layer of a WCDMA system to distinguish whether a timeslot is occupied by a signal or not. Using the proposed scheme, it permits the physical layer to indicate to the MAC layer the status of the timeslot; whether a packet has been received, either correctly, or been corrupted, or if there was no signal transmitted during that particular timeslot. This type of status information is vital for certain types of MAC protocols to operate efficiently and fairly in terms of resource allocation of the shared medium. The simulation is carried out using a WCDMA system with N concurrent code channels shared with M mobile terminals, each with its own channelization code","PeriodicalId":205758,"journal":{"name":"2006 Asia-Pacific Conference on Communications","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128364417","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}