------, "The capacity of wireless networks," IEEE Trans. on Inf. Th., vol. 46, no. 2, pp. 388--404, Mar. 2000.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....is frequency estimation and phase unwrapping [19] The complexity of the general closest point problem as a function of the dimension was analyzed by van Emde 0018 9448 02 17.00 2002 IEEE Boas [74] two decades ago, who showed that this problem is NP hard. Micciancio gave a simpler proof in [55]. Thus, all known algorithms for solving the problem optimally have exponential complexity. It is known [9] that finding an approximate solution, such that the ratio between the distance found and the true distance is upper bounded by a constant, is also NP hard. Even finding a suboptimal solution ....

, "The hardness of the closest vector problem with preprocessing," IEEE Trans. Inform. Theory, vol. 47, pp. 1212--1215, Mar. 2001.

....deployment of such advanced transmission systems in multipair cables can result in server degradation due to cochannel interference. This interference is a linear coupling among multiple channels, also called crosstalk [1] Even though this problem has been studied in the past [2] 3] 4] [5], solutions for real world DSL services deployment are not currently available. Even low data rate implementation, such as ISDN service, can significantly pollute the copper network. The current DSL systems are modeled as single user channel models and crosstalk is treated as white Gaussian noise ....

--, "The Cyclostaionary Nature of Crosstalk Interference from Digital Signals in Multipair Cable - Part II: Application and Further Results," IEEE Trans. Commun., vol. 31, May 1983.

.... that our notion of memoryuniversality is distinct from the notion of universal consistency traditionally considered in the nonparametric estimation literature where it means convergence under the weakest possible regularity constraints on the underlying process, see, for example, Algoet [2] [3], Devroye, Gy orfi, and Lugosi [20] Morvai, Yakowitz, and Gy orfi [36] and Stone [48] In this paper, we assume that the underlying random process is bounded and exponentially strongly mixing, hence our estimators are not universally consistent in the traditional sense. By the martingale ....

....of the sequence is linear (in the observations) and finitely parameterized, while for stationary random processes considered here the elements of the sequence are neither linear nor finitely parameterized. Recently, supposing that the process is realvalued, stationary, and ergodic, Algoet [2] [3], Morvai, Yakowitz, and Gy orfi [36] and Morvai, Yakowitz, and Algoet [35] proposed several nonparametric estimators of the predictor function , and established universal consistency of their estimators. This is distinct from memory universality which is the main focus of this paper. ....

, "The strong law of large numbers for sequential decisions under uncertainty," IEEE Trans. Inform. Theory, vol. 40, pp. 609--633, May 1994.

....by a search in a trellis of length N and width 2 [7] This still becomes impractical when L is large, since the computational complexity of the VA increases exponentially with L. A number of researchers have addressed this problem suggesting complexity reducing solutions of two basic types, linear [4, 6, 8, 14] and non linear [2, 9, 16] Linear preprocessing, treated here, simplifies MLSE by giving the VA a channel model with a memory length shorter than L, and by applying a linear preprocessor, with pulse response ge of lengt,h J, to the received data ye . The preprocessor shapes the overall system ....

C.T.Beare: The Choice of the Desired Impulse Response in Combined Linear-Viterbi Algorithm Equalizers. IEEE Trans. Comm. , 26, 1978, pp. 1301 - 1307.

....which offers the capability of multipacket reception (MPR) presents new challenges for medium access control in wireless networks. As a commonly seen form of MPR, the capture effect first drew the attention of researchers. The impact of capture on the performance of slotted ALOHA is studied in [2], 9] 13] 19] 24] 27] 28] and references therein. The performance of the FCFS algorithm in channels with capture is analyzed in [23] In [3] 18] and [25] the window random access protocol [20] is extended to networks with capture and its performance is evaluated. A hybrid protocol ....

, "The throughput of packet broadcasting channels," IEEE Trans. Commun., vol. COM-25, pp. 117--128, Jan. 1977.

....questions will be answered if the characterization of the entire union capacity region is done. Our current efforts are directed towards solving this important open question. In this paper we have focussed on symbol synchronous CDMA systems. Indeed, most existing capacity results except [1] [9] pertain to the symbol synchronous case. The extension of our results to the asynchronous situation is also interesting and is an important open problem. APPENDIX PROOF OF LEMMA 4.1 We reproduce here for completeness the proof that if is majorized by then may be derived from by successive ....

