Pub Date : 2010-11-11DOI: 10.1109/WCSP.2010.5633834
Yanjing Sun, Xue Liu
This paper presents wireless multi-hop Ad hoc networks based on OLSR protocol for the special environments in underground mine to improve existing coal mine wireless network deficiencies. It has the characteristics of high bandwidth, low latency, and easy deployment, compatibility with coal mine industrial Ethernet and multimedia transmission. We designed and implemented coal mine coverage network, safety wireless node and mobile ad hoc network route protocol. For routing protocol, we replace hop count route metric with expected transmission count to get a better performance. Experiments have been performed in a simulation environment in order to guide the MANET deployment in underground mine.
{"title":"Wireless multi-hop Ad hoc networks based on OLSR for underground coal mine","authors":"Yanjing Sun, Xue Liu","doi":"10.1109/WCSP.2010.5633834","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633834","url":null,"abstract":"This paper presents wireless multi-hop Ad hoc networks based on OLSR protocol for the special environments in underground mine to improve existing coal mine wireless network deficiencies. It has the characteristics of high bandwidth, low latency, and easy deployment, compatibility with coal mine industrial Ethernet and multimedia transmission. We designed and implemented coal mine coverage network, safety wireless node and mobile ad hoc network route protocol. For routing protocol, we replace hop count route metric with expected transmission count to get a better performance. Experiments have been performed in a simulation environment in order to guide the MANET deployment in underground mine.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134262532","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 : 2010-11-11DOI: 10.1109/WCSP.2010.5633702
Hongbin Chen
Energy efficiency is a primary concern in the design of algorithms and protocols for wireless sensor networks. For a long time, researchers have made great efforts to efficiently utilize the limited energy storage of sensors. Recently, it was shown that external energy resources can be harvested by the sensors in order to increase their lifetime. This paper elaborates on the role of recharging in energy efficiency for wireless sensor networks. Particularly, several energy efficiency scenarios with recharging are discussed. The new facets brought by recharging are highlighted. A representative example is provided to show the advantage of recharging in sensor networks. This paper is dedicated to serve as a tutorial which calls for more attention to the exciting research topic-recharging for wireless sensor networks.
{"title":"The role of recharging in energy efficiency for wireless sensor networks","authors":"Hongbin Chen","doi":"10.1109/WCSP.2010.5633702","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633702","url":null,"abstract":"Energy efficiency is a primary concern in the design of algorithms and protocols for wireless sensor networks. For a long time, researchers have made great efforts to efficiently utilize the limited energy storage of sensors. Recently, it was shown that external energy resources can be harvested by the sensors in order to increase their lifetime. This paper elaborates on the role of recharging in energy efficiency for wireless sensor networks. Particularly, several energy efficiency scenarios with recharging are discussed. The new facets brought by recharging are highlighted. A representative example is provided to show the advantage of recharging in sensor networks. This paper is dedicated to serve as a tutorial which calls for more attention to the exciting research topic-recharging for wireless sensor networks.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134067127","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 : 2010-11-11DOI: 10.1109/WCSP.2010.5634039
Raied Caromi, Yan Xin, L. Lai
This paper considers the problem of how to quickly and accurately scan a multichannel spectrum to determine the availability of each channel for a secondary user in a cognitive radio network. The secondary user is able to simultaneously observe more than one channel. We consider a sequential decision setup. After taking each sample, the secondary user should decide either to stop or continue scanning. If the secondary user decides to stop scanning, it then needs to make decisions on the busy/idle status of each channel. If the secondary user decides to continue scanning, it then needs to select a subset of the channels to sense. Two scenarios are investigated. In the first scenario, there is a strict delay constraint on the scanning process. That is, the spectrum scanning needs to be completed within a certain period of time. In the second scenario, there is no strict delay constraint. That is, the spectrum scanning continues until the completion of the detection process. In both scenarios, optimal algorithms for multichannel scanning with multiple simultaneous observations are developed to minimize a cost function that strikes a balance between detection error probabilities and detection delay. Low-complexity approximation schemes are also developed to reduce the complexity of the optimal schemes. Simulation examples are provided to illustrate the effectiveness of the proposed algorithms.
{"title":"Fast multichannel spectrum scanning with multiple simultaneous observations","authors":"Raied Caromi, Yan Xin, L. Lai","doi":"10.1109/WCSP.2010.5634039","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5634039","url":null,"abstract":"This paper considers the problem of how to quickly and accurately scan a multichannel spectrum to determine the availability of each channel for a secondary user in a cognitive radio network. The secondary user is able to simultaneously observe more than one channel. We consider a sequential decision setup. After taking each sample, the secondary user should decide either to stop or continue scanning. If the secondary user decides to stop scanning, it then needs to make decisions on the busy/idle status of each channel. If the secondary user decides to continue scanning, it then needs to select a subset of the channels to sense. Two scenarios are investigated. In the first scenario, there is a strict delay constraint on the scanning process. That is, the spectrum scanning needs to be completed within a certain period of time. In the second scenario, there is no strict delay constraint. That is, the spectrum scanning continues until the completion of the detection process. In both scenarios, optimal algorithms for multichannel scanning with multiple simultaneous observations are developed to minimize a cost function that strikes a balance between detection error probabilities and detection delay. Low-complexity approximation schemes are also developed to reduce the complexity of the optimal schemes. Simulation examples are provided to illustrate the effectiveness of the proposed algorithms.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"190 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124285544","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 : 2010-11-11DOI: 10.1109/WCSP.2010.5633707
A. Ahmad-Kassem, Nathalie Mitten
Neighbour discovery and maintenance of neighbourhood tables have importance in wireless sensor networks. Almost every upper layer application such as routing or self-organizing relies on neighbourhood tables. Imprecise tables may lead to failures that may be costly in terms of resources which are very limited in such networks. Neighbourhood tables are achieved thanks to the Hello protocol. Several studies propose smart schemes to dynamically adapt the frequency of Hello messages but none of them investigates the way the refreshment period of entries in table should be adapted. In this paper, we introduce the Neighbourhood Lifetime Algorithm (NLA), the very first algorithm that adapts dynamically the refreshment period of entries in neighbourhood tables, based on the speed of node and the frequency of the Hello message. Our simulation results show and demonstrate the efficiency of NLA and its high performance to keep neighbourhood tables consistent.
{"title":"Adapting dynamically neighbourhood table entry lifetime in wireless sensor networks","authors":"A. Ahmad-Kassem, Nathalie Mitten","doi":"10.1109/WCSP.2010.5633707","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633707","url":null,"abstract":"Neighbour discovery and maintenance of neighbourhood tables have importance in wireless sensor networks. Almost every upper layer application such as routing or self-organizing relies on neighbourhood tables. Imprecise tables may lead to failures that may be costly in terms of resources which are very limited in such networks. Neighbourhood tables are achieved thanks to the Hello protocol. Several studies propose smart schemes to dynamically adapt the frequency of Hello messages but none of them investigates the way the refreshment period of entries in table should be adapted. In this paper, we introduce the Neighbourhood Lifetime Algorithm (NLA), the very first algorithm that adapts dynamically the refreshment period of entries in neighbourhood tables, based on the speed of node and the frequency of the Hello message. Our simulation results show and demonstrate the efficiency of NLA and its high performance to keep neighbourhood tables consistent.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125586765","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 : 2010-11-11DOI: 10.1109/WCSP.2010.5633452
Ali Ghayoor, Saeed Ghorbani, A. Beheshti
A new method for image registration has been previously proposed by the authors, which the registration is based on physical forces. The registration parameters are translation and rotation. This method assumes images like charged materials that attract each other. In this case, one of the images moves in the same direction as the applied force while the other one is still. The movement of the image continues until the resultant force becomes zero. This approach estimates the registration parameters simultaneously and leading to a better optimized set of registration parameters. The registration error for this method is 1 to 3 pixels. In this paper we aim to develop this method for the applications which need sub-pixel accuracy. First, by applying the Canny edge detector on the input images, the edge information is also used for the registration process to increase the robustness of this method in the presence of noise. After that, sub-pixel accuracy is provided for this method by using interpolation techniques.
{"title":"Sub-pixel image registration based on physical forces","authors":"Ali Ghayoor, Saeed Ghorbani, A. Beheshti","doi":"10.1109/WCSP.2010.5633452","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633452","url":null,"abstract":"A new method for image registration has been previously proposed by the authors, which the registration is based on physical forces. The registration parameters are translation and rotation. This method assumes images like charged materials that attract each other. In this case, one of the images moves in the same direction as the applied force while the other one is still. The movement of the image continues until the resultant force becomes zero. This approach estimates the registration parameters simultaneously and leading to a better optimized set of registration parameters. The registration error for this method is 1 to 3 pixels. In this paper we aim to develop this method for the applications which need sub-pixel accuracy. First, by applying the Canny edge detector on the input images, the edge information is also used for the registration process to increase the robustness of this method in the presence of noise. After that, sub-pixel accuracy is provided for this method by using interpolation techniques.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134411476","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 : 2010-11-11DOI: 10.1109/WCSP.2010.5633493
J. Dang, Zaichen Zhang, Xiaoyan Wang
In our previous work [1] we have proposed a new ultra-wideband (UWB) communication scheme referred to as two-level multicarrier (TLMC) UWB. TLMC UWB has some structurally inherited advantages compared to the conventional multiband orthogonal frequency division multiplexing UWB scheme, which make it a promising candidate for future ultra-high speed communications. However, in that work we presented the proposed scheme in a general manner. In this paper we study a specific type of TLMC UWB which is based on exponentially modulated filter banks. We will elaborate the system model and investigate the equalization task in detail. System performance is also evaluated through computer simulation.
{"title":"Two-level multicarrier UWB: A case study","authors":"J. Dang, Zaichen Zhang, Xiaoyan Wang","doi":"10.1109/WCSP.2010.5633493","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633493","url":null,"abstract":"In our previous work [1] we have proposed a new ultra-wideband (UWB) communication scheme referred to as two-level multicarrier (TLMC) UWB. TLMC UWB has some structurally inherited advantages compared to the conventional multiband orthogonal frequency division multiplexing UWB scheme, which make it a promising candidate for future ultra-high speed communications. However, in that work we presented the proposed scheme in a general manner. In this paper we study a specific type of TLMC UWB which is based on exponentially modulated filter banks. We will elaborate the system model and investigate the equalization task in detail. System performance is also evaluated through computer simulation.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"135 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132730043","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 : 2010-11-11DOI: 10.1109/WCSP.2010.5633579
Shengmei Zhao, Feng Gao, Xiaoliang Dong, B. Zheng
Quantum detection techniques based on multi-access quantum channel promise efficient quantum optimal solutions to quantum multi-user detection. "Discrete coherent state"(DCS) approximation method is a practical model for solving the mixed-state detection problem. Generally, the input states are pure states, while the output states are turned out to be mixed states corrupted by the noise in quantum channel. In this paper, we consider the detection scheme with DCS approximation in a quantum multiple access channel. We deduce the error probability of symbol rate of the detection algorithm with DCS detection scheme in multi-user detection fashion. By numerical simulations, we analyze and compare the performance of this detection scheme with different degree approximation. It is shown that this detection scheme is available for the quantum multi-user detection. For a normal noise, say jV=0.1, we will get the 10−3 when number of photons Ns go to 18.
{"title":"Detection scheme for quantum multiple access channel with noisy coherent state","authors":"Shengmei Zhao, Feng Gao, Xiaoliang Dong, B. Zheng","doi":"10.1109/WCSP.2010.5633579","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633579","url":null,"abstract":"Quantum detection techniques based on multi-access quantum channel promise efficient quantum optimal solutions to quantum multi-user detection. \"Discrete coherent state\"(DCS) approximation method is a practical model for solving the mixed-state detection problem. Generally, the input states are pure states, while the output states are turned out to be mixed states corrupted by the noise in quantum channel. In this paper, we consider the detection scheme with DCS approximation in a quantum multiple access channel. We deduce the error probability of symbol rate of the detection algorithm with DCS detection scheme in multi-user detection fashion. By numerical simulations, we analyze and compare the performance of this detection scheme with different degree approximation. It is shown that this detection scheme is available for the quantum multi-user detection. For a normal noise, say jV=0.1, we will get the 10−3 when number of photons Ns go to 18.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115970070","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 : 2010-11-11DOI: 10.1109/WCSP.2010.5633532
Z. Pan, Gang Wu, Shu Fang, D. Lin
The single-carrier frequency division multiple access (SC-FDMA) is employed in the 3GPP Long Term Evolution (LTE) standard as the uplink transmission scheme. In this paper, we propose a novel successive interference cancellation (SIC) detector for multiuser detection in multiuser Multiple Input Multiple Output (MIMO) SC-FDMA system with co-channel interference (CCI). Compared to conventional SIC receiver, the proposed scheme can overcome the error propagation problem in the interference cancellation process via soft-decision output combined with channel decoder. And we also study the impact of the channel estimate error on the receiver and investigated it via simulation. Simulation results show that the proposed algorithm is significantly superior to the conventional frequency domain linear equalization based receiver in terms of bit error rate (BER) performance even the channel statement information is imperfect at the receiver.
3GPP LTE (Long Term Evolution)标准采用单载波频分多址(SC-FDMA)作为上行传输方案。在本文中，我们提出了一种新的连续干扰消除(SIC)检测器，用于具有同信道干扰(CCI)的多用户多输入多输出(MIMO) SC-FDMA系统的多用户检测。与传统的SIC接收机相比，该方案通过软判决输出与信道解码器相结合，克服了干扰消除过程中的误差传播问题。研究了信道估计误差对接收机的影响，并进行了仿真研究。仿真结果表明，在信道语句信息不完全的情况下，该算法在误码率(BER)性能方面明显优于传统的基于频域线性均衡的接收机。
{"title":"Practical soft-SIC detection for MIMO SC-FDMA system with co-channel interference","authors":"Z. Pan, Gang Wu, Shu Fang, D. Lin","doi":"10.1109/WCSP.2010.5633532","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633532","url":null,"abstract":"The single-carrier frequency division multiple access (SC-FDMA) is employed in the 3GPP Long Term Evolution (LTE) standard as the uplink transmission scheme. In this paper, we propose a novel successive interference cancellation (SIC) detector for multiuser detection in multiuser Multiple Input Multiple Output (MIMO) SC-FDMA system with co-channel interference (CCI). Compared to conventional SIC receiver, the proposed scheme can overcome the error propagation problem in the interference cancellation process via soft-decision output combined with channel decoder. And we also study the impact of the channel estimate error on the receiver and investigated it via simulation. Simulation results show that the proposed algorithm is significantly superior to the conventional frequency domain linear equalization based receiver in terms of bit error rate (BER) performance even the channel statement information is imperfect at the receiver.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116049373","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 : 2010-11-11DOI: 10.1109/WCSP.2010.5633676
Shunqiao Sun, Jiaxi Di, Weiming Ni
We consider the power efficiency optimization problem in the cognitive radio (CR) networks under both the average packet delay constraints of each CR transmitter (CR-Tx) and the interference constraint at primary receiver (PU-Rx). We propose a cooperative approach to make each CR-Tx know the interference level at the PU-Rx when there is no central control node in the network and no assistant sensors are deployed to do the interference measuring jobs. The power control problem is proved to be a convex problem. Since the powers of CR-Tx nodes are coupled in constraints, we apply the Lagrange relaxation of the coupling constraints method and construct the subgradient iterative algorithm to solve the dual problem in a distributed way. To reduce the payload of the message exchange at each iterative process, an improved algorithm is proposed that could be implemented through Lagrange dual decomposition. Numerical results show that the two algorithms can converge very fast. When the delay constraints of CR users are not very small, it is better to apply the improved algorithm which has a good performance but with a much lower complexity.
{"title":"Distributed power control based on convex optimization in cognitive radio networks","authors":"Shunqiao Sun, Jiaxi Di, Weiming Ni","doi":"10.1109/WCSP.2010.5633676","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633676","url":null,"abstract":"We consider the power efficiency optimization problem in the cognitive radio (CR) networks under both the average packet delay constraints of each CR transmitter (CR-Tx) and the interference constraint at primary receiver (PU-Rx). We propose a cooperative approach to make each CR-Tx know the interference level at the PU-Rx when there is no central control node in the network and no assistant sensors are deployed to do the interference measuring jobs. The power control problem is proved to be a convex problem. Since the powers of CR-Tx nodes are coupled in constraints, we apply the Lagrange relaxation of the coupling constraints method and construct the subgradient iterative algorithm to solve the dual problem in a distributed way. To reduce the payload of the message exchange at each iterative process, an improved algorithm is proposed that could be implemented through Lagrange dual decomposition. Numerical results show that the two algorithms can converge very fast. When the delay constraints of CR users are not very small, it is better to apply the improved algorithm which has a good performance but with a much lower complexity.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116300914","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 : 2010-11-11DOI: 10.1109/WCSP.2010.5633446
Wen-Tao Zhang, L. Ye, Hongfan Zhao, S. Chai
Single and double E-plane metal insert irises are analyzed via Mode-Match-Method (MMM), and the position of the double irises is determined first, then single/double/hybrid metal insert filters are designed using the theory of network synthesis, the result demonstrates that hybrid metal insert filter is easier to fabricate because of its reasonable iris lengths. At last, the above three types of filters are analyzed by MMM, the result demonstrates that hybrid metal insert filter has better transmission characteristics than the single/double metal insert filter. The MMM results are also verified by the results of CST software.
{"title":"Design of waveguide E-plane hybrid metal insert filters for millimeter-wave application","authors":"Wen-Tao Zhang, L. Ye, Hongfan Zhao, S. Chai","doi":"10.1109/WCSP.2010.5633446","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633446","url":null,"abstract":"Single and double E-plane metal insert irises are analyzed via Mode-Match-Method (MMM), and the position of the double irises is determined first, then single/double/hybrid metal insert filters are designed using the theory of network synthesis, the result demonstrates that hybrid metal insert filter is easier to fabricate because of its reasonable iris lengths. At last, the above three types of filters are analyzed by MMM, the result demonstrates that hybrid metal insert filter has better transmission characteristics than the single/double metal insert filter. The MMM results are also verified by the results of CST software.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116707789","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
扫码关注我们
求助内容：
应助结果提醒方式：