Name
Abstract | ||
|---|---|---|
This letter proposes a sparse diffusion algorithm for 1-bit compressed sensing (CS) in wireless sensor networks, and the algorithm is inherently robust against impulsive noise. The approach exploits the diffusion strategy from distributed learning in the 1-bit CS framework. To estimate a common sparse vector cooperatively from only the sign of measurements, a steepest descent method that minimizes the suitable global and local convex cost functions is used. A diffusion strategy is suggested for distributive learning of the sparse vector. A new application of the proposed algorithm to sparse channel estimation is also introduced. The proposed sparse diffusion algorithm is compared with both the state-of-the-art nondistributed and distributed algorithms. Simulation results show the effectiveness of the proposed distributed algorithm and its robustness against impulsive noise. Furthermore, the sparse channel estimation results show the superior performance of the proposed algorithm to other algorithms under impulsive noise environment. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/LCOMM.2016.2550589 | IEEE Communications Letters |
Keywords | Field | DocType |
Cost function,Wireless sensor networks,Estimation,Compressed sensing,Noise measurement,Robustness,Channel estimation | Distributive property,Method of steepest descent,Noise measurement,Computer science,Algorithm,Communication channel,Robustness (computer science),Distributed algorithm,Wireless sensor network,Compressed sensing | Journal |
Volume | Issue | ISSN |
20 | 6 | 1089-7798 |
Citations | PageRank | References |
7 | 0.47 | 12 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hadi. Zayyani | 1 | 96 | 15.51 |
| Mehdi Korki | 2 | 46 | 5.98 |
| Farrokh Marvasti | 3 | 113 | 13.55 |