, "The capacity region of the symbol-asynchronous Gaussian multiple-access channel," IEEE Trans. Inform. Theory, vol. 35, pp. 735--751, July 1989.

....admissible spectra. Yet, Byrnes et al. 3] 4] went on to explore an important subclass of low dimension regular spectra and developed a new set of tunable high resolution estimators. The relevant mathematical theory for low dimension interpolants has been developed in [3] 7] and [9] [11]. Finally, in [3] and [4] it was argued and supported by case studies that proximity of the filter bank poles to a chosen frequency band leads to improved resolution. 1053 587X 00 10.00 2000 IEEE GEORGIOU: SIGNAL ESTIMATION VIA SELECTIVE HARMONIC AMPLIFICATION 781 The input to state filters in ....

, "The interpolation problem with a degree constraint," IEEE Trans. Automat. Contr., vol. 44, pp. 631--635, Mar. 1999.

....Riordan in [5] focuses on the overflow from the GI M s loss system, while Halfin in [4] looked at the GI G 1 loss system overflow. When considering the specific case of Markov Modulated Poisson Process (MMPP) arrivals, one can refer to [8] for the general analysis of the MMPP G 1 queue and to [9] for the networks of MMPP M s r queues analysis. The second issue deals with services of di#erent types of customers, within a server. A general presentation of queues with priorities and with Poisson arrivals and exponential service time can be found in [11] Gross and Harris ( 7] pp 195 205) ....

....Riordan [5] stated that the inter overflow time from an M M r loss system has an hyperexponential distribution of order r 1 with a general form: F (t) r 1 # i=1 a i (1 exp( b i t) with # i a i = 1 (1) where the parameters a i and b i can be computed numerically. Meier Hellstern [9] analyzed the overflow from an MMPP M r b system and proposed to approximate it with an hyperexponential distribution of order 2, or equivalently an Interrupted Poisson Process. Hordijk and Ridder, in [12] focus on inequalities for overflow approximations. We propose to approximate the inter ....

K. Meier-Hellstern The Analysis of a Queue Arising in Overflow Models, IEEE Trans. on Comm. vol 37, No 4, April 1989, 367-372

....of all solutions satisfying (3.3) requires a new paradigm. In fact, the requirement that the degree of the interpolant be at most imposes a (highly nontrivial) nonlinear constraint on the class of solutions. The study of this constraint solution set has led to a rich theory, 2] 10] and [16] [19], which has lead to the following complete parameterization of all such solutions in terms of spectral zeros. We recall that a polynomial is called stable if all its root are located in the open unit disc . Theorem 3.1: Let be a self conjugate set of distinct points inside the unit circle and a ....

....the so called rational covariance extension problem. Existence was first proven in this context in [16] and [18] and uniqueness, as well as well posedness, in [5] see [7] and [8] for alternative proofs. Existence for the distinct point Nevanlinna Pick problem was proven in [17] and uniqueness in [19]. Theorem 3.1 is available in a somewhat more general form, allowing to have roots on the circle [19] BYRNES et al. NEW APPROACH TO SPECTRAL ESTIMATION: TUNABLE HIGH RESOLUTION SPECTRAL ESTIMATOR 3193 However, all these proofs are nonconstructive, and thus, they do not provide a method of ....

[Article contains additional citation context not shown here]

, "The interpolation problem with a degree constraint," IEEE Trans. Automat. Contr., vol. 44, pp. 631--635, 1999.

....eq. 2.1) The results associated with a WB approach and no ICTS do not change if frame synchronization is relaxed as in this case it readily follows that the Poltyrev Hui Humblet [26] 27] conclusion holds for the sum rate 7 . All the results are definitely affected by symbol asynchronism [11] and hence also in this respect the model examined is idealized. Note, however, that even for the time asynchronous scenario when no ICTS is employed, the full Gaussian achievable rate region 6 Assuming the codebooks of the users of these cells are available to the receiver. 7 In ....

, "The capacity region of the symbol-asynchronous Gaussian multiple-access channel," IEEE Trans. Inform. Theory, vol. 35, pp. 733--751, July 1989.

