Pub Date : 2015-04-27DOI: 10.1109/ICT.2015.7124662
Zhongsheng Liu, Yuan’an Liu, Fang Liu
In this paper, the joint resource scheduling strategies in a full-duplex cellular system are studied. In the system, the base station (BS) is enabled full-duplex transmission, while the user equipments (UEs) are still traditional half-duplex. Firstly, we propose a binary-integer programming problem concerning cell throughput and solve it through exhaustive search algorithm. Furthermore, considering the feasibility of the optimal algorithm, two suboptimal heuristic algorithms are raised: one is distance isolation algorithm, the other one is user filtering and dynamic adjustment algorithm. Then, to verify the performance of the proposed algorithms, some system level simulations are conducted in a single cell full-duplex scenario. The results show the comparison of system throughput between traditional half-duplex system and full-duplex system under different self-interference cancellation capabilities at the BS. The throughput performance of the proposed algorithms changing with self-interference cancellation capability and user number is analyzed.
{"title":"Joint resource scheduling for full-duplex cellular system","authors":"Zhongsheng Liu, Yuan’an Liu, Fang Liu","doi":"10.1109/ICT.2015.7124662","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124662","url":null,"abstract":"In this paper, the joint resource scheduling strategies in a full-duplex cellular system are studied. In the system, the base station (BS) is enabled full-duplex transmission, while the user equipments (UEs) are still traditional half-duplex. Firstly, we propose a binary-integer programming problem concerning cell throughput and solve it through exhaustive search algorithm. Furthermore, considering the feasibility of the optimal algorithm, two suboptimal heuristic algorithms are raised: one is distance isolation algorithm, the other one is user filtering and dynamic adjustment algorithm. Then, to verify the performance of the proposed algorithms, some system level simulations are conducted in a single cell full-duplex scenario. The results show the comparison of system throughput between traditional half-duplex system and full-duplex system under different self-interference cancellation capabilities at the BS. The throughput performance of the proposed algorithms changing with self-interference cancellation capability and user number is analyzed.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114091214","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 : 2015-04-27DOI: 10.1109/ICT.2015.7124714
Panca Dewi Pamungkasari, Y. Sanada
The cyclic-SLM which implements delayed correlation with a matched filter (DC-MF) is proposed in this paper. The cyclic-SLM reduces a peak-to-average power ratio (PAPR) on an orthogonal frequency division multiplexing (OFDM) signal. This scheme combines the original OFDM signal and its cyclic shifted ones. However, it needs side information (SI) of the cyclic shifts to recover the original signal that decreases the throughput of a wireless OFDM system. The DC-MF estimates the amount of a shift in a receiver side by multipling a recieved signal with its conjugates of the guard interval (GI) sequence in the time domain. Numerical results obtained through computer simulation show that the cyclic-SLM with the DC-MF significantly reduces the PAPR by around 2.5 dB as compared to the original signal. It also achieves the accuracy rate of the amount of the shift close to 100 % and the BER of 10-4 at Eb/N0 = 8.8 dB that is close to the perfect shift estimation.
{"title":"Time domain cyclic-selective mapping for PAPR reduction using delayed correlation with matched filter in OFDM system","authors":"Panca Dewi Pamungkasari, Y. Sanada","doi":"10.1109/ICT.2015.7124714","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124714","url":null,"abstract":"The cyclic-SLM which implements delayed correlation with a matched filter (DC-MF) is proposed in this paper. The cyclic-SLM reduces a peak-to-average power ratio (PAPR) on an orthogonal frequency division multiplexing (OFDM) signal. This scheme combines the original OFDM signal and its cyclic shifted ones. However, it needs side information (SI) of the cyclic shifts to recover the original signal that decreases the throughput of a wireless OFDM system. The DC-MF estimates the amount of a shift in a receiver side by multipling a recieved signal with its conjugates of the guard interval (GI) sequence in the time domain. Numerical results obtained through computer simulation show that the cyclic-SLM with the DC-MF significantly reduces the PAPR by around 2.5 dB as compared to the original signal. It also achieves the accuracy rate of the amount of the shift close to 100 % and the BER of 10-4 at Eb/N0 = 8.8 dB that is close to the perfect shift estimation.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133357796","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 : 2015-04-27DOI: 10.1109/ICT.2015.7124686
Udaya Wijesinghe, U. Tupakula, V. Varadharajan
Software Defined Networking (SDN) is considered as a new approach promising simplified network management by providing a programmable interface. The idea of SDN is based on the separation of control plane from the data plane in networking devices. This is achieved by having the network intelligence centralised in what is called as SDN controller. In this paper we propose techniques for botnet detection in networks using SDN. The SDN controller makes use of generic templates for capturing the traffic flow information from the OpenFlow switches and makes use of this information for detecting bots. We will show that our model can detect a range of bots including IRC, HTTP and peer-to-peer bots.
{"title":"Botnet detection using software defined networking","authors":"Udaya Wijesinghe, U. Tupakula, V. Varadharajan","doi":"10.1109/ICT.2015.7124686","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124686","url":null,"abstract":"Software Defined Networking (SDN) is considered as a new approach promising simplified network management by providing a programmable interface. The idea of SDN is based on the separation of control plane from the data plane in networking devices. This is achieved by having the network intelligence centralised in what is called as SDN controller. In this paper we propose techniques for botnet detection in networks using SDN. The SDN controller makes use of generic templates for capturing the traffic flow information from the OpenFlow switches and makes use of this information for detecting bots. We will show that our model can detect a range of bots including IRC, HTTP and peer-to-peer bots.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128347023","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 : 2015-04-27DOI: 10.1109/ICT.2015.7124689
Huiming Dai, Hao Yan, Xin Zhang, Dacheng Yang
In this paper, a novel receiver design is proposed which combines two different approaches: decision feedback equalization (DFE) and equal gain combining (EGC). To make these two approaches work efficiently, the system is implemented in the frequency domain which can make full use of the advantages of both approaches. Simulation results demonstrate that our proposed design achieves greatly improved performance compared with conventional schemes.
{"title":"Performance improvement of DSRC system using a novel receiver design","authors":"Huiming Dai, Hao Yan, Xin Zhang, Dacheng Yang","doi":"10.1109/ICT.2015.7124689","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124689","url":null,"abstract":"In this paper, a novel receiver design is proposed which combines two different approaches: decision feedback equalization (DFE) and equal gain combining (EGC). To make these two approaches work efficiently, the system is implemented in the frequency domain which can make full use of the advantages of both approaches. Simulation results demonstrate that our proposed design achieves greatly improved performance compared with conventional schemes.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131553940","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 : 2015-04-27DOI: 10.1109/ICT.2015.7124706
Ghassan Alnwaimi, S. Vahid, K. Moessner
This work investigates enabling technology for spectrum sharing in heterogeneous networks (HetNets) deployment, particularly, when a layer of femtocells (FCs) overlaid upon a mobile cellular network. We propose a fully distributed strategic learning based model that enables Femtocells to autonomously identify spectrum use pattern, and accordingly select available resources, such as to operate under restrictions of avoiding interference and satisfy a certain QoS requirements. The simulation results show that the proposed model can identify unused spectral resources of underlying macrocells network, and FCs can autonomously adjust their spectrum resources and converge to a solution concept that satisfy both networks conditions. We show that intra/inter-tier interference can be reduced significantly, thus resulting in higher cell throughputs. Such a distributed intelligent scheme can provide a practical solution to the main challenges in opportunistic spectrum use and interference management in HetNets.
{"title":"Distributed learning game based spectrum sharing and resource selection for femtocells","authors":"Ghassan Alnwaimi, S. Vahid, K. Moessner","doi":"10.1109/ICT.2015.7124706","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124706","url":null,"abstract":"This work investigates enabling technology for spectrum sharing in heterogeneous networks (HetNets) deployment, particularly, when a layer of femtocells (FCs) overlaid upon a mobile cellular network. We propose a fully distributed strategic learning based model that enables Femtocells to autonomously identify spectrum use pattern, and accordingly select available resources, such as to operate under restrictions of avoiding interference and satisfy a certain QoS requirements. The simulation results show that the proposed model can identify unused spectral resources of underlying macrocells network, and FCs can autonomously adjust their spectrum resources and converge to a solution concept that satisfy both networks conditions. We show that intra/inter-tier interference can be reduced significantly, thus resulting in higher cell throughputs. Such a distributed intelligent scheme can provide a practical solution to the main challenges in opportunistic spectrum use and interference management in HetNets.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131804368","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 : 2015-04-27DOI: 10.1109/ICT.2015.7124716
Y. Sekercioglu, J. Violi, L. Priestnall, J. Armstrong
We present a localization scheme for indoor ad hoc networks which use pulsed infrared light as the communication medium. Ad hoc networks are formed when devices with wireless communications capabilities spontaneously connect and exchange information packets. Typically, in wireless ad hoc networks, nodes estimate their position relative to their neighbors by processing the location information in conjunction with the certain physical properties of the signals they receive, such as signal strength, bit error rate, or time difference of arrival. Unfortunately, widely used low-cost infrared transmitters and receivers for indoor applications do not allow measurement of these properties easily. To overcome this, we have developed a system which relies only on the reception of a data frame and is capable of estimating the angular direction of the infrared signal source within an error margin of +/- 5 degrees. Then, through the application of triangulation, a node estimates its relative position with respect to its neighbors. One effective method of translating a relative position to an absolute one is to use anchor nodes. These nodes broadcast their exact location. Each receiving node then progressively fixes its position and broadcasts the position updates, leading to the entire network localizing itself. A major drawback of this approach arises in large networks, where the average hop distance between an anchor and ordinary nodes is large, and position estimation errors inevitably start to accumulate. In order to alleviate this problem, we have developed the Anchor Hop Distance Weighted Localization (AHDWL) algorithm to selectively weigh position estimates at each hop. We found that the AHDWL algorithm is very effective in reducing propagation of positioning errors.
{"title":"Accurate node localization with directional pulsed infrared light for indoor ad hoc network applications","authors":"Y. Sekercioglu, J. Violi, L. Priestnall, J. Armstrong","doi":"10.1109/ICT.2015.7124716","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124716","url":null,"abstract":"We present a localization scheme for indoor ad hoc networks which use pulsed infrared light as the communication medium. Ad hoc networks are formed when devices with wireless communications capabilities spontaneously connect and exchange information packets. Typically, in wireless ad hoc networks, nodes estimate their position relative to their neighbors by processing the location information in conjunction with the certain physical properties of the signals they receive, such as signal strength, bit error rate, or time difference of arrival. Unfortunately, widely used low-cost infrared transmitters and receivers for indoor applications do not allow measurement of these properties easily. To overcome this, we have developed a system which relies only on the reception of a data frame and is capable of estimating the angular direction of the infrared signal source within an error margin of +/- 5 degrees. Then, through the application of triangulation, a node estimates its relative position with respect to its neighbors. One effective method of translating a relative position to an absolute one is to use anchor nodes. These nodes broadcast their exact location. Each receiving node then progressively fixes its position and broadcasts the position updates, leading to the entire network localizing itself. A major drawback of this approach arises in large networks, where the average hop distance between an anchor and ordinary nodes is large, and position estimation errors inevitably start to accumulate. In order to alleviate this problem, we have developed the Anchor Hop Distance Weighted Localization (AHDWL) algorithm to selectively weigh position estimates at each hop. We found that the AHDWL algorithm is very effective in reducing propagation of positioning errors.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122515948","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 : 2015-04-27DOI: 10.1109/ICT.2015.7124698
Lenin Gopal, Y. Rong, Z. Zang
In this paper, we propose a robust transceiver design for nonregenerative multicasting multiple-input multiple-output (MIMO) relay systems where a transmitter broadcasts common message to multiple receivers with aid of a relay node and the transmitter, relay and receivers are all equipped with multiple antennas. In the proposed design, the actual channel state information (CSI) is assumed as a Gaussian random matrix with the estimated CSI as the mean value, and the channel estimation errors are derived from the well-known Kronecker model. In the proposed design scheme, the transmitter and relay precoding matrices are jointly optimized to minimize the maximal mean squared-error (MSE) of the estimated signal at all receivers. The optimization problem is highly nonconvex in nature. Hence, we propose a low complexity solution by exploiting the optimal structure of the relay precoding matrix. Numerical simulations demonstrate the improved robustness of the proposed transceiver design algorithm against the CSI mismatch.
{"title":"Simplified robust design for nonregenerativemm multicasting MIMO relay systems","authors":"Lenin Gopal, Y. Rong, Z. Zang","doi":"10.1109/ICT.2015.7124698","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124698","url":null,"abstract":"In this paper, we propose a robust transceiver design for nonregenerative multicasting multiple-input multiple-output (MIMO) relay systems where a transmitter broadcasts common message to multiple receivers with aid of a relay node and the transmitter, relay and receivers are all equipped with multiple antennas. In the proposed design, the actual channel state information (CSI) is assumed as a Gaussian random matrix with the estimated CSI as the mean value, and the channel estimation errors are derived from the well-known Kronecker model. In the proposed design scheme, the transmitter and relay precoding matrices are jointly optimized to minimize the maximal mean squared-error (MSE) of the estimated signal at all receivers. The optimization problem is highly nonconvex in nature. Hence, we propose a low complexity solution by exploiting the optimal structure of the relay precoding matrix. Numerical simulations demonstrate the improved robustness of the proposed transceiver design algorithm against the CSI mismatch.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114776274","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 : 2015-04-27DOI: 10.1109/ICT.2015.7124715
Bing Lin, Hongyan Li, Yan Long
Satellite network has played an important role in the future global network, due to its advantages of global coverage and short round-trip time (RTT). Its characteristic of intermittent connection causes no-existence of end-to-end path in general in Disruption Tolerant Network (DTN), and thus the store-carry-forward mechanism is adopted. However, the store-carry-forward routing does not consider the buffer constraint on nodes, and thus a novel routing scheme should be designed for such scenario. In this paper, a novel model based on time-varying graph (TVG) is devised, which keeps the richness of the original DTN information. Based on early-connect-early-select path mechanism, we design the labeling algorithm for DTN (LAD) under buffer constraint to maximize the network throughput. Numerical simulation shows that the proposed mechanism can effectively achieve better throughput performance than the algorithm which selects path randomly.
{"title":"A buffer-limited maximum throughput routing algorithm for satellite network","authors":"Bing Lin, Hongyan Li, Yan Long","doi":"10.1109/ICT.2015.7124715","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124715","url":null,"abstract":"Satellite network has played an important role in the future global network, due to its advantages of global coverage and short round-trip time (RTT). Its characteristic of intermittent connection causes no-existence of end-to-end path in general in Disruption Tolerant Network (DTN), and thus the store-carry-forward mechanism is adopted. However, the store-carry-forward routing does not consider the buffer constraint on nodes, and thus a novel routing scheme should be designed for such scenario. In this paper, a novel model based on time-varying graph (TVG) is devised, which keeps the richness of the original DTN information. Based on early-connect-early-select path mechanism, we design the labeling algorithm for DTN (LAD) under buffer constraint to maximize the network throughput. Numerical simulation shows that the proposed mechanism can effectively achieve better throughput performance than the algorithm which selects path randomly.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115239292","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 : 2015-04-27DOI: 10.1109/ICT.2015.7124672
Y. Wang, Yong-mei Wang, Weihua Zhou, Daoben Li
Performance analysis of a bandlimited nonorthogonal waveform transmission (NOWT) scheme for high data rate wireless communications is presented. The technique is a potential alternative to classic orthogonal multiplexing techniques such as OFDM and QAM. It shows faster data transmission rate than Nyquist rate, and considerable performance gain compared with orthogonal techniques, as well as much lower peak to average power ratio (PAPR). The error probability in AWGN channel is derived, and the free squared Euclidean distance of NOWT signal is no more than the minimum squared distance of its modulation constellation. Analysis and numerical results demonstrate that the bandwidth efficiency and capacity of cod-ed/uncoded NOWT technique is higher than Nyquist signalling and orthogonal techniques.
{"title":"Performance analysis of A NOWT scheme for high spectral efficiency communications","authors":"Y. Wang, Yong-mei Wang, Weihua Zhou, Daoben Li","doi":"10.1109/ICT.2015.7124672","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124672","url":null,"abstract":"Performance analysis of a bandlimited nonorthogonal waveform transmission (NOWT) scheme for high data rate wireless communications is presented. The technique is a potential alternative to classic orthogonal multiplexing techniques such as OFDM and QAM. It shows faster data transmission rate than Nyquist rate, and considerable performance gain compared with orthogonal techniques, as well as much lower peak to average power ratio (PAPR). The error probability in AWGN channel is derived, and the free squared Euclidean distance of NOWT signal is no more than the minimum squared distance of its modulation constellation. Analysis and numerical results demonstrate that the bandwidth efficiency and capacity of cod-ed/uncoded NOWT technique is higher than Nyquist signalling and orthogonal techniques.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"237 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115284238","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 : 2015-04-27DOI: 10.1109/ICT.2015.7124707
Yun Tian, Wenbo Xu, Cong Zhang, Yue Wang, Hongwen Yang
Distributed compressed sensing (DCS), exploiting the correlation among multiple signals, enjoys the advantage of reduced number of measurements. This paper considers a type of joint sparsity model in DCS, where each signal contains a common component and an innovation component. In order to reduce the transmission cost, the measurements are derived as the sign information of the compressed samples by using one-bit quantization. We study such CS operation, and propose two joint reconstruction algorithms by iteratively deriving the sign information of each component. Simulation results show that the proposed algorithms can recover the signals efficiently.
{"title":"Joint reconstruction algorithms for one-bit distributed compressed sensing","authors":"Yun Tian, Wenbo Xu, Cong Zhang, Yue Wang, Hongwen Yang","doi":"10.1109/ICT.2015.7124707","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124707","url":null,"abstract":"Distributed compressed sensing (DCS), exploiting the correlation among multiple signals, enjoys the advantage of reduced number of measurements. This paper considers a type of joint sparsity model in DCS, where each signal contains a common component and an innovation component. In order to reduce the transmission cost, the measurements are derived as the sign information of the compressed samples by using one-bit quantization. We study such CS operation, and propose two joint reconstruction algorithms by iteratively deriving the sign information of each component. Simulation results show that the proposed algorithms can recover the signals efficiently.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126466428","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
扫码关注我们
求助内容：
应助结果提醒方式：