Results 11  20
of
287
Codeword Design for UltraWideband (UWB) Precoding
"... Abstract—A precoding technique applied to symbols transmitted in an ultrawideband (UWB) system can concentrate the signal power at the receiver for a higher data detection rate. The codeword design problem for optimal UWB precoding is investigated in this work. After the problem formulation, we e ..."
Abstract
 Add to MetaCart
Abstract—A precoding technique applied to symbols transmitted in an ultrawideband (UWB) system can concentrate the signal power at the receiver for a higher data detection rate. The codeword design problem for optimal UWB precoding is investigated in this work. After the problem formulation, we
Polynomial Fitting of Data Streams with Applications to Codeword Testing
"... Given a stream of (x, y) points, we consider the problem of finding univariate polynomials that best fit the data. Over finite fields, this problem encompasses the wellstudied problem of decoding ReedSolomon codes while over the reals it corresponds to the wellstudied polynomial regression proble ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Given a stream of (x, y) points, we consider the problem of finding univariate polynomials that best fit the data. Over finite fields, this problem encompasses the wellstudied problem of decoding ReedSolomon codes while over the reals it corresponds to the wellstudied polynomial regression
Simultaneous codeword optimization (SimCO) for dictionary update and learning
 IEEE Trans. Signal Process
, 2012
"... Abstract—We consider the datadriven dictionary learning problem. The goal is to seek an overcomplete dictionary from which every training signal can be best approximated by a linear combination of only a few codewords. This task is often achieved by iteratively executing two operations: sparse cod ..."
Abstract

Cited by 14 (8 self)
 Add to MetaCart
of codewords and the corresponding sparse coefficients simultaneously: when sparse coefficients are fixed, the underlying optimization problem is the same as that in the MOD algorithm; when only one codeword is selected for update, it can be proved that the proposed algorithm is equivalent to the KSVD method
On Multicarrier Signals Where the PMEPR of a Random Codeword is Asymptotically log n
 IEEE Trans. Inform. Theory
, 2004
"... Abstract—Multicarrier signals exhibit a large peaktomean envelope power ratio (PMEPR). In this correspondence, without using a Gaussian assumption, we derive lower and upper probability bounds for the PMEPR distribution when the number of subcarriers is large. Even though the worst case PMEPR is o ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
Abstract—Multicarrier signals exhibit a large peaktomean envelope power ratio (PMEPR). In this correspondence, without using a Gaussian assumption, we derive lower and upper probability bounds for the PMEPR distribution when the number of subcarriers is large. Even though the worst case PMEPR
Codeword Optimization for Asynchronous CDMA Systems Through Interference Avoidance
 In CISS 2002
, 2002
"... Abstract — The paper investigates application of interference avoidance to asynchronous CDMA systems for which symbol intervals corresponding to different users may not be necessarily synchronized at the receiver. The asynchronous system is modeled as framesynchronous with symbols sent in parallel u ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Abstract — The paper investigates application of interference avoidance to asynchronous CDMA systems for which symbol intervals corresponding to different users may not be necessarily synchronized at the receiver. The asynchronous system is modeled as framesynchronous with symbols sent in parallel
Dictionary learning and update based on simultaneous codeword optimization (SimCO
 Proc. ICASSP
"... ABSTRACT Dictionary learning aims to adapt elementary codewords directly from training data so that each training signal can be best approximated by a linear combination of only a few codewords. Following the twostage iterative processes: sparse coding and dictionary update, that are commonly used ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
used, for example, in the algorithms of MOD and KSVD, we propose a novel framework that allows one to update an arbitrary set of codewords and the corresponding sparse coefficients simultaneously, hence termed simultaneous codeword optimization (SimCO). Under this framework, we have developed two
Description Of Minimum Weight Codewords Of Cyclic Codes By Algebraic Systems
 FINITE FIELDS APPL
, 1996
"... We consider cyclic codes of length n over F q , n being prime to q. For such a cyclic code C, we describe a system of algebraic equations, denoted by SC (w), where w is a positive integer. The system is constructed from Newton's identities, which are satisfied by the elementary symmetric func ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
functions and the (generalized) power sum symmetric functions of the locators of codewords of weight w. The main result is that, in a certain sense, the algebraic solutions of SC (w) are in onetoone correspondence with all the codewords of C having weight lower than w. In the particular case where w
On the role of common codewords in quadratic Gaussian multiple descriptions coding
 In Arxiv: http://arxiv.org/abs/1305.3375
, 2013
"... Abstract—This paper focuses on the problem of L−channel quadratic Gaussian multiple description (MD) coding. We recently introduced a new encoding scheme in [1] for general L−channel MD problem, based on a technique called ‘Combinatorial Message Sharing ’ (CMS), where every subset of the descripti ..."
Abstract
 Add to MetaCart
scenarios where for all 2description subsets, the ZB and EC regions coincide. In particular, we show that CMS strictly extends VKG region, for the Lchannel quadratic Gaussian MD problem for all L ≥ 3, despite the fact that the EC region is complete for the corresponding 2descriptions problem. Using
The relayeavesdropper channel: Cooperation for secrecy
 IEEE Trans. on Inf. Theory
, 2006
"... This paper establishes the utility of user cooperation in facilitating secure wireless communications. In particular, the fourterminal relayeavesdropper channel is introduced and an outerbound on the optimal rateequivocation region is derived. Several cooperation strategies are then devised and ..."
Abstract

Cited by 158 (7 self)
 Add to MetaCart
and the corresponding achievable rateequivocation region are characterized. Of particular interest is the novel NoiseForwarding (NF) strategy, where the relay node sends codewords independent of the source message to confuse the eavesdropper. This strategy is used to illustrate the deaf helper phenomenon, where
On the small weight codewords of the functional codes C2(Q), Q a nonsingular quadric
, 2009
"... We study the small weight codewords of the functional code C2(Q), with Q a nonsingular quadric of PG(N,q). We prove that the small weight codewords correspond to the intersections of Q with the singular quadrics of PG(N,q) consisting of two hyperplanes. We also calculate the number of codewords havi ..."
Abstract
 Add to MetaCart
We study the small weight codewords of the functional code C2(Q), with Q a nonsingular quadric of PG(N,q). We prove that the small weight codewords correspond to the intersections of Q with the singular quadrics of PG(N,q) consisting of two hyperplanes. We also calculate the number of codewords
Results 11  20
of
287