Pub Date : 2005-12-21DOI: 10.1109/ISSPIT.2005.1577109
Atsushi Honda, A. Kawanaka
A novel wavelet coding scheme for 2-dimensional data which are defined on the arbitrarily shaped regions and are including the expanded nodes is proposed. A polygonal mesh coding method has been proposed, which has used the assignment procedure of the vertices constructing the polygonal mesh to nodes on 2-D regular mesh. In the 2-D structuring procedure a vertex are assigned to one or several nodes on the regular mesh plane for structuring a polygonal mesh with complex connectivity. And the structured geometry data have arbitrarily-shape on the 2-D regular mesh plane and are including the nodes which are connected to adjacent nodes but are not assigned the geometry. These nodes are called expanded nodes, and the nodes on which the geometry data were assigned are called representative node. In this paper we apply a lifting wavelet transform with the permuting process (PL-WT) for an expanded node at even locations and the neighboring representative node to reduce the correlations among representative nodes separated by the continuous expanded nodes. Experimental results for the 3-D model with complex connectivity show the proposed scheme gives better coding performance compared to the conventional scheme using SA-DWT and TAGC scheme adopted in MPEG-4
{"title":"Permuting and lifting wavelet coding for arbitrarily-shaped data with expanded nodes","authors":"Atsushi Honda, A. Kawanaka","doi":"10.1109/ISSPIT.2005.1577109","DOIUrl":"https://doi.org/10.1109/ISSPIT.2005.1577109","url":null,"abstract":"A novel wavelet coding scheme for 2-dimensional data which are defined on the arbitrarily shaped regions and are including the expanded nodes is proposed. A polygonal mesh coding method has been proposed, which has used the assignment procedure of the vertices constructing the polygonal mesh to nodes on 2-D regular mesh. In the 2-D structuring procedure a vertex are assigned to one or several nodes on the regular mesh plane for structuring a polygonal mesh with complex connectivity. And the structured geometry data have arbitrarily-shape on the 2-D regular mesh plane and are including the nodes which are connected to adjacent nodes but are not assigned the geometry. These nodes are called expanded nodes, and the nodes on which the geometry data were assigned are called representative node. In this paper we apply a lifting wavelet transform with the permuting process (PL-WT) for an expanded node at even locations and the neighboring representative node to reduce the correlations among representative nodes separated by the continuous expanded nodes. Experimental results for the 3-D model with complex connectivity show the proposed scheme gives better coding performance compared to the conventional scheme using SA-DWT and TAGC scheme adopted in MPEG-4","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131362189","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 : 2005-12-21DOI: 10.1109/ISSPIT.2005.1577081
H. T. Nguyen, G. Leus, N. Khaled
In mobile communications, time varying channels make the available channel information out of date. Timely updating the channel state is an obvious solution to improve the system performance in a time varying channel. However, a better knowledge of the channel comes at the cost of a decrease in the system throughput. Thus, predicting the future channel conditions can improve not only the performance but also the throughput of many types of wireless systems. This is especially true for a wireless system where multiple antennas are applied at both link ends. In this paper we propose and evaluate the performance of a prediction scheme for multiple input multiple output (MIMO) systems that apply spatial multiplexing. We aim at predicting the future precoder/decoder directly without going through the prediction of the channel matrix. The results show that in a slowly time varying channel an increase in the system performance by a factor of two is possible
{"title":"Prediction of the eigenvectors for spatial multiplexing MIMO systems in time-varying channels","authors":"H. T. Nguyen, G. Leus, N. Khaled","doi":"10.1109/ISSPIT.2005.1577081","DOIUrl":"https://doi.org/10.1109/ISSPIT.2005.1577081","url":null,"abstract":"In mobile communications, time varying channels make the available channel information out of date. Timely updating the channel state is an obvious solution to improve the system performance in a time varying channel. However, a better knowledge of the channel comes at the cost of a decrease in the system throughput. Thus, predicting the future channel conditions can improve not only the performance but also the throughput of many types of wireless systems. This is especially true for a wireless system where multiple antennas are applied at both link ends. In this paper we propose and evaluate the performance of a prediction scheme for multiple input multiple output (MIMO) systems that apply spatial multiplexing. We aim at predicting the future precoder/decoder directly without going through the prediction of the channel matrix. The results show that in a slowly time varying channel an increase in the system performance by a factor of two is possible","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"175 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131974612","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 : 2005-12-21DOI: 10.1109/ISSPIT.2005.1577072
Ehab Y. Abdel Maksoud, Reda A. Ammar
In this paper, we present a new heuristic algorithm to schedule a set of independent stochastic tasks with parallelizable contents in multiprocessor systems. Each task is described by its deadline and its time cost distribution, which is given in terms of mean and variance. A scheduled task may run as one unit on a single processor or partitioned into k parallel parts running on k different processors. The proposed algorithm exploits parallelism in tasks, if it is necessary, and distributes them among the available processors to yield a high probability of meeting their deadlines and, hence obtain better schedulability
{"title":"Scheduling stochastic tasks with parallelizable contents in multiprocessor systems","authors":"Ehab Y. Abdel Maksoud, Reda A. Ammar","doi":"10.1109/ISSPIT.2005.1577072","DOIUrl":"https://doi.org/10.1109/ISSPIT.2005.1577072","url":null,"abstract":"In this paper, we present a new heuristic algorithm to schedule a set of independent stochastic tasks with parallelizable contents in multiprocessor systems. Each task is described by its deadline and its time cost distribution, which is given in terms of mean and variance. A scheduled task may run as one unit on a single processor or partitioned into k parallel parts running on k different processors. The proposed algorithm exploits parallelism in tasks, if it is necessary, and distributes them among the available processors to yield a high probability of meeting their deadlines and, hence obtain better schedulability","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133927730","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 : 2005-12-21DOI: 10.1109/ISSPIT.2005.1577131
M. Matsumoto, S. Hashimoto
This paper introduces the direction of arrival estimation by a power inversion adaptive array (PIAA) method that utilizes the transfer characteristics of microphones located at a same place, namely aggregated microphones. In this paper, we firstly show that the microphone array system and the proposed aggregated microphone system can be described in the same framework. We then apply the PIAA method to the aggregated microphones and compare the proposed method with the microphone array. In the proposed method, all microphones are placed at the same place. Hence, it is easy to miniaturize the system. This feature is considered to be useful in the practical applications. We show the directional pattern of the PIAA utilizing aggregated microphones. We also show the results of the DOA estimation
{"title":"DOA estimation utilizing power inversion adaptive array by aggregated microphones","authors":"M. Matsumoto, S. Hashimoto","doi":"10.1109/ISSPIT.2005.1577131","DOIUrl":"https://doi.org/10.1109/ISSPIT.2005.1577131","url":null,"abstract":"This paper introduces the direction of arrival estimation by a power inversion adaptive array (PIAA) method that utilizes the transfer characteristics of microphones located at a same place, namely aggregated microphones. In this paper, we firstly show that the microphone array system and the proposed aggregated microphone system can be described in the same framework. We then apply the PIAA method to the aggregated microphones and compare the proposed method with the microphone array. In the proposed method, all microphones are placed at the same place. Hence, it is easy to miniaturize the system. This feature is considered to be useful in the practical applications. We show the directional pattern of the PIAA utilizing aggregated microphones. We also show the results of the DOA estimation","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114896903","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 : 2005-12-21DOI: 10.1109/ISSPIT.2005.1577215
N. Myridis
In this lecture we investigate the Hough transform (HuT) on geometrical (non-probabilistic) distributions, i.e. on loci of point set distributions in the spatial space. Such distributions are assumed to be linear, circular, spiral etc. The usefulness of the assumption of such distributions is multiple according to the existence of them in a huge variety of image processing problems. Furthermore we present innovative elements of HuT which may lead to the development of means for evaluating HuT of complicated geometrical figures
{"title":"The Hough transform (HuT) on geometrical distributions (geodistributions)","authors":"N. Myridis","doi":"10.1109/ISSPIT.2005.1577215","DOIUrl":"https://doi.org/10.1109/ISSPIT.2005.1577215","url":null,"abstract":"In this lecture we investigate the Hough transform (HuT) on geometrical (non-probabilistic) distributions, i.e. on loci of point set distributions in the spatial space. Such distributions are assumed to be linear, circular, spiral etc. The usefulness of the assumption of such distributions is multiple according to the existence of them in a huge variety of image processing problems. Furthermore we present innovative elements of HuT which may lead to the development of means for evaluating HuT of complicated geometrical figures","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"2650 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115030955","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 : 2005-12-21DOI: 10.1109/ISSPIT.2005.1577203
Y. Hasan, E. Mohammed
In this paper, we present a novel symmetric-key block cipher, with variable block and key lengths, referred to as PATFC (pseudorandom affine transformation-based Feistel cipher), suitable for software and hardware implementations. PATFC adopts the 3-round Luby-Rackoff construction (a compact form of the Feistel network structure) for fusing pseudorandom functions of the plaintext partitions to obtain a pseudorandom permutation. PATFC mainly makes use of a novel keyed pseudorandom function (PRF) that is based on a pseudorandom affine transformation (constructed using a highly nonlinear pseudorandom sequence generator) followed by a data and key dependent encoding and simple hash processes. Extensive statistical tests of PATFC and its underlying PRF consistently demonstrated their competitive diffusion, confusion and pseudorandomness characteristics. Furthermore, PATFC is probably secure and not vulnerable to known/chosen/adaptive plaintext/cipher text attacks
{"title":"PATFC: novel pseudorandom affine transformation-Based Feistel-network cipher","authors":"Y. Hasan, E. Mohammed","doi":"10.1109/ISSPIT.2005.1577203","DOIUrl":"https://doi.org/10.1109/ISSPIT.2005.1577203","url":null,"abstract":"In this paper, we present a novel symmetric-key block cipher, with variable block and key lengths, referred to as PATFC (pseudorandom affine transformation-based Feistel cipher), suitable for software and hardware implementations. PATFC adopts the 3-round Luby-Rackoff construction (a compact form of the Feistel network structure) for fusing pseudorandom functions of the plaintext partitions to obtain a pseudorandom permutation. PATFC mainly makes use of a novel keyed pseudorandom function (PRF) that is based on a pseudorandom affine transformation (constructed using a highly nonlinear pseudorandom sequence generator) followed by a data and key dependent encoding and simple hash processes. Extensive statistical tests of PATFC and its underlying PRF consistently demonstrated their competitive diffusion, confusion and pseudorandomness characteristics. Furthermore, PATFC is probably secure and not vulnerable to known/chosen/adaptive plaintext/cipher text attacks","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114574989","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 : 2005-12-21DOI: 10.1109/ISSPIT.2005.1577102
D. Serpanos, M. Gamvrili
Scheduling algorithms for virtual output queuing (VOQ) switches aim to provide high performance (low latency and high throughput), fairness as well as easy and low cost implementation. These goals have led to the development of a wide range of schedulers that are characterized by deterministic decision making. Randomness in decision making enables high performance scheduling as well as fair treatment of requests, when used appropriately. However, it has been proven to be costly in switching environments, which require high speed decisions, as the experience with the first randomized algorithm, namely PIM, is shown. In this paper, we introduce a class of practical scheduling algorithms that employ randomness in a fashion that leads to fast, low cost implementations. The class of algorithms, named random on-line matching (ROLM), employs randomness effectively, calculating maximal matchings and thus, leading to high performance schedulers with optimal mean service time that outperform significantly the competitive deterministic schedulers; furthermore, it employs randomness efficiently, resulting to schedulers that can accommodate effectively high-speed links
{"title":"Randomized on-line matching (ROLM): randomized scheduling algorithms for high-speed cell-based switches","authors":"D. Serpanos, M. Gamvrili","doi":"10.1109/ISSPIT.2005.1577102","DOIUrl":"https://doi.org/10.1109/ISSPIT.2005.1577102","url":null,"abstract":"Scheduling algorithms for virtual output queuing (VOQ) switches aim to provide high performance (low latency and high throughput), fairness as well as easy and low cost implementation. These goals have led to the development of a wide range of schedulers that are characterized by deterministic decision making. Randomness in decision making enables high performance scheduling as well as fair treatment of requests, when used appropriately. However, it has been proven to be costly in switching environments, which require high speed decisions, as the experience with the first randomized algorithm, namely PIM, is shown. In this paper, we introduce a class of practical scheduling algorithms that employ randomness in a fashion that leads to fast, low cost implementations. The class of algorithms, named random on-line matching (ROLM), employs randomness effectively, calculating maximal matchings and thus, leading to high performance schedulers with optimal mean service time that outperform significantly the competitive deterministic schedulers; furthermore, it employs randomness efficiently, resulting to schedulers that can accommodate effectively high-speed links","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121834159","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 : 2005-12-21DOI: 10.1109/ISSPIT.2005.1577179
E. Abdel-Raheem
This paper investigates computationally-efficient adaptive algorithms suitable for echo cancellation applications. Power-of-two (PO2) quantization for the error and/or regressor vector is added to a selective-partial-coefficient-update algorithm (SPCUA) to further reduce the amount of computations. A simple stop-and-go procedure is included to save more computations when the generated error magnitude is below a certain limit. Simulation results with comparisons are included to show the advantages of the improved algorithms
{"title":"On computationally-efficient NLMS-based algorithms for echo cancellation applications","authors":"E. Abdel-Raheem","doi":"10.1109/ISSPIT.2005.1577179","DOIUrl":"https://doi.org/10.1109/ISSPIT.2005.1577179","url":null,"abstract":"This paper investigates computationally-efficient adaptive algorithms suitable for echo cancellation applications. Power-of-two (PO2) quantization for the error and/or regressor vector is added to a selective-partial-coefficient-update algorithm (SPCUA) to further reduce the amount of computations. A simple stop-and-go procedure is included to save more computations when the generated error magnitude is below a certain limit. Simulation results with comparisons are included to show the advantages of the improved algorithms","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130567150","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 : 2005-12-21DOI: 10.1109/ISSPIT.2005.1577138
Zhijun Zhao, R. Blahut
Both blind and nonblind demodulation algorithms based on the Richardson-Lucy algorithm for the one-dimensional intersymbol interference channel with nonnegative impulse response function are proposed and compared numerically with the Viterbi demodulation algorithm and the demodulation algorithms based on the Wiener filter. Simulation results show that the demodulation algorithms based on the Richardson-Lucy algorithm have better bit error rate performance than the demodulation algorithms based on the Wiener filter. With the progressive thresholding, the bit error rate curves of both blind and nonblind Richardson-Lucy-based algorithms are within 0.3 dB from that of the Viterbi algorithm throughout the entire simulated signal-to-noise ratio range. While the complexity of the Viterbi algorithm depends critically on the length of the channel impulse response function, the complexity of the demodulation algorithms based on the Richardson-Lucy algorithm only weakly depends on it
{"title":"Blind and nonblind nonnegative impulse response ISI channel demodulation using the Richardson-Lucy algorithm","authors":"Zhijun Zhao, R. Blahut","doi":"10.1109/ISSPIT.2005.1577138","DOIUrl":"https://doi.org/10.1109/ISSPIT.2005.1577138","url":null,"abstract":"Both blind and nonblind demodulation algorithms based on the Richardson-Lucy algorithm for the one-dimensional intersymbol interference channel with nonnegative impulse response function are proposed and compared numerically with the Viterbi demodulation algorithm and the demodulation algorithms based on the Wiener filter. Simulation results show that the demodulation algorithms based on the Richardson-Lucy algorithm have better bit error rate performance than the demodulation algorithms based on the Wiener filter. With the progressive thresholding, the bit error rate curves of both blind and nonblind Richardson-Lucy-based algorithms are within 0.3 dB from that of the Viterbi algorithm throughout the entire simulated signal-to-noise ratio range. While the complexity of the Viterbi algorithm depends critically on the length of the channel impulse response function, the complexity of the demodulation algorithms based on the Richardson-Lucy algorithm only weakly depends on it","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130596171","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 : 2005-12-21DOI: 10.1109/ISSPIT.2005.1577107
E. Aboutanios, B. Mulgrew
The detection of signals with known templates embedded in zero-mean coloured Gaussian interference is relevant to many fields such as radar, sonar, seismology and biomedicine to name a few. Traditional detection algorithms, such as the GLRT and AMF, require a training data set. Recently, single data set (SDS) algorithms, namely the GMLED and MLED, have been proposed to deal with the case where training data may not be available. In this paper, we examine the performance of these algorithms under template (or steering vector) mismatch. We identify three types of mismatch, namely the spatial steering vector mismatch, temporal steering vector mismatch and mismatch in both steering vectors. In each mismath case we derive the expected signal to noise ratio loss with respect to the corresponding matched case. Simulation results are given which show that the SDS algorithms are more sensitive to mismatch mainly due to the interaction between the signal and subspaces estimation. However, this increased sensitivity to mismatch is closely related to the ability to resolve close signals. Therefore, the SDS algorithms exhibit higher resolution
{"title":"Assessment of the single data set detection algorithms under template mismatch","authors":"E. Aboutanios, B. Mulgrew","doi":"10.1109/ISSPIT.2005.1577107","DOIUrl":"https://doi.org/10.1109/ISSPIT.2005.1577107","url":null,"abstract":"The detection of signals with known templates embedded in zero-mean coloured Gaussian interference is relevant to many fields such as radar, sonar, seismology and biomedicine to name a few. Traditional detection algorithms, such as the GLRT and AMF, require a training data set. Recently, single data set (SDS) algorithms, namely the GMLED and MLED, have been proposed to deal with the case where training data may not be available. In this paper, we examine the performance of these algorithms under template (or steering vector) mismatch. We identify three types of mismatch, namely the spatial steering vector mismatch, temporal steering vector mismatch and mismatch in both steering vectors. In each mismath case we derive the expected signal to noise ratio loss with respect to the corresponding matched case. Simulation results are given which show that the SDS algorithms are more sensitive to mismatch mainly due to the interaction between the signal and subspaces estimation. However, this increased sensitivity to mismatch is closely related to the ability to resolve close signals. Therefore, the SDS algorithms exhibit higher resolution","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121548773","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
扫码关注我们
求助内容：
应助结果提醒方式：