Pub Date : 2019-10-01DOI: 10.1109/pacrim.2009.5291411
Yanguo Liu, T. Ohkawa, Hazem Abbas, Mohamed Abdullah Pan Agathoklis, Amir Aghaei, M. Bouguessa, Ryan E. Grant, Amir H. Heidari, S. Inoue, Sebastian Isaza, Nadzir Marsono, Pacrim, M. Mehrandezh, Alexei Nordell-Markovits, C. Olson, S. Phithakkitnukoon, A. Qureshi, Mohammad J. Rashti
{"title":"Technical program committee members","authors":"Yanguo Liu, T. Ohkawa, Hazem Abbas, Mohamed Abdullah Pan Agathoklis, Amir Aghaei, M. Bouguessa, Ryan E. Grant, Amir H. Heidari, S. Inoue, Sebastian Isaza, Nadzir Marsono, Pacrim, M. Mehrandezh, Alexei Nordell-Markovits, C. Olson, S. Phithakkitnukoon, A. Qureshi, Mohammad J. Rashti","doi":"10.1109/pacrim.2009.5291411","DOIUrl":"https://doi.org/10.1109/pacrim.2009.5291411","url":null,"abstract":"","PeriodicalId":217751,"journal":{"name":"2009 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130479798","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-23DOI: 10.1109/PACRIM.2009.5291358
Enming Luo, O. Au, Liwei Guo, Yannan Wu, S. Tu
Recently, many schemes that embed the denoising process into the video encoding have been proposed. They are mainly implemented into the single-layer encoder, like the H.264 reference encoder JointModel(JM). In this paper, we propose to embed the denoising process into the multi-layer spatial SVC encoder. Since either for the base layer or the enhancement layer our proposed filter could achieve Linear Minimum Mean Square Error(LMMSE) and meanwhile the additional inter-layer prediction tools could be utilized, the encoder performance can be largely improved. The experimental results show that the multi-layer embedded approach can remove most of the noise while achieving spatial scalability. And the R-D curve shows the optional use of inter-layer prediction tools can help yield better denoising performance and coding efficiency.
{"title":"Embedded denoising for the H.264/AVC extension-spatial SVC","authors":"Enming Luo, O. Au, Liwei Guo, Yannan Wu, S. Tu","doi":"10.1109/PACRIM.2009.5291358","DOIUrl":"https://doi.org/10.1109/PACRIM.2009.5291358","url":null,"abstract":"Recently, many schemes that embed the denoising process into the video encoding have been proposed. They are mainly implemented into the single-layer encoder, like the H.264 reference encoder JointModel(JM). In this paper, we propose to embed the denoising process into the multi-layer spatial SVC encoder. Since either for the base layer or the enhancement layer our proposed filter could achieve Linear Minimum Mean Square Error(LMMSE) and meanwhile the additional inter-layer prediction tools could be utilized, the encoder performance can be largely improved. The experimental results show that the multi-layer embedded approach can remove most of the noise while achieving spatial scalability. And the R-D curve shows the optional use of inter-layer prediction tools can help yield better denoising performance and coding efficiency.","PeriodicalId":217751,"journal":{"name":"2009 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115267584","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-23DOI: 10.1109/PACRIM.2009.5291351
Y. Abdel-Hamid, F. Gebali, T. Gulliver
In this paper, we present a simple and realistic two-class QoS model for random access systems. This model provides a general and effective approach to QoS classification by categorizing the available resources into distinct service classes. We present a simple Markov model of the subscriber stations to define the system transitions and state probabilities. Performance metrics based on random access success probabilities, average throughput and acceptance probabilities are investigated. This model provides a useful analytical tool for most contention systems that utilize random access as a mechanism for network entry, resource acquisition and contention-based or best effort data transmission. For example, the IEEE 802.16 bandwidth request and initial ranging mechanisms in the uplink contention channel. For simplicity, we consider only two classes, however the technique can easily be extended to any number of classes.
{"title":"A QoS model for random access systems with multiple request classes","authors":"Y. Abdel-Hamid, F. Gebali, T. Gulliver","doi":"10.1109/PACRIM.2009.5291351","DOIUrl":"https://doi.org/10.1109/PACRIM.2009.5291351","url":null,"abstract":"In this paper, we present a simple and realistic two-class QoS model for random access systems. This model provides a general and effective approach to QoS classification by categorizing the available resources into distinct service classes. We present a simple Markov model of the subscriber stations to define the system transitions and state probabilities. Performance metrics based on random access success probabilities, average throughput and acceptance probabilities are investigated. This model provides a useful analytical tool for most contention systems that utilize random access as a mechanism for network entry, resource acquisition and contention-based or best effort data transmission. For example, the IEEE 802.16 bandwidth request and initial ranging mechanisms in the uplink contention channel. For simplicity, we consider only two classes, however the technique can easily be extended to any number of classes.","PeriodicalId":217751,"journal":{"name":"2009 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"478 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124261454","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-23DOI: 10.1109/PACRIM.2009.5291266
N. Khosroshahi, T. Gulliver
In this paper, we consider the performance of a dedicated short range communication (DSRC) system for intervehicle communications (IVC). The DSRC standard employs convolutional codes for forward error correction (FEC). The performance of the DSRC system is evaluated in three different channels with convolutional codes and regular LDPC codes. In addition, we compare the complexity of these codes. It is shown that LDPC codes provide a significant improvement in performance with similar complexity to convolutional codes.
{"title":"Low density parity check codes for dedicated short range communication (DSRC) systems","authors":"N. Khosroshahi, T. Gulliver","doi":"10.1109/PACRIM.2009.5291266","DOIUrl":"https://doi.org/10.1109/PACRIM.2009.5291266","url":null,"abstract":"In this paper, we consider the performance of a dedicated short range communication (DSRC) system for intervehicle communications (IVC). The DSRC standard employs convolutional codes for forward error correction (FEC). The performance of the DSRC system is evaluated in three different channels with convolutional codes and regular LDPC codes. In addition, we compare the complexity of these codes. It is shown that LDPC codes provide a significant improvement in performance with similar complexity to convolutional codes.","PeriodicalId":217751,"journal":{"name":"2009 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125186892","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-23DOI: 10.1109/PACRIM.2009.5291241
W. Lai, Yvonne Lai
Private Network-Network Interface (PNNI) is a routing protocol standard developed by the ATM Forum for the connection-oriented ATM networking technology. Open Shortest Path First (OSPF) and Border Gateway Protocol (BGP) are the corresponding IETF standards for connectionless IP networks. In this paper, we compare the hierarchical routing properties of these two sets of routing protocols.
{"title":"Hierarchical routing by PNNI and OSPF/BGP","authors":"W. Lai, Yvonne Lai","doi":"10.1109/PACRIM.2009.5291241","DOIUrl":"https://doi.org/10.1109/PACRIM.2009.5291241","url":null,"abstract":"Private Network-Network Interface (PNNI) is a routing protocol standard developed by the ATM Forum for the connection-oriented ATM networking technology. Open Shortest Path First (OSPF) and Border Gateway Protocol (BGP) are the corresponding IETF standards for connectionless IP networks. In this paper, we compare the hierarchical routing properties of these two sets of routing protocols.","PeriodicalId":217751,"journal":{"name":"2009 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"214 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115985046","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-23DOI: 10.1109/PACRIM.2009.5291233
S. Gopalakrishnan
A real-time system is characterized by computational tasks that need to complete within well-defined time durations. Scheduling policies help guarantee deadlines, but scheduling policies and the analysis associated with them need exact information to guarantee timing correctness. This exact information includes the worst-case execution time of tasks in the system. Existing architecture techniques (caches, superscalar out-of-order execution) improve the average case performance of a computer system but complicate the estimation of worst-case execution times. In the talk I will discuss some recent techniques for estimating WCETs and some techniques for more predictable execution, including the use of scratchpad memories.
{"title":"Architectural support for greater predictability in real-time systems","authors":"S. Gopalakrishnan","doi":"10.1109/PACRIM.2009.5291233","DOIUrl":"https://doi.org/10.1109/PACRIM.2009.5291233","url":null,"abstract":"A real-time system is characterized by computational tasks that need to complete within well-defined time durations. Scheduling policies help guarantee deadlines, but scheduling policies and the analysis associated with them need exact information to guarantee timing correctness. This exact information includes the worst-case execution time of tasks in the system. Existing architecture techniques (caches, superscalar out-of-order execution) improve the average case performance of a computer system but complicate the estimation of worst-case execution times. In the talk I will discuss some recent techniques for estimating WCETs and some techniques for more predictable execution, including the use of scratchpad memories.","PeriodicalId":217751,"journal":{"name":"2009 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"23 15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116124892","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-23DOI: 10.1109/PACRIM.2009.5291300
Jie Zhu, A. Çuhadar
We propose an error-resilient multiple-description (MD) video coding algorithm based on three-dimensional (3-D) Set Partitioning in Hierarchical Trees (SPIHT). In this approach, the wavelet transform coefficients are divided into multiple independent substreams that are separately transmitted over error-prone networks. Compared to other MD video coders based on 3-D SPIHT, the novelty of the proposed approach is the injection of additional redundancy into the substreams so that the coefficients in the spatial root subband are protected highly during the transmission. As a consequence, spatial root subband coefficients that are missing due to transmission errors are recovered at the decoder with a high accuracy. Simulation results on different video sequences show that the proposed method maintains error resilience with high coding efficiency. In particular, our results demonstrate that the proposed algorithm achieves a significant improvement on video quality by up to 3.35 dB in the presence of a substream loss compared to the existing MD video coders that use 3-D SPIHT.
{"title":"Error-resilient multiple-description video coding with 3-D SPIHT","authors":"Jie Zhu, A. Çuhadar","doi":"10.1109/PACRIM.2009.5291300","DOIUrl":"https://doi.org/10.1109/PACRIM.2009.5291300","url":null,"abstract":"We propose an error-resilient multiple-description (MD) video coding algorithm based on three-dimensional (3-D) Set Partitioning in Hierarchical Trees (SPIHT). In this approach, the wavelet transform coefficients are divided into multiple independent substreams that are separately transmitted over error-prone networks. Compared to other MD video coders based on 3-D SPIHT, the novelty of the proposed approach is the injection of additional redundancy into the substreams so that the coefficients in the spatial root subband are protected highly during the transmission. As a consequence, spatial root subband coefficients that are missing due to transmission errors are recovered at the decoder with a high accuracy. Simulation results on different video sequences show that the proposed method maintains error resilience with high coding efficiency. In particular, our results demonstrate that the proposed algorithm achieves a significant improvement on video quality by up to 3.35 dB in the presence of a substream loss compared to the existing MD video coders that use 3-D SPIHT.","PeriodicalId":217751,"journal":{"name":"2009 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114485889","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-23DOI: 10.1109/PACRIM.2009.5291396
M. Torabi, D. Haccoun, W. Ajib
In this paper, we present a performance analysis for the channel capacity and outage probability of the user scheduling for multiuser multiple-input multiple-output (MIMO) systems with maximum ratio combining (MRC) exploiting the user and antenna diversities. We consider two scheduling schemes: absolute SNR-based and normalized SNR-based scheduling schemes. We propose the utilization of a transmit antenna selection scheme in multiuser MIMO systems in order to overcome the drawback of channel hardening and also to improve the system performance. We derive new closed-form expressions for the outage probability and average channel capacity of the presented schemes for two scenarios: Heterogeneous (independent non-identically distributed SNRs- i.ni.d.) and Homogeneous (independent identically distributed SNRs- i.i.d.) cases. Using mathematical analysis and numerical simulations, we compare the performances of presented schemes.
{"title":"Capacity and outage probability analysis of multiuser diversity in MIMO MRC systems with transmit antenna selection","authors":"M. Torabi, D. Haccoun, W. Ajib","doi":"10.1109/PACRIM.2009.5291396","DOIUrl":"https://doi.org/10.1109/PACRIM.2009.5291396","url":null,"abstract":"In this paper, we present a performance analysis for the channel capacity and outage probability of the user scheduling for multiuser multiple-input multiple-output (MIMO) systems with maximum ratio combining (MRC) exploiting the user and antenna diversities. We consider two scheduling schemes: absolute SNR-based and normalized SNR-based scheduling schemes. We propose the utilization of a transmit antenna selection scheme in multiuser MIMO systems in order to overcome the drawback of channel hardening and also to improve the system performance. We derive new closed-form expressions for the outage probability and average channel capacity of the presented schemes for two scenarios: Heterogeneous (independent non-identically distributed SNRs- i.ni.d.) and Homogeneous (independent identically distributed SNRs- i.i.d.) cases. Using mathematical analysis and numerical simulations, we compare the performances of presented schemes.","PeriodicalId":217751,"journal":{"name":"2009 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123962587","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-23DOI: 10.1109/PACRIM.2009.5291397
Chao-Cheng Tu, B. Champagne
This paper studies convergence properties of subspace trackers using orthogonal iteration. In the context of blind estimation of a time-varying channel, orthogonal iteration and its variants have been widely considered for tracking the channel parameters by updating the eigendecomposition of an exponentially weighted correlation matrix. While it is well known that orthogonal iteration converges exponentially with arbitrary initial conditions, orthogonal-iteration-based subspace trackers can only inherit these merits when the channels considered undergo extremely slow time-variations. In this paper, we generalize the traditional (i.e. fixed subspace) convergence analysis of the orthogonal iteration to include non-stationary situations as well. We use the results to investigate the convergence behavior of subspace trackers based on orthogonal iteration under slow, moderate and rapid time-variations of the underlying subspace. In the latter case, we expose a fundamental limitation of the orthogonal iteration, i.e. practical limit on subspace variations to ensure effective tracking.
{"title":"On convergence properties of subspace trackers based on orthogonal iteration","authors":"Chao-Cheng Tu, B. Champagne","doi":"10.1109/PACRIM.2009.5291397","DOIUrl":"https://doi.org/10.1109/PACRIM.2009.5291397","url":null,"abstract":"This paper studies convergence properties of subspace trackers using orthogonal iteration. In the context of blind estimation of a time-varying channel, orthogonal iteration and its variants have been widely considered for tracking the channel parameters by updating the eigendecomposition of an exponentially weighted correlation matrix. While it is well known that orthogonal iteration converges exponentially with arbitrary initial conditions, orthogonal-iteration-based subspace trackers can only inherit these merits when the channels considered undergo extremely slow time-variations. In this paper, we generalize the traditional (i.e. fixed subspace) convergence analysis of the orthogonal iteration to include non-stationary situations as well. We use the results to investigate the convergence behavior of subspace trackers based on orthogonal iteration under slow, moderate and rapid time-variations of the underlying subspace. In the latter case, we expose a fundamental limitation of the orthogonal iteration, i.e. practical limit on subspace variations to ensure effective tracking.","PeriodicalId":217751,"journal":{"name":"2009 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123568862","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-23DOI: 10.1109/PACRIM.2009.5291339
Sébastien Herry, C. L. Le Martret
In this paper, we investigate a solution to work out the parameters of a secondary user network composed of cognitive radios that fit into spectrum holes offered by primary user networks. The parameters considered here for each cognitive radio are the carrier frequency, the bandwidth, the transmit power and the modulation/coding format schemes. We first derive a unique cost function for the optimization problem that takes into account the constraints. Then, we investigate the use of genetic algorithm to resolve the optimization problem and show the secondary network parameters obtained after convergence.
{"title":"Parameter determination of secondary user cognitive radio network using genetic algorithm","authors":"Sébastien Herry, C. L. Le Martret","doi":"10.1109/PACRIM.2009.5291339","DOIUrl":"https://doi.org/10.1109/PACRIM.2009.5291339","url":null,"abstract":"In this paper, we investigate a solution to work out the parameters of a secondary user network composed of cognitive radios that fit into spectrum holes offered by primary user networks. The parameters considered here for each cognitive radio are the carrier frequency, the bandwidth, the transmit power and the modulation/coding format schemes. We first derive a unique cost function for the optimization problem that takes into account the constraints. Then, we investigate the use of genetic algorithm to resolve the optimization problem and show the secondary network parameters obtained after convergence.","PeriodicalId":217751,"journal":{"name":"2009 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124097563","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
扫码关注我们
求助内容：
应助结果提醒方式：