Pub Date : 2008-06-07DOI: 10.1109/ICNNSP.2008.4590400
Xinghai Yang, Dapeng Zhang, Zhiquan Bai
In this paper, we mainly analyze the performance of the classical time hopping bipolar pulse amplitude modulation (TH-BPAM) ultra wideband system and its coded system in the multi-user case. The performance of TH-BPAM system is analyzed in detail over an ideal AWGN channel and correlation receiver. For the proposed coded scheme, the Viterbi algorithm (VA) and soft output Viterbi algorithm (SOVA) are employed in the decoding process and the upper bound and lower bound of bit error probability is presented. The analysis shows that TH-BPAM suffers performance degradation with respect to the coded TH-BPAM greatly. Furthermore, we give the computer simulation and our simulation results also prove our theoretical analysis.
{"title":"On the comparison of the multi-user TH-BPAM UWB system and its coded schemes","authors":"Xinghai Yang, Dapeng Zhang, Zhiquan Bai","doi":"10.1109/ICNNSP.2008.4590400","DOIUrl":"https://doi.org/10.1109/ICNNSP.2008.4590400","url":null,"abstract":"In this paper, we mainly analyze the performance of the classical time hopping bipolar pulse amplitude modulation (TH-BPAM) ultra wideband system and its coded system in the multi-user case. The performance of TH-BPAM system is analyzed in detail over an ideal AWGN channel and correlation receiver. For the proposed coded scheme, the Viterbi algorithm (VA) and soft output Viterbi algorithm (SOVA) are employed in the decoding process and the upper bound and lower bound of bit error probability is presented. The analysis shows that TH-BPAM suffers performance degradation with respect to the coded TH-BPAM greatly. Furthermore, we give the computer simulation and our simulation results also prove our theoretical analysis.","PeriodicalId":250993,"journal":{"name":"2008 International Conference on Neural Networks and Signal Processing","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123950938","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 : 2008-06-07DOI: 10.1109/ICNNSP.2008.4590438
Ying Zhang, Tingzhi Shen
An object based fast search motion estimation algorithm is considered to be efficient since the computation of motion search can concentrate on blocks with moving object. However, the computational complexity of object segmentation is still too high to be applied on fast search motion estimation. In this paper, we propose an adaptive block classification algorithm. With this method, the fast search algorithm for motion estimation can make use of characteristics of motion information of the sequence being coded efficiently. In our approach, the statistical information which features the motion activities of the blocks in the previous frame is used to predict the characteristics of the motion activities of the blocks in the current frame. This is to re-assign the computation of motion search to locations that deserve to be searched more than others. Extensive experimental work has been done, results of which show that the adaptive block classification approach can accelerate the current fast search motion estimation algorithm with little decrease (0.01 dB to 0.09 dB for 8 standard test sequences) or sometimes, even increase (0.01 dB to 0.17 dB for 10 other standard test sequences) on resultant video quality, the peak signal-to-noise ratio (PSNR), while our fast algorithm is 150 times over the exhaustive full search algorithm on average.
基于目标的快速搜索运动估计算法是一种高效的运动估计算法，因为运动搜索的计算可以集中在具有运动目标的块上。然而，目标分割的计算复杂度仍然太高，无法应用于快速搜索运动估计。本文提出了一种自适应块分类算法。该方法使运动估计的快速搜索算法能够有效地利用被编码序列的运动信息特征。在我们的方法中，使用前一帧中块的运动活动特征的统计信息来预测当前帧中块的运动活动特征。这是将运动搜索的计算重新分配到值得搜索的位置。大量的实验结果表明，自适应块分类方法可以使现有快速搜索运动估计算法的视频质量和峰值信噪比(PSNR)平均提高150倍，但效果不明显(8个标准测试序列为0.01 dB ~ 0.09 dB)，有时甚至可以提高(其他10个标准测试序列为0.01 dB ~ 0.17 dB)。
{"title":"Motion information based adaptive block classification for fast motion estimation","authors":"Ying Zhang, Tingzhi Shen","doi":"10.1109/ICNNSP.2008.4590438","DOIUrl":"https://doi.org/10.1109/ICNNSP.2008.4590438","url":null,"abstract":"An object based fast search motion estimation algorithm is considered to be efficient since the computation of motion search can concentrate on blocks with moving object. However, the computational complexity of object segmentation is still too high to be applied on fast search motion estimation. In this paper, we propose an adaptive block classification algorithm. With this method, the fast search algorithm for motion estimation can make use of characteristics of motion information of the sequence being coded efficiently. In our approach, the statistical information which features the motion activities of the blocks in the previous frame is used to predict the characteristics of the motion activities of the blocks in the current frame. This is to re-assign the computation of motion search to locations that deserve to be searched more than others. Extensive experimental work has been done, results of which show that the adaptive block classification approach can accelerate the current fast search motion estimation algorithm with little decrease (0.01 dB to 0.09 dB for 8 standard test sequences) or sometimes, even increase (0.01 dB to 0.17 dB for 10 other standard test sequences) on resultant video quality, the peak signal-to-noise ratio (PSNR), while our fast algorithm is 150 times over the exhaustive full search algorithm on average.","PeriodicalId":250993,"journal":{"name":"2008 International Conference on Neural Networks and Signal Processing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124277985","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 : 2008-06-07DOI: 10.1109/ICNNSP.2008.4590434
X. Jing, W. Siu, Lap-Pui Chau, A. Constantinides
In this paper, we present a fast mode decision method for H.263 to H.264/AVC intraframe transcoding. The proposed algorithm is based on the observation that features of DCT coefficients extracted from H.263 coded intraframe strongly relates to the optimal mode in H.264/AVC intra mode decision. Specifically, the total number of non-zero AC coefficients of four 8times8 DCT blocks in H.263 is taken as a measurement in the intra block size decision. The objective is to reject improbable block types in earlier stages in order to achieve computation saving. In addition, a transform domain edge direction estimation is also adopted into our scheme to further speed up the intra mode prediction. Simulation results show that the proposed approach can reduce the computational complexity of intraframe transcoding by up to 65% while maintaining the rate-distortion (R-D) performance.
{"title":"Fast intra mode decision algorithm for H.263 to H.264/AVC transcoding","authors":"X. Jing, W. Siu, Lap-Pui Chau, A. Constantinides","doi":"10.1109/ICNNSP.2008.4590434","DOIUrl":"https://doi.org/10.1109/ICNNSP.2008.4590434","url":null,"abstract":"In this paper, we present a fast mode decision method for H.263 to H.264/AVC intraframe transcoding. The proposed algorithm is based on the observation that features of DCT coefficients extracted from H.263 coded intraframe strongly relates to the optimal mode in H.264/AVC intra mode decision. Specifically, the total number of non-zero AC coefficients of four 8times8 DCT blocks in H.263 is taken as a measurement in the intra block size decision. The objective is to reject improbable block types in earlier stages in order to achieve computation saving. In addition, a transform domain edge direction estimation is also adopted into our scheme to further speed up the intra mode prediction. Simulation results show that the proposed approach can reduce the computational complexity of intraframe transcoding by up to 65% while maintaining the rate-distortion (R-D) performance.","PeriodicalId":250993,"journal":{"name":"2008 International Conference on Neural Networks and Signal Processing","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122903814","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 : 2008-06-07DOI: 10.1109/ICNNSP.2008.4590420
Chuan-jiang Yan, Fang-ming Zhao, Wei Wang, Di He
In this paper, channel allocation scheme is studied for overlay wireless networks to optimize connection-level QoS. The contributions of our work are threefold. First, channel allocation scheme using both horizontal channel borrowing and vertical channel borrowing is presented and analyzed. When all the channels in a given cell are used, handoff requests can borrow channels from adjacent homogeneous cells. In case that the horizontal borrowing requests fail, handoff requests may also borrow channels from heterogeneous cells. Second, to further improve the system performance, other priority strategies such as channel reservation and pre-emptive priority are introduced. And third, to meet the high QoS requirements of some services and increase the utilization of radio resources, certain services can be transformed between real-time services and non-real-time services as necessary. Simulation results demonstrate that the proposed schemes can improve system performance.
{"title":"A pre-emptive channel borrowing scheme and performance analysis for wireless overlay networks","authors":"Chuan-jiang Yan, Fang-ming Zhao, Wei Wang, Di He","doi":"10.1109/ICNNSP.2008.4590420","DOIUrl":"https://doi.org/10.1109/ICNNSP.2008.4590420","url":null,"abstract":"In this paper, channel allocation scheme is studied for overlay wireless networks to optimize connection-level QoS. The contributions of our work are threefold. First, channel allocation scheme using both horizontal channel borrowing and vertical channel borrowing is presented and analyzed. When all the channels in a given cell are used, handoff requests can borrow channels from adjacent homogeneous cells. In case that the horizontal borrowing requests fail, handoff requests may also borrow channels from heterogeneous cells. Second, to further improve the system performance, other priority strategies such as channel reservation and pre-emptive priority are introduced. And third, to meet the high QoS requirements of some services and increase the utilization of radio resources, certain services can be transformed between real-time services and non-real-time services as necessary. Simulation results demonstrate that the proposed schemes can improve system performance.","PeriodicalId":250993,"journal":{"name":"2008 International Conference on Neural Networks and Signal Processing","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129016980","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 : 2008-06-07DOI: 10.1109/ICNNSP.2008.4590390
Jihong Liu, Soo-Young Lee
Feature selection is an important processing step in machine learning. Most used feature selection methods choose top-ranking features without considering the relationships among features. In this paper, the signification of feature selection is introduced, and the goal and evaluation criteria of feature selection are analyzed. The coalitional game theory related to the feature selection is explained. An algorithm of coalitional game based feature selection (CGFS) is presented. This work focus on selecting a sub-feature set in which the selected features are coalitional and relevant in order to obtain better classification performance. The experimental results show that CGFS obtains better performance than MI.
{"title":"Study on feature select based on coalitional game","authors":"Jihong Liu, Soo-Young Lee","doi":"10.1109/ICNNSP.2008.4590390","DOIUrl":"https://doi.org/10.1109/ICNNSP.2008.4590390","url":null,"abstract":"Feature selection is an important processing step in machine learning. Most used feature selection methods choose top-ranking features without considering the relationships among features. In this paper, the signification of feature selection is introduced, and the goal and evaluation criteria of feature selection are analyzed. The coalitional game theory related to the feature selection is explained. An algorithm of coalitional game based feature selection (CGFS) is presented. This work focus on selecting a sub-feature set in which the selected features are coalitional and relevant in order to obtain better classification performance. The experimental results show that CGFS obtains better performance than MI.","PeriodicalId":250993,"journal":{"name":"2008 International Conference on Neural Networks and Signal Processing","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128594577","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 : 2008-06-07DOI: 10.1109/ICNNSP.2008.4590302
Yi Shen, Wenjiang Pei, Tao Li, Jiming Liu, Lei Yang, Shao-ping Wang, Zhenya He
Thermal conduction physical method based on finite element model (FEM) is utilized in searching for the shortest path between two nodes in complex networks. The thermal flux matrix of nodes is constructed, and the element with the maximal value in each node thermal flux vector indicates one section of the shortest path to the source node. Theoretical analysis and experimental results show that the strategy can avoid the problem of bringing high flux of inquiring data packet into network and the correct shortest path form source node to any other nodes can be found simultaneously. The shortest path from the source node to any other nodes can be found in time O(mt/Deltat), where m is the number of edges, t is the conduction time, Deltat is the integral interval, which is essentially in linear time with m, and all the shortest path between any two nodes can be found in time O(nmt/2Deltat).
{"title":"Exploring complex networks by thermal flux spreading","authors":"Yi Shen, Wenjiang Pei, Tao Li, Jiming Liu, Lei Yang, Shao-ping Wang, Zhenya He","doi":"10.1109/ICNNSP.2008.4590302","DOIUrl":"https://doi.org/10.1109/ICNNSP.2008.4590302","url":null,"abstract":"Thermal conduction physical method based on finite element model (FEM) is utilized in searching for the shortest path between two nodes in complex networks. The thermal flux matrix of nodes is constructed, and the element with the maximal value in each node thermal flux vector indicates one section of the shortest path to the source node. Theoretical analysis and experimental results show that the strategy can avoid the problem of bringing high flux of inquiring data packet into network and the correct shortest path form source node to any other nodes can be found simultaneously. The shortest path from the source node to any other nodes can be found in time O(mt/Deltat), where m is the number of edges, t is the conduction time, Deltat is the integral interval, which is essentially in linear time with m, and all the shortest path between any two nodes can be found in time O(nmt/2Deltat).","PeriodicalId":250993,"journal":{"name":"2008 International Conference on Neural Networks and Signal Processing","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124445304","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 : 2008-06-07DOI: 10.1109/ICNNSP.2008.4590396
Fang-ming Zhao, Ling-ge Jiang, Chen He
For a wireless cell, the arrival rate and the proportion of different kind of service are diverse on distinct time in a day. This means that single resource allocation method can not efficiently utilize the radio resource all the time. Taking these matters into account, a policy-based radio resource allocation scheme is presented, in which the characteristic of wireless traffic is analyzed and the corresponding traffic model is described. To improve system performance, different channel allocation algorithms and channel allocation strategies are introduced. Their combinations form a series of policies. These policies are put into a policy list and constitute a policy-based channel allocation scheme. According to defined conditions such as network load, system can dynamically choose appropriate policy from the policy list. Simulation results demonstrate that better system performance can be improved by using policy mechanism, e.g. policy mechanism can lower blocking probability.
{"title":"Policy-based radio resource allocation for wireless mobile networks","authors":"Fang-ming Zhao, Ling-ge Jiang, Chen He","doi":"10.1109/ICNNSP.2008.4590396","DOIUrl":"https://doi.org/10.1109/ICNNSP.2008.4590396","url":null,"abstract":"For a wireless cell, the arrival rate and the proportion of different kind of service are diverse on distinct time in a day. This means that single resource allocation method can not efficiently utilize the radio resource all the time. Taking these matters into account, a policy-based radio resource allocation scheme is presented, in which the characteristic of wireless traffic is analyzed and the corresponding traffic model is described. To improve system performance, different channel allocation algorithms and channel allocation strategies are introduced. Their combinations form a series of policies. These policies are put into a policy list and constitute a policy-based channel allocation scheme. According to defined conditions such as network load, system can dynamically choose appropriate policy from the policy list. Simulation results demonstrate that better system performance can be improved by using policy mechanism, e.g. policy mechanism can lower blocking probability.","PeriodicalId":250993,"journal":{"name":"2008 International Conference on Neural Networks and Signal Processing","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124731294","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 : 2008-06-07DOI: 10.1109/ICNNSP.2008.4590429
Tang Yongli, Hu Xinyue, L. Congdong
Task performance evaluation for virtual organizations (VOs) with incomplete and uncertain information about the partners and their performance is investigated. Task performance criteria hierarchy for VOs is established, which is comprised of the quality indicators, the cost indicators, the cooperative satisfaction indicators and the other task-specific indicators. Task performance evaluation approach is constructed based on fuzzy evaluation method. The proposed approach is composed of 6 steps: establish task evaluation criteria hierarchy; develop the scoring scale and standards; determine the weights of the criteria; obtain the fuzzy relation matrixes; compute the fuzzy synthetic evaluation vector; and aggregate task performance indicator value. A numerical example is given to illustrate the proposed approach. The task performance evaluation results can be used as the basis of task performance control and incentive mechanisms for VOs.
{"title":"Task performance evaluation for virtual organizations","authors":"Tang Yongli, Hu Xinyue, L. Congdong","doi":"10.1109/ICNNSP.2008.4590429","DOIUrl":"https://doi.org/10.1109/ICNNSP.2008.4590429","url":null,"abstract":"Task performance evaluation for virtual organizations (VOs) with incomplete and uncertain information about the partners and their performance is investigated. Task performance criteria hierarchy for VOs is established, which is comprised of the quality indicators, the cost indicators, the cooperative satisfaction indicators and the other task-specific indicators. Task performance evaluation approach is constructed based on fuzzy evaluation method. The proposed approach is composed of 6 steps: establish task evaluation criteria hierarchy; develop the scoring scale and standards; determine the weights of the criteria; obtain the fuzzy relation matrixes; compute the fuzzy synthetic evaluation vector; and aggregate task performance indicator value. A numerical example is given to illustrate the proposed approach. The task performance evaluation results can be used as the basis of task performance control and incentive mechanisms for VOs.","PeriodicalId":250993,"journal":{"name":"2008 International Conference on Neural Networks and Signal Processing","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121289897","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 : 2008-06-07DOI: 10.1109/ICNNSP.2008.4590349
Jianliang Zhu, Shouqiang Kang, Yujing Wang
According to the drive-respond synchronization method presented by Pecora and Carroll, chaotic masking communication circuits, which generate butterfly-scroll attractor, are designed, and masking principle is analyzed. Computer simulation has been done to the butterfly-scroll attractor of the circuit, and experimental study to the hardware circuitry of the chaotic secure communications, the element parameters and waveforms are presented. The results show that the chaotic circuit can realize secure communication, when the frequency of the input square wave signal is less than 20 MHZ.
{"title":"Butterfly-scroll attractor secure communication design and implementation","authors":"Jianliang Zhu, Shouqiang Kang, Yujing Wang","doi":"10.1109/ICNNSP.2008.4590349","DOIUrl":"https://doi.org/10.1109/ICNNSP.2008.4590349","url":null,"abstract":"According to the drive-respond synchronization method presented by Pecora and Carroll, chaotic masking communication circuits, which generate butterfly-scroll attractor, are designed, and masking principle is analyzed. Computer simulation has been done to the butterfly-scroll attractor of the circuit, and experimental study to the hardware circuitry of the chaotic secure communications, the element parameters and waveforms are presented. The results show that the chaotic circuit can realize secure communication, when the frequency of the input square wave signal is less than 20 MHZ.","PeriodicalId":250993,"journal":{"name":"2008 International Conference on Neural Networks and Signal Processing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116502258","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 : 2008-06-07DOI: 10.1109/ICNNSP.2008.4590368
Y. Cen, L. Cen
Polyphase matrix extension of the scaling vector functions plays an important role in the construction of compactly supported biorthogonal multiwavelets. However, the involved computations are rather complex, and there is no unified, direct formula available so far. In this paper, by studying the canonical forms and the product preserving transformations of the polyphase matrices, an abstract algebraic approach for the matrix extension problem is proposed. More important, explicit formulas for the construction problem are represented via the submatrices of the polyphase matrices of scaling vector functions directly. Furthermore, complete solution set can be obtained from these explicit formulas via product preserving transformations. Computational examples demonstrate that by using the explicit formulas, our matrix extension algorithm is direct and effective.
{"title":"Explicit construction of compactly supported biorthogonal multiwavelets based on the matrix extension","authors":"Y. Cen, L. Cen","doi":"10.1109/ICNNSP.2008.4590368","DOIUrl":"https://doi.org/10.1109/ICNNSP.2008.4590368","url":null,"abstract":"Polyphase matrix extension of the scaling vector functions plays an important role in the construction of compactly supported biorthogonal multiwavelets. However, the involved computations are rather complex, and there is no unified, direct formula available so far. In this paper, by studying the canonical forms and the product preserving transformations of the polyphase matrices, an abstract algebraic approach for the matrix extension problem is proposed. More important, explicit formulas for the construction problem are represented via the submatrices of the polyphase matrices of scaling vector functions directly. Furthermore, complete solution set can be obtained from these explicit formulas via product preserving transformations. Computational examples demonstrate that by using the explicit formulas, our matrix extension algorithm is direct and effective.","PeriodicalId":250993,"journal":{"name":"2008 International Conference on Neural Networks and Signal Processing","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124180162","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
扫码关注我们
求助内容：
应助结果提醒方式：