Path: Top -> Journal -> Telkomnika -> 2016 -> Vol 14, No 2: June
Low Complexity Sparse Channel Estimation Based on Compressed Sensing
Low Complexity Sparse Channel Estimation Based on Compressed Sensing
Journal from gdlhub / 2016-11-07 02:23:35Oleh : Fei Zhou, Yantao Su, Xinyue Fan, Telkomnika
Dibuat : 2016-06-01, dengan 1 file
Keyword : channel estimation, compressed sensing, computational complexity, index, atom
Url : http://journal.uad.ac.id/index.php/TELKOMNIKA/article/view/3147
In wireless communication, channel estimation is a key technology to receive signal precisely. Recently, a new method named compressed sensing (CS) has been proposed to estimate sparse channel, which greatly improves the spectrum efficiency. However, it is difficult to realize it due to its high computational complexity. Although the proposed Orthogonal Matching Pursuit (OMP) can reduce the complexity of CS, the efficiency of OMP is still low because only one index is identified per iteration.
Therefore, to solve this problem, more efficient schemes are proposed. At first, we apply Generalized Orthogonal Matching Pursuit (GOMP) to channel estimation, which lower computational complexity by selecting multiple indices in each iteration. Then a more effective scheme that selects indices by least squares (LS) method is proposed to significantly reduce the computational complexity, which is a modified method of GOMP. Simulation results and theoretical analysis show the effectivity of the proposed
algorithms.
In wireless communication, channel estimation is a key technology to receive signal precisely. Recently, a new method named compressed sensing (CS) has been proposed to estimate sparse channel, which greatly improves the spectrum efficiency. However, it is difficult to realize it due to its high computational complexity. Although the proposed Orthogonal Matching Pursuit (OMP) can reduce the complexity of CS, the efficiency of OMP is still low because only one index is identified per iteration.
Therefore, to solve this problem, more efficient schemes are proposed. At first, we apply Generalized Orthogonal Matching Pursuit (GOMP) to channel estimation, which lower computational complexity by selecting multiple indices in each iteration. Then a more effective scheme that selects indices by least squares (LS) method is proposed to significantly reduce the computational complexity, which is a modified method of GOMP. Simulation results and theoretical analysis show the effectivity of the proposed
algorithms.
Beri Komentar ?#(0) | Bookmark
Properti | Nilai Properti |
---|---|
ID Publisher | gdlhub |
Organisasi | Telkomnika |
Nama Kontak | Herti Yani, S.Kom |
Alamat | Jln. Jenderal Sudirman |
Kota | Jambi |
Daerah | Jambi |
Negara | Indonesia |
Telepon | 0741-35095 |
Fax | 0741-35093 |
E-mail Administrator | elibrarystikom@gmail.com |
E-mail CKO | elibrarystikom@gmail.com |
Print ...
Kontributor...
- , Editor: sukadi
Download...
Download hanya untuk member.
3147-8506-1-PB
File : 3147-8506-1-PB.pdf
(123366 bytes)