English
Related papers

Related papers: Improved QPP Interleavers for LTE Standard

200 papers

Virtual quark pair screening leads to breaking of the string between fundamental representation quarks in QCD. For unquenched four dimensional lattice QCD, this (so far elusive) phenomenon is studied using the recently developed truncated…

High Energy Physics - Lattice · Physics 2009-12-31 A. Duncan , E. Eichten , H. Thacker

Interleaving is a mechanism universally used in wireless access technologies to alleviate the effect of channel correlation. In spite of its wide adoption, to the best of our knowledge, there are no analytical models proposed so far. In…

Information Theory · Computer Science 2018-01-31 Dmitri Moltchanov , Pavel Kustarev , Yevgeni Kucharyavy

Large Language Models (LLMs) have pushed the frontier of artificial intelligence but are comprised of hundreds of billions of parameters and operations. For faster inference latency, LLMs are deployed on multiple hardware accelerators…

Machine Learning · Computer Science 2026-01-07 Jan Hansen-Palmus , Michael Truong Le , Oliver Hausdörfer , Alok Verma

There exist two issues among popular lattice reduction (LR) algorithms that should cause our concern. The first one is Korkine-Zolotarev (KZ) and Lenstra-Lenstra-Lovasz (LLL) algorithms may increase the lengths of basis vectors. The other…

Information Theory · Computer Science 2017-10-12 Shanxiang Lyu , Cong Ling

This paper investigates the co-existence of Wi-Fi and LTE in emerging unlicensed frequency bands which are intended to accommodate multiple radio access technologies. Wi-Fi and LTE are the two most prominent access technologies being…

Information Theory · Computer Science 2016-11-17 Shweta Sagari , Samuel Baysting , Dola Saha , Ivan Seskar , Wade Trappe , Dipankar Raychaudhuri

An algorithm for generating interpolants for formulas which are conjunctions of quadratic polynomial inequalities (both strict and nonstrict) is proposed. The algorithm is based on a key observation that quadratic polynomial inequalities…

Logic in Computer Science · Computer Science 2016-11-14 Ting Gan , Liyun Dai , Bican Xia , Naijun Zhan , Deepak Kapur , Mingshuai Chen

A reformulation of the path length of binary search trees is given in terms of permutations, allowing to extend the definition to the instance of words, where the letters are obtained by independent geometric random variables (with…

Combinatorics · Mathematics 2007-05-23 Helmut Prodinger

We consider a version of the nearest-codeword problem on finite fields $\mathbb{F}_q$ using the Manhattan distance, an analog of the Hamming metric for non-binary alphabets. Similarly to other lattice related problems, this problem is…

Quantum Physics · Physics 2023-09-13 Lior Eldar

Constant amplitude zero autocorrelation (CAZAC) sequences have modulus one and ideal periodic autocorrelation function. Such sequences are used in cellular radio communications systems, e.g., for reference signals, synchronization signals…

Information Theory · Computer Science 2024-04-29 Fredrik Berggren , Branislav M. Popovic

Post-training quantization of Large Language Models (LLMs) has proven effective in reducing the memory and computational requirements for inference. In this study, we focus on a straightforward question: When aiming for a target accuracy or…

Computation and Language · Computer Science 2025-08-08 Zeyu Cao , Boyang Gu , Cheng Zhang , Pedro Gimenes , Jianqiao Lu , Jianyi Cheng , Xitong Gao , Yiren Zhao

The non-cloning theorem of quantum states provides security, but also limits the Secret Key Rate (SKR) for Quantum Key Distribution (QKD) implementations. Multiplexing is a widely used technique to enhance data rates in classical…

For any lattice polytope $P$, we consider an associated polynomial $\bar{\delta}_{P}(t)$ and describe its decomposition into a sum of two polynomials satisfying certain symmetry conditions. As a consequence, we improve upon known…

Combinatorics · Mathematics 2009-09-24 Alan Stapledon

Given a parametric lattice with a basis given by polynomials in Z[t], we give an algorithm to construct an LLL-reduced basis whose elements are eventually quasi-polynomial in t: that is, they are given by formulas that are piecewise…

Combinatorics · Mathematics 2020-09-22 Tristram Bogart , John Goodrick , Kevin Woods

We consider the decoding of LDPC codes over GF(q) with the low-complexity majority algorithm from [1]. A modification of this algorithm with multiple thresholds is suggested. A lower estimate on the decoding radius realized by the new…

Information Theory · Computer Science 2015-02-25 Alexey Frolov , Victor Zyablov

We study numerical integration of smooth functions defined over the $s$-dimensional unit cube. A recent work by Dick et al. (2019) has introduced so-called extrapolated polynomial lattice rules, which achieve the almost optimal rate of…

Numerical Analysis · Mathematics 2020-07-15 Takashi Goda

Inspired by the power of large language models (LLMs), our research adapts them to quantum federated learning (QFL) to boost efficiency and performance. We propose a federated fine-tuning method that distills an LLM within QFL, allowing…

Machine Learning · Computer Science 2025-05-27 Dev Gurung , Shiva Raj Pokhrel

We consider the problem of estimating the distance, or range, between two locations by measuring the phase of multiple sinusoidal signals transmitted between the locations. Traditional estimators developed for optical interferometry include…

Information Theory · Computer Science 2016-09-21 Assad Akhlaq , Robby McKilliam , Ramanan Subramanian , Andre Pollok

As present day quantum hardware is limited by various noise mechanisms, quantum advantage can only be reached in the near-term by designing noise-resilient quantum algorithms. In this work, we employ state-of-the-art quantum process…

Quantum Physics · Physics 2025-10-01 Maria Dinca , David J. Luitz , Maxime Debertolis

Transformers, the standard implementation for large language models (LLMs), typically consist of tens to hundreds of discrete layers. While more layers can lead to better performance, this approach has been challenged as far from efficient,…

Machine Learning · Computer Science 2025-05-21 Yen-Chen Wu , Feng-Ting Liao , Meng-Hsi Chen , Pei-Chen Ho , Farhang Nabiei , Da-shan Shiu

In this paper, the problem of designing a linear precoder for Multiple-Input Multiple-Output (MIMO) systems in conjunction with Quadrature Amplitude Modulation (QAM) is addressed. First, a novel and efficient methodology to evaluate the…

Information Theory · Computer Science 2016-03-10 Thomas Ketseoglou , Ender Ayanoglu