{"title":"Approaches to improve performance for history-based branch predictors","authors":"Tieling Xie, Y. Chu, J. H. Park","doi":"10.1109/PACRIM.2005.1517240","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517240","url":null,"abstract":"This paper investigates the aliasing problems in global-history-based and local-history-based branch predictors and presents two approaches to improve the performance of global-history-based branch predictors. Global-history-based predictors have more critical aliasing problems but show the better performance than local-history-based predictors. Therefore, our approaches mainly focus on alleviating the aliasing problems for global-history-based predictors. The performance of each approach is evaluated and compared by using the Simplescalar simulator with SPEC95CINT benchmark programs. Our experimental results show that the approaches outperform conventional global-history-based branch predictors.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125308584","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":"Optimizing the performance of a cluster of hosts","authors":"Alberto Avritzer, A. Bondi, E. Weyuker","doi":"10.1109/PACRIM.2005.1517210","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517210","url":null,"abstract":"We evaluate the applicability of the dynamic rejuvenation algorithm introduced in A. Avritzer, et al. (2005) to clusters of identical systems operating in parallel. The dynamic rejuvenation algorithm triggers software rejuvenation events when degradation in the value of the response time is detected.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129937109","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 research facility for evaluating cyber-security approaches within corporate-scale networks and under operational conditions","authors":"S. Neville","doi":"10.1109/PACRIM.2005.1517327","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517327","url":null,"abstract":"The increased reliance on IT technologies has given rise to an increased risks relative to malicious cyber-security events. Research into the operational testing of cyber-security solutions, particularly within large-scale high bandwidth network environments, has not kept pace with the development of new security approaches and ever increasing network speeds. Current testing methods are generally limited to: (a) experiments conducted on small-scale research networks, (b) experiments conducted on pre-recorded network data or (c) active deployments on operational large scale networks. In the each case, issues exist either in the representativeness of the test environments to real world situations or the scientific repeatability of the experiments or both. A particularly complex issue is the sensitivity of reported results to background (normal) traffic characteristics existing at the time of experimentation. This work, presents the architecture of a cyber-security test facility under development designed address these issues.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125598488","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":"Improved BICM iterative decoding with hard-decision feedback","authors":"J.T.-L. Liu, L. Lampe","doi":"10.1109/PACRIM.2005.1517228","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517228","url":null,"abstract":"Bit-interleaved coded modulation (BlCM) enables power- and bandwidth-efficient transmission over fading channels. Power efficiency can be further improved if iterative decoding (ID) is applied, so-called BICM-ID. In this paper, we consider BICM-ID with hard-decision feedback as originally proposed by Li and Ritcey (1999) for low-complexity ID. We analyze the reliability of the soft output of the hard-decision feedback aided demapper, the inner decoder of BICM-ID. From this we find that a simple truncation of these output values significantly improves reliability in subsequent decoding iterations and thus, enhances convergence of ID. We propose two pragmatic truncation schemes and show by means of simulations that gains of more than 3 dB in power efficiency over conventional BICM-ID are achieved for the Rayleigh fading channel with no increase in decoding complexity.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"137 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133576285","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}
T. Nakanishi, S. Kishimoto, T. Sakurai, T. Kitagawa
{"title":"A construction method of a metadata space based on relations between words from an index of a book","authors":"T. Nakanishi, S. Kishimoto, T. Sakurai, T. Kitagawa","doi":"10.1109/PACRIM.2005.1517320","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517320","url":null,"abstract":"A large amount of information resources for a specific field have been distributed in wide area networks. One of the most important issues is how to extract appropriate information in such environment for a specific field. This paper presents a construction method of a metadata space from an index of a book for a specific field. In order to search high quality information on a specific field, it is necessary to construct a metadata space which enables measurement of relations between each expert word for the field. This method needs neither a dictionary nor specialized knowledge. This method enables construction of a metadata space for an expert field easily.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134365714","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":"Non-coherent detection of MSK with transmit diversity in fast fading","authors":"M. Riediger, P. Ho","doi":"10.1109/PACRIM.2005.1517221","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517221","url":null,"abstract":"We propose a minimum-shift keying (MSK) transmission scheme, motivated by the Alamouti-type block code structure. Taking advantage of the block-wise differential encoding on which the MSK transmission is based, the receiver is able to obtain non-coherent sequence estimates from a down-sampled subset of the received statistics. As a result of the sequence detection, the fast fading error floor associated with symbol-by-symbol differential detection is essentially eliminated. Furthermore, using the original received sequence and performing iterative channel estimation and sequence detection, the decisions are refined and further performance gains are observed. In fast fading, the results show that the proposed receiver performance is within 5 dB of the coherent detection lower bound, at a BER of 10/sup -3/.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131882461","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":"Turbo decoding enhancement studies in satellite communications","authors":"L. Chu","doi":"10.1109/PACRIM.2005.1517229","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517229","url":null,"abstract":"Modern satellite communication systems require high-rate, accurate and reliable transmission in the presence of hostile environments. These requirements present a major challenge. To meet this challenge, we are presenting a simple enhancement of the turbo decoding algorithm which will significantly improve the end-to-end channel performance. Herein, we present an improved max-log-MAP turbo decoding in which the branch metrics are weight by a single scaling factor. The enhanced max-log-MAP decoder can provide a significant BER performance over the conventional max-log-MAP by improvement in the extrinsic information calculation. With negligible increase in complexity, this enhancement has significant advantage for advanced satellite communication applications.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133368108","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":"Interference cancellation technique using cycle-and-add property","authors":"M. Araki, Y. Yamaguchi, M. Yokoyama, H. Uehara","doi":"10.1109/PACRIM.2005.1517372","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517372","url":null,"abstract":"This paper proposes a new interference cancellation technique using cycle-and-add property of PN (pseudorandom noise) sequence. This property has motivated us to invent a new PN synchronization system which has the ability to find the PN sequence used by an unknown interference signal and to establish the synchronization. With this technique, the unknown interference signal is regenerated and subtracted from the received signal. The principle and the analysis of this cancellation mechanism are given, and the signal to interference-and-noise ratio and the bit error rate (BER) are formulated. Two receiver structures and their cancellation performance are presented.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116251492","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":"Hierarchical PNNI addressing by recursive partitioning","authors":"E. Rosenberg","doi":"10.1109/PACRIM.2005.1517243","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517243","url":null,"abstract":"We describe a recursive method for hierarchically partitioning a set of locations to generate bit strings that can be used to define switch ATM end system addresses for PNNI routing. The method was used in the implementation of a very large ATM network at AT&T, and is also applicable to PNNI-based automatically switched optical networks.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123476111","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}
Jinsoo Bae, Jongho Oh, Sun Yong Kim, Hyun Gu Kang, I. Kim, I. Song
{"title":"Performance comparison of signal detectors for dependent Gaussian channels","authors":"Jinsoo Bae, Jongho Oh, Sun Yong Kim, Hyun Gu Kang, I. Kim, I. Song","doi":"10.1109/PACRIM.2005.1517218","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517218","url":null,"abstract":"The detection of weak signals is addressed in additive noise described by the first order moving average of a Gaussian process. We derive decision regions of the maximum likelihood (ML) and suboptimum ML (SML) detectors, and obtain specific examples of the ML and SML decision regions. The ML and SML detectors are employed in the antipodal signaling system, and compared in terms of the bit-error-rate in the dependent Gaussian noise environment. Numerical results show that the SML detector, despite its reduced complexity and simpler structure, exhibits practically the same performance as the optimum ML detector.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"215 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121029805","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}