著者

Kazunori HAYASHI Masaaki NAGAHARA Toshiyuki TANAKA

出版者

The Institute of Electronics, Information and Communication Engineers

雑誌

IEICE TRANSACTIONS on Communications (ISSN:09168516)

巻号頁・発行日

vol.E96-B, no.3, pp.685-712, 2013-03-01

被引用文献数

177

---

This survey provides a brief introduction to compressed sensing as well as several major algorithms to solve it and its various applications to communications systems. We firstly review linear simultaneous equations as ill-posed inverse problems, since the idea of compressed sensing could be best understood in the context of the linear equations. Then, we consider the problem of compressed sensing as an underdetermined linear system with a prior information that the true solution is sparse, and explain the sparse signal recovery based on 1 optimization, which plays the central role in compressed sensing, with some intuitive explanations on the optimization problem. Moreover, we introduce some important properties of the sensing matrix in order to establish the guarantee of the exact recovery of sparse signals from the underdetermined system. After summarizing several major algorithms to obtain a sparse solution focusing on the 1 optimization and the greedy approaches, we introduce applications of compressed sensing to communications systems, such as wireless channel estimation, wireless sensor network, network tomography, cognitive radio, array signal processing, multiple access scheme, and networked control.

著者

Kotaro Matsuoka Yasutomo Yushima Ryo Hayakawa Riho Kawasaki Kazunori Hayashi Megumi Kaneko

出版者

(社)電子情報通信学会

雑誌

IEICE Communications Express (ISSN:21870136)

巻号頁・発行日

pp.2016XBL0012, (Released:2016-02-22)

---

This paper proposes a tag identification protocol built upon Boolean compressed sensing (CS) for radio frequency identification (RFID) systems. Unlike the conventional CS-based tag identification (CS-ID) protocol, the proposed protocol can cope with flat fading channels without explicit channel estimation. Simulation results show that the proposed scheme requires less amount of bits for successful identification than dynamic framed slotted ALOHA (DFSA) protocol, and that it even outperforms the conventional CS-ID protocol with perfect channel information.

著者

Kotaro Matsuoka Yasutomo Yushima Ryo Hayakawa Riho Kawasaki Kazunori Hayashi Megumi Kaneko

出版者

The Institute of Electronics, Information and Communication Engineers

雑誌

IEICE Communications Express (ISSN:21870136)

巻号頁・発行日

vol.5, no.5, pp.118-123, 2016 (Released:2016-05-01)

参考文献数

9

---

This paper proposes a tag identification protocol built upon Boolean compressed sensing (CS) for radio frequency identification (RFID) systems. Unlike the conventional CS-based tag identification (CS-ID) protocol, the proposed protocol can cope with flat fading channels without explicit channel estimation. Simulation results show that the proposed scheme requires less amount of bits for successful identification than dynamic framed slotted ALOHA (DFSA) protocol, and that it even outperforms the conventional CS-ID protocol with perfect channel information.