Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Information Theory

arXiv:1804.08954 (cs)
[Submitted on 24 Apr 2018]

Title:Efficient Equalization Method for Cyclic Prefix-Free Coarsely Quantized Massive MIMO Systems

Authors:Jawad Munir, Daniel Plabst, Josef A. Nossek
View PDF
Abstract:The use of low resolution Analog to Digital Converters (ADCs) can significantly reduce the power consumption for massive Multiple Input Multiple Output (MIMO) systems. The existing literature on quantized massive MIMO systems deals with Cyclic Prefix (CP) transmission schemes in frequency-selective fading channels. In this paper, we propose a block processing Frequency Domain Equalization (FDE) technique in CP-free transmission schemes for massive MIMO systems having low resolution ADCs. The optimal block length for FDE is found by minimizing a computational complexity cost function and taking quantization distortion, channel impulse response and the number of transmit and receiver antennas into account. Through numerical simulation, it is shown that the optimal block length also guarantees good performance in terms of the Mean Square Error (MSE) and Bit Error-Rate (BER) criterion.
Comments: Submitted to and accepted at ICC 2018
Subjects: Information Theory (cs.IT)
Cite as: arXiv:1804.08954 [cs.IT]
  (or arXiv:1804.08954v1 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.1804.08954

Submission history

From: Daniel Plabst [view email]
[v1] Tue, 24 Apr 2018 11:09:03 UTC (393 KB)
Full-text links:

Access Paper:

  • View PDF
  • Other Formats
view license
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2018-04
Change to browse by:
cs
math
math.IT

References & Citations

DBLP - CS Bibliography

listing | bibtex
Jawad Munir
Daniel Plabst
Josef A. Nossek
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)