### Abstract

Original language | English |
---|---|

Title of host publication | Proceedings of the 12th IEEE International Symposium on Signal Processing and Information Technology |

Number of pages | 6 |

Publisher | IEEE |

Publication date | 2012 |

Pages | 141-146 |

ISBN (Print) | 978-1-4673-5604-6 |

DOIs | |

Publication status | Published - 2012 |

Event | IEEE International Symposium on Signal Processing and Information Technology - Ho Chi Minh City, Viet Nam Duration: 12 Dec 2012 → 15 Dec 2012 |

### Conference

Conference | IEEE International Symposium on Signal Processing and Information Technology |
---|---|

Country | Viet Nam |

City | Ho Chi Minh City |

Period | 12/12/2012 → 15/12/2012 |

### Fingerprint

### Cite this

*Proceedings of the 12th IEEE International Symposium on Signal Processing and Information Technology*(pp. 141-146). IEEE. https://doi.org/10.1109/ISSPIT.2012.6621276

}

*Proceedings of the 12th IEEE International Symposium on Signal Processing and Information Technology.*IEEE, pp. 141-146, IEEE International Symposium on Signal Processing and Information Technology, Ho Chi Minh City, Viet Nam, 12/12/2012. https://doi.org/10.1109/ISSPIT.2012.6621276

**Downsampling of DFT Precoded Signals for the AWGN Channel.** / Jensen, Tobias Lindstrøm; Fyhn, Karsten; Arildsen, Thomas; Larsen, Torben.

Research output: Contribution to book/anthology/report/conference proceeding › Article in proceeding › Research › peer-review

TY - GEN

T1 - Downsampling of DFT Precoded Signals for the AWGN Channel

AU - Jensen, Tobias Lindstrøm

AU - Fyhn, Karsten

AU - Arildsen, Thomas

AU - Larsen, Torben

PY - 2012

Y1 - 2012

N2 - In this paper we propose and analyze a method for downsampling discrete Fourier transform (DFT) precoded signals. Since the symbols (in frequency) are in the constellation set, which is a subset of the entire complex plane, it is possible to detect N symbols from the DFT precoded signal when transmitting M < N symbols, whereM is not too small. We build our analysis on so-called simple vectors, and show that it is possible to detect in the noise-less case with high probability down to approximately M ≥ N/4 for BPSK and M ≥ N/2 for QPSK. We develop extensions from the noise-less to the noisy case, and propose two different detectors for the AWGN channel. Simulations show that using the two proposed detectors in the AWGN channel, we observe empirically a phase transition at M ≈ N/2 for QPSK. Further, it is shown how downsampled QPSK signals can achieve the same BER and data rate as 8PSK at a lower signal-to-noise-ratio per information bit.

AB - In this paper we propose and analyze a method for downsampling discrete Fourier transform (DFT) precoded signals. Since the symbols (in frequency) are in the constellation set, which is a subset of the entire complex plane, it is possible to detect N symbols from the DFT precoded signal when transmitting M < N symbols, whereM is not too small. We build our analysis on so-called simple vectors, and show that it is possible to detect in the noise-less case with high probability down to approximately M ≥ N/4 for BPSK and M ≥ N/2 for QPSK. We develop extensions from the noise-less to the noisy case, and propose two different detectors for the AWGN channel. Simulations show that using the two proposed detectors in the AWGN channel, we observe empirically a phase transition at M ≈ N/2 for QPSK. Further, it is shown how downsampled QPSK signals can achieve the same BER and data rate as 8PSK at a lower signal-to-noise-ratio per information bit.

UR - http://sparsesampling.com/dft_precoding/

U2 - 10.1109/ISSPIT.2012.6621276

DO - 10.1109/ISSPIT.2012.6621276

M3 - Article in proceeding

SN - 978-1-4673-5604-6

SP - 141

EP - 146

BT - Proceedings of the 12th IEEE International Symposium on Signal Processing and Information Technology

PB - IEEE

ER -