Through-hole vias is the essential element of modern multilayer PCB to connect the signal paths, power planes and ground planes on different layers of the board. The via in the signal path results in the discontinuity and a possible source of signal degradation and EMI. This paper presents the 3D Transmission-Line Modelling(TLM) method to model the vias and PCB trace and simulate the signal transmission process. The aim is to forecast the signal degradation by means of comparing the pulses propagation in the microstrip traces with and without via.
{"title":"Simulation and Research of the PCB Vias Effects","authors":"Q. Tang, Yaonan Wang, C. Christopoulos","doi":"10.1109/ICNC.2007.664","DOIUrl":"https://doi.org/10.1109/ICNC.2007.664","url":null,"abstract":"Through-hole vias is the essential element of modern multilayer PCB to connect the signal paths, power planes and ground planes on different layers of the board. The via in the signal path results in the discontinuity and a possible source of signal degradation and EMI. This paper presents the 3D Transmission-Line Modelling(TLM) method to model the vias and PCB trace and simulate the signal transmission process. The aim is to forecast the signal degradation by means of comparing the pulses propagation in the microstrip traces with and without via.","PeriodicalId":250881,"journal":{"name":"Third International Conference on Natural Computation (ICNC 2007)","volume":"48 13","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113934038","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}
In order to alleviate the shortcomings of most blind deconvolution algorithms, this paper proposes an improved fast algorithm for blind deconvolution based on decorrelation technique and broadband block matrix. Althougth the original algorithm proposed in ref (H. Buchner et al., 2003) can overcome the shortcomings of current blind deconvolution algorithms, but it has a constraint that the number of the source signals must be less than that of the channels'. The improved algorithm deletes this constraint by using decorrelation technique. Besides, the improved algorithm raises the separation speed in terms of improving the computing methods of output signals matrix. Simulation results demonstrate the validation and fast separation of the improved algorithm.
针对大多数盲反卷积算法的不足，提出了一种基于去相关技术和宽带分块矩阵的快速盲反卷积改进算法。虽然在ref (H. Buchner et al.， 2003)中提出的原始算法可以克服当前盲反卷积算法的缺点，但它有一个约束，即源信号的数量必须小于信道的数量。改进算法利用去相关技术消除该约束。改进后的算法在改进输出信号矩阵的计算方法方面提高了分离速度。仿真结果验证了改进算法的有效性和分离速度。
{"title":"A Fast Blind Deconvolution Algorithm Using Decorrelation and Block Matrix","authors":"Jun-an Yang, Xue-ping He, Yunxiao Jiang","doi":"10.1109/ICNC.2007.21","DOIUrl":"https://doi.org/10.1109/ICNC.2007.21","url":null,"abstract":"In order to alleviate the shortcomings of most blind deconvolution algorithms, this paper proposes an improved fast algorithm for blind deconvolution based on decorrelation technique and broadband block matrix. Althougth the original algorithm proposed in ref (H. Buchner et al., 2003) can overcome the shortcomings of current blind deconvolution algorithms, but it has a constraint that the number of the source signals must be less than that of the channels'. The improved algorithm deletes this constraint by using decorrelation technique. Besides, the improved algorithm raises the separation speed in terms of improving the computing methods of output signals matrix. Simulation results demonstrate the validation and fast separation of the improved algorithm.","PeriodicalId":250881,"journal":{"name":"Third International Conference on Natural Computation (ICNC 2007)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131383274","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}
A nonlinear geometric feature equalizer adopting minimum bit error rate principle is proposed in this paper for the filtering of noise and interference whose frequency band overlaps with the desired signal in communications, and a novel hybrid genetic algorithm, namely hybrid genetic algorithm-stochastic gradient, is also proposed for training the equalization model. Considering that the noise and the interference have different stochastic character, the desired information is recovered by neural network based on minimum bit error rate principle. Simulation results show that when extended binary phase shifting keying signal is contaminated by the mix of white Gaussian noise and relatively strong interference signals of amplitude modulation and frequency modulation, the performance of matched filter or linear equalizer degenerates rapidly, but geometric feature equalizer provides very low bit error rate. Furthermore, performance of hybrid genetic algorithm is superior to that of stochastic gradient.
{"title":"Geometric Feature Equalizers Based on Hybrid Genetic Algorithm","authors":"Renxiang Zhu, Lenan Wu, Ruo Shu","doi":"10.1109/ICNC.2007.403","DOIUrl":"https://doi.org/10.1109/ICNC.2007.403","url":null,"abstract":"A nonlinear geometric feature equalizer adopting minimum bit error rate principle is proposed in this paper for the filtering of noise and interference whose frequency band overlaps with the desired signal in communications, and a novel hybrid genetic algorithm, namely hybrid genetic algorithm-stochastic gradient, is also proposed for training the equalization model. Considering that the noise and the interference have different stochastic character, the desired information is recovered by neural network based on minimum bit error rate principle. Simulation results show that when extended binary phase shifting keying signal is contaminated by the mix of white Gaussian noise and relatively strong interference signals of amplitude modulation and frequency modulation, the performance of matched filter or linear equalizer degenerates rapidly, but geometric feature equalizer provides very low bit error rate. Furthermore, performance of hybrid genetic algorithm is superior to that of stochastic gradient.","PeriodicalId":250881,"journal":{"name":"Third International Conference on Natural Computation (ICNC 2007)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132022234","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}
Location management (LM) is an essential feature in a personal communication service (PCS) network composed of a group of base stations. LM enables the PCS network to find the current cell, the radio coverage of a base station, in which a mobile terminal (MT) resides when an incoming call to the MT arrives. LM involves two operations: location update and paging. This study aims to develop algorithms that reduce paging cost so that total LM cost is reduced. As an optimization technique we consider the use of genetic algorithms using which we develops a sequential paging scheme. Furthermore, numeric studies are presented so that we can compare the proposed paging scheme with some well-known sequential paging schemes such as reverse paging, semi-reverse paging, and uniform paging. The experimental results demonstrate the effectiveness of the proposed paging scheme (minimal paging cost) over the existing ones.
{"title":"Applying Genetic Algorithms to Efficiently Locate Mobile Terminals in Personal Communication Networks","authors":"Yi-hua Zhu, W. Pedrycz","doi":"10.1109/ICNC.2007.266","DOIUrl":"https://doi.org/10.1109/ICNC.2007.266","url":null,"abstract":"Location management (LM) is an essential feature in a personal communication service (PCS) network composed of a group of base stations. LM enables the PCS network to find the current cell, the radio coverage of a base station, in which a mobile terminal (MT) resides when an incoming call to the MT arrives. LM involves two operations: location update and paging. This study aims to develop algorithms that reduce paging cost so that total LM cost is reduced. As an optimization technique we consider the use of genetic algorithms using which we develops a sequential paging scheme. Furthermore, numeric studies are presented so that we can compare the proposed paging scheme with some well-known sequential paging schemes such as reverse paging, semi-reverse paging, and uniform paging. The experimental results demonstrate the effectiveness of the proposed paging scheme (minimal paging cost) over the existing ones.","PeriodicalId":250881,"journal":{"name":"Third International Conference on Natural Computation (ICNC 2007)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132113433","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}
Cellular automata (CA) can be used to simulate complex urban systems. Calibration of CA is essential for producing realistic urban patterns. A common calibration procedure is based on linear regression methods, such as multicriteria evaluation. This paper proposes a new method to acquire nonlinear transition rules of CA by using the techniques of kernel-based learning machines. The kernel-based approach transforms complex nonlinear problems to simple linear problems through the mapping on an implicit high-dimensional feature space for extracting transition rules. This method has been applied to the simulation of urban expansion in the fast growing city, Guangzhou. Comparisons indicate that more reliable simulation results can be generated by using this kernel-based method.
{"title":"Kernel-Based Cellular Automata for Urban Simulation","authors":"Xiaoping Liu, Xia Li, Bin Ai, Shaokun Wu, Tao Liu","doi":"10.1109/ICNC.2007.456","DOIUrl":"https://doi.org/10.1109/ICNC.2007.456","url":null,"abstract":"Cellular automata (CA) can be used to simulate complex urban systems. Calibration of CA is essential for producing realistic urban patterns. A common calibration procedure is based on linear regression methods, such as multicriteria evaluation. This paper proposes a new method to acquire nonlinear transition rules of CA by using the techniques of kernel-based learning machines. The kernel-based approach transforms complex nonlinear problems to simple linear problems through the mapping on an implicit high-dimensional feature space for extracting transition rules. This method has been applied to the simulation of urban expansion in the fast growing city, Guangzhou. Comparisons indicate that more reliable simulation results can be generated by using this kernel-based method.","PeriodicalId":250881,"journal":{"name":"Third International Conference on Natural Computation (ICNC 2007)","volume":"16 S1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132419767","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}
In RFID system, the problem of the collision between tags is a focus topic. The Hash-tree anti-collision algorithm was proposed in the paper, which adopted hash operation to allocate slots for tags and used tree searching method to identify collision tags in the queue of collision slots. The proposed algorithm doesn't require readers to test the precise location of collision bits, and its performance beyond 36.8% is better than ALOHA- based algorithms.
{"title":"Design of Hash-Tree Anti-collision Algorithm","authors":"Hong Zhang, Lei Han, Yu-Lu Li","doi":"10.1109/ICNC.2007.327","DOIUrl":"https://doi.org/10.1109/ICNC.2007.327","url":null,"abstract":"In RFID system, the problem of the collision between tags is a focus topic. The Hash-tree anti-collision algorithm was proposed in the paper, which adopted hash operation to allocate slots for tags and used tree searching method to identify collision tags in the queue of collision slots. The proposed algorithm doesn't require readers to test the precise location of collision bits, and its performance beyond 36.8% is better than ALOHA- based algorithms.","PeriodicalId":250881,"journal":{"name":"Third International Conference on Natural Computation (ICNC 2007)","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132473914","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}
It is a more difficult problem to plan path in environment which with both static obstacles and dynamic obstacles. Double-layer genetic algorithm mechanism is brought up in this paper. It introduces the method which deals with static obstacles avoidance and dynamic avoidance respectively. Optimized operator and adaptive technology are designed to speed up creating optimized path. The result of experimentation is show that multifactor could be taken into account synthetically and the best path could be convergent by this way.
{"title":"Path Planning Based on Double-Layer Genetic Algorithm","authors":"Jin Lu, Dongyong Yang","doi":"10.1109/ICNC.2007.546","DOIUrl":"https://doi.org/10.1109/ICNC.2007.546","url":null,"abstract":"It is a more difficult problem to plan path in environment which with both static obstacles and dynamic obstacles. Double-layer genetic algorithm mechanism is brought up in this paper. It introduces the method which deals with static obstacles avoidance and dynamic avoidance respectively. Optimized operator and adaptive technology are designed to speed up creating optimized path. The result of experimentation is show that multifactor could be taken into account synthetically and the best path could be convergent by this way.","PeriodicalId":250881,"journal":{"name":"Third International Conference on Natural Computation (ICNC 2007)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130114297","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}
In this paper, a segmentation algorithm based on form information is proposed for separation of touching and overlapping cells. The method integrating morphological smoothing with holes filling is employed in a pre-processing stage. Then the overlapping cell clusters are identified through a polygon approximation. Later the separation is implemented, which consists of the detecting concave points on the contours and determining the separation lines. The algorithm can split complicated large cell clusters. In addition, this algorithm can be adopted for other applications, where separation between touching and overlapping particles is needed.
{"title":"Cell Cluster Image Segmentation on Form Analysis","authors":"Wang Wei-xing, Song Hao","doi":"10.1109/ICNC.2007.293","DOIUrl":"https://doi.org/10.1109/ICNC.2007.293","url":null,"abstract":"In this paper, a segmentation algorithm based on form information is proposed for separation of touching and overlapping cells. The method integrating morphological smoothing with holes filling is employed in a pre-processing stage. Then the overlapping cell clusters are identified through a polygon approximation. Later the separation is implemented, which consists of the detecting concave points on the contours and determining the separation lines. The algorithm can split complicated large cell clusters. In addition, this algorithm can be adopted for other applications, where separation between touching and overlapping particles is needed.","PeriodicalId":250881,"journal":{"name":"Third International Conference on Natural Computation (ICNC 2007)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130134212","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}
Image fusion plays an important role in many fields such as computer vision, medical image, manufacturing, military, and remote sensing so on. Pulse coupled neural network (PCNN) is derived from the synchronous neuronal burst phenomena in the cat visual cortex. So it is very suitable for image processing. Due to some defects of original PCNN for data fusion, we propose a novel PCNN model - dual- channel PCNN for the first time based on original model, which is specialized in image fusion. In order to explain efficiency and validity of our proposed method, we take two medical images for example to explain further the advantages in comparison to other image fusion methods. Better results are obtained with our approach. Our fused image includes more information than others, which show our method is better and efficient one. Meanwhile our method not only fuses multi-source images very well but also enhances the quality of the fused image.
{"title":"Dual-channel PCNN and Its Application in the Field of Image Fusion","authors":"Zhanbin Wang, Yide Ma","doi":"10.1109/ICNC.2007.338","DOIUrl":"https://doi.org/10.1109/ICNC.2007.338","url":null,"abstract":"Image fusion plays an important role in many fields such as computer vision, medical image, manufacturing, military, and remote sensing so on. Pulse coupled neural network (PCNN) is derived from the synchronous neuronal burst phenomena in the cat visual cortex. So it is very suitable for image processing. Due to some defects of original PCNN for data fusion, we propose a novel PCNN model - dual- channel PCNN for the first time based on original model, which is specialized in image fusion. In order to explain efficiency and validity of our proposed method, we take two medical images for example to explain further the advantages in comparison to other image fusion methods. Better results are obtained with our approach. Our fused image includes more information than others, which show our method is better and efficient one. Meanwhile our method not only fuses multi-source images very well but also enhances the quality of the fused image.","PeriodicalId":250881,"journal":{"name":"Third International Conference on Natural Computation (ICNC 2007)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130445157","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}
The choice of cache configuration impacts the system significantly. Modern embedded systems execute a specific class of applications repeatedly, thus adapting the cache parameters to those few applications can obtain tremendous benefits. We propose the dynamically reconfigurable cache architecture to improve not only overall performance, but also energy consumption for embedded systems. First, we introduce a novel reconfiguration management algorithm (RMA) dynamically detecting phase changes and automatically searching the large space of possible cache configurations for the optimal one. Then, a particular cache organization, cooperating with the RMA, is presented to reconfigure the cache with respect to a three-dimensional space, namely, cache capacity, line size, and associativity. The results of experiments validate the efficiency and accuracy of the RMA by performing simulation on the SPEC CPU2000 embedded system benchmarks. We show that the embedded systems can achieve the compromise between performance and energy using this approach.
{"title":"Dynamically Reconfigurable Cache for Low-Power Embedded System","authors":"Liming Chen, X. Zou, Jianming Lei, Zhenglin Liu","doi":"10.1109/ICNC.2007.346","DOIUrl":"https://doi.org/10.1109/ICNC.2007.346","url":null,"abstract":"The choice of cache configuration impacts the system significantly. Modern embedded systems execute a specific class of applications repeatedly, thus adapting the cache parameters to those few applications can obtain tremendous benefits. We propose the dynamically reconfigurable cache architecture to improve not only overall performance, but also energy consumption for embedded systems. First, we introduce a novel reconfiguration management algorithm (RMA) dynamically detecting phase changes and automatically searching the large space of possible cache configurations for the optimal one. Then, a particular cache organization, cooperating with the RMA, is presented to reconfigure the cache with respect to a three-dimensional space, namely, cache capacity, line size, and associativity. The results of experiments validate the efficiency and accuracy of the RMA by performing simulation on the SPEC CPU2000 embedded system benchmarks. We show that the embedded systems can achieve the compromise between performance and energy using this approach.","PeriodicalId":250881,"journal":{"name":"Third International Conference on Natural Computation (ICNC 2007)","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134035316","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
扫码关注我们
求助内容：
应助结果提醒方式：