....feedback using the Kailath Schalkwijk coding scheme, in which one uses feedback to attempt to correct the misperceptions of as seen by the transmitter. Their method, however, does not generalize to more than two receivers. Work on feedback capacity for broadcast channels appears in [29] 31] [34], 71] 72] 80] and [81] Poltyrev [84] 87] looked at the reversely degraded broadcast channel (see also Hughes Hartogs [57] for the Gaussian channel and Ohkubo [75] Later, El Gamal [33] furnished a proof of the converse, thus establishing the Poltyrev region for the reversely degraded ....

, "The capacity of the physically degraded Gaussian broadcast channel with feedback," IEEE Trans. Inform. Theory, vol. IT-27, p. 508, July 1981.

....of reliability function, randomized code reliability function, and random coding error exponent of a channel. Our survey does not address these important notions LAPIDOTH AND NARAYAN: RELIABLE COMMUNICATION UNDER CHANNEL UNCERTAINTY 2153 for which we direct the reader to [43] 44] 46] 64] [65], 95] 115] 116] and references therein. In the situations considered above, quite often the selection of codes is restricted in that the transmitted codewords must satisfy appropriate input constraints. Let be a nonnegativevalued function on , and let (20) where, for convenience, we assume ....

, "The random coding bound is tight for the average code," IEEE Trans. Inform. Theory, vol. IT-19, pp. 244--246, Mar. 1973.

No context found.

------, "The union bound for turbo-coded modulation systems over fading channels," IEEE Trans. Commun., vol. 47, no. 10, pp. 1495--1502, Oct. 1999.

No context found.

, The matrix sign function, IEEE Trans. Automat. Control, 40 (1995), pp. 1330--1348.

.... studied in [23] 24] The effects of joint torsional elasticity on an implicit integral force controller and an implicit impedance controller are described in [25] and [26] respectively, while the interplay between the integrator in the inner PID loop and joint flexibility is studied in [27]. The development of a hydro elastic actuator which implements an implicit PI type force controller is reported in [28] While most previously reported implicit hybrid (or force) controllers guarantee asymptotically exact force set point regulation under exact inner loop position velocity ....

, "Toward the impelementation of hybrid position/force control in industrial robots," IEEE Trans. Robot. Automat., vol. 13, pp. 838--845, Dec. 1997.

....by polygonal silhouettes. Section 8 contains open problems and concluding remarks. V2 Fig. 1 The volume intersection technique 1.1 Visual hull and hard points In this section we briefly review some definitions relevant to our problem. First, the concept of visual hull of an object [8], 9] 10] allows answering questions such as: can the shape of an object be fully understood from its silhouettes If not, which is the closest approximation that can be obtained Can an object be distinguished from another using silhouettes only The visual hull is the object that can be ....

....In the following, when not otherwise explicitly stated, we will use the expressions object and compatible object referring to an object reconstructed by VI. The reconstructed object could be the visual hull of the real object, and in any case satisfies the properties of a visual hull (see [8]) For instance, in 2D by VI we can only construct convex objects. Equivalently, in 2D all visual hulls are convex, or consist of convex parts if not connected. Although we have not been able to find completely general answers to the previous questions, we will present a set of results that ....

A.Laurentini: The visual hull concept for silhouette-based image understanding," IEEE Trans. on PAMI, Vol. 16, No.2,pp. 150-162, 1994

....are unique and depend analytically on the problem data. In other words, the rational covariance extension problem is well posed as an analytic problem. Subsequently, a simpler proof of uniqueness was given in [8] in a form which has been adapted to the rational Nevanlinna Pick problem in [20], also proving uniqueness for the boundary case when has zeros on the unit circle. However, the proofs developed in [18] 20] 6] and [8] are all nonconstructive and the question of computing such solutions remained open. This issue was first addressed in [7] for the rational covariance ....

....posed as an analytic problem. Subsequently, a simpler proof of uniqueness was given in [8] in a form which has been adapted to the rational Nevanlinna Pick problem in [20] also proving uniqueness for the boundary case when has zeros on the unit circle. However, the proofs developed in [18] [20], 6] and [8] are all nonconstructive and the question of computing such solutions remained open. This issue was first addressed in [7] for the rational covariance extension problem. In fact, for any positive , a convex minimization problem was introduced, the solution of which solves the ....

, "The interpolation problem with a degree constraint," IEEE Trans. Automat. Contr., vol. 44, pp. 631--635, Mar. 1999.

No context found.

The refinement paradigm : The interaction of coding and efficiency knowledge in program synthesis. IEEE Trans. Softw. Eng. 7, 458471.

....a proof of the converse, thus establishing the Poltyrev region for the reversely degraded broadcast channel as the capacity region. Channels in which one receiver is superior to another and channels with nested information were studied by Marton, K orner, Csisz ar, El Gamal, and others [24] [32], 39] 62] 64] V. AN ALTERNATIVE VIEW OF CAPACITY In this section, we illustrate the delicacy of the definition of the capacity region for broadcast channels and multiuser channels in general. We consider a memoryless broadcast channel with receivers . If we were to ignore the needs of all ....

, "The capacity of a class of broadcast channels," IEEE Trans. Inform. Theory, vol. IT-25, pp. 166--169, Mar. 1979.

....two internal states. We can, of course, consider a situation which involves an unknown channel with memory. If the matrix is unknown but remains fixed during a transmission, the LAPIDOTH AND NARAYAN: RELIABLE COMMUNICATION UNDER CHANNEL UNCERTAINTY 2151 channel can be modeled as a compound FSC [91] by setting to be a set of pairs of pmf s of the initial state and stochastic matrices with (8) where, with an abuse of notation, denotes a generic element of . Example 5: A compound Gilbert Elliott channel [91] is a family of Gilbert Elliott channels indexed by some set where each channel in ....

....UNDER CHANNEL UNCERTAINTY 2151 channel can be modeled as a compound FSC [91] by setting to be a set of pairs of pmf s of the initial state and stochastic matrices with (8) where, with an abuse of notation, denotes a generic element of . Example 5: A compound Gilbert Elliott channel [91] is a family of Gilbert Elliott channels indexed by some set where each channel in the family has a different set of parameters . More severe yet is a situation where the channel parameters may vary in an arbitrary manner from symbol to symbol during a transmission. This situation can be modeled ....

[Article contains additional citation context not shown here]

, "The compound channel capacity of a class of finite-state channels," IEEE Trans. Inform. Theory, vol. 44, pp. 973--983, May 1998.

....correlated source (i.e. an i.i.d. process with generic rv s which satisfy ) and have shown that equals the randomized code capacity given by Theorem 2. The performance of an AVC (5) using deterministic list codes (cf. 32) and (33) is examined in [5] 12] 14] 33] 35] 82] and [83]. The value of this capacity for the maximum probability of error and vanishingly small list rate was determined by Ahlswede [5] Lower bounds on the sizes of constant lists for a given average probability of error and an arbitrarily small maximum probability of error, respectively, were obtained ....

....code capacity given by Theorem 2. A complete characterization of the deterministic list code capacity for the average probability of error, based on an extended notion of symmetrizability (cf. 58) was obtained by Blinovsky, Narayan, and Pinsker [33] and, independently, by Hughes [82] [83]. We conclude this section by noting the role of compound DMC s and AVC s in the study of communication situations partially controlled by an adversarial jammer. For dealing with such situations, several authors (cf. e.g. 36] 79] and [97] have proposed a game theoretic approach which ....

, "The smallest list for the arbitrarily varying channel," IEEE Trans. Inform. Theory, vol. 43, pp. 803--815, May 1997.

.... and state constraints in (112) 114) on individual codewords and state sequences are weakened to restrictions on the expected values of the respective powers, the Gaussian AVC (111) ceases to have a strong converse; see [80] The results of Theorem 14 can be extended to a vector Gaussian AVC [81] (see also [41] Earlier work on the randomized code capacity of the Gaussian AVC (111) is due to Blachman [27] 28] who provided lower and upper bounds on capacity when the state sequence is allowed to depend on the actual codeword transmitted. Also, the randomized code capacity problem for the ....

, "The capacity of a vector Gaussian arbitrarily varying channel," IEEE Trans. Inform. Theory, vol. 34, pp. 995--1003, Sept. 1988.

No context found.

------, "The capacity of wireless networks," IEEE Trans. on Inf. Th., vol. 46, no. 2, pp. 388--404, Mar. 2000.

No context found.

, "The generalized distributive law," IEEE Trans. Inform. Theory, vol. 46, pp. 325--343, Mar. 2000.

No context found.

The refinement paradigm : The interaction of coding and efficiency knowledge in program synthesis. IEEE Trans. Softw. Eng. 7, 458471.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC