Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 10,000 papers for “characteristic function”

CHARACTERISTIC FUNCTION

Yury Veshkurtsev · AUS PUBLISHERS eBooks · 2022

The monography presents the fundamentals of the theory of construction new-generation modems. Modems are built on the principles of statistical communication theory, based on the use of a random signal (chaos) as a carrier of information. In such a signal, a characteristic function is modulated, which is a fundamental characteristic of a random process. The signal modulation and demodulation method is patented and allows you to create modems with efficiency and noise immunity indicators several orders of magnitude higher than those of the known devices of the same name. New-generation modems immediately improve the technical characteristics of digital IT equipment by several orders of magnitude, since they work without errors in wired and radio channels when receiving one hundred duodecillion of binary symbols. The book is recommended for scientists and specialists in the field of digital communication systems, statistical radio engineering and instrumentation, and may be useful for graduate students, masters and students of relevant specialties.

Cited by 0

Abstract Characteristic Function

Bhattacharyya, Tirthankar · NOT FOUND REPOSITORY (Indian Institute of Science Bangalore) · 2012

The characteristic function for a contraction is a classical complete unitary invariant devised by Sz.-Nagy and Foias. Just as a contraction is related to the Szego kernel k(S)(z, w) = ( 1 - z(w)over bar)- 1 for |z|, |w| < 1, by means of (1/k(S))( T, T *) = 0, we consider an arbitrary open connected domain Omega in C(n), a kernel k on Omega so that 1/k is a polynomial and a tuple T = (T(1), T(2), ... , T(n)) of commuting bounded operators on a complex separable Hilbert spaceHsuch that (1/k)( T, T *) >= 0. Under some standard assumptions on k, it turns out that whether a characteristic function can be associated with T or not depends not only on T, but also on the kernel k. We give a necessary and sufficient condition. When this condition is satisfied, a functional model can be constructed. Moreover, the characteristic function then is a complete unitary invariant for a suitable class of tuples T.

Cited by 0

Moment-generating function and characteristic function

Hisashi Kobayashi, Brian L. Mark, William Turin · Cambridge University Press eBooks · 2011

A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.

Cited by 1

A Characteristic Function Exercise

Nathan Mantel · The American Statistician · 1973

A heuristic demonstration that Y = X1X2 + X3X4 follows the Laplace or double exponential distribution [i.e., f(Y) = 2 exp(Y )] if the Xi are independently and normally distributed, N(O, 1), was given by M\lantel and Pasternack (2); see also M\antel (1). M\ore formally, the same result could have been demonstrated by use of characteristic functions making use of the unique correspondence between a distribution function and its characteristic function. I give below a particularly simple demonstration of the result based on characteristic functions using foreknowledge of characteristic functions only for the N(O, 1) distribution and for the one d.f. chi-square distribution, x2(1). The characteristic function corresponding to the distribution of a random variable X is defined as the expected value of the exponential of itX, i.e. E[exp (itX) ], expressed as a function of t. The following tabulation shows the N (0, 1) characteristic function and the derivation of the Laplace characteristic function starting with that for x2 (1).

Cited by 6

Characteristic function form games

Joseph Greenberg · Cambridge University Press eBooks · 1990

In this chapter the theory of social situations is applied to the simplest of the three types of games – games in characteristic function form (known also as cooperative games). Several possible ways to represent such games as situations will be suggested. As in the procedural voting-by-veto model (Example 3.6), this demonstrates that the description of a social environment as a cooperative game is incomplete. It omits some essential information. I shall argue that a cooperative game specifies the power coalitions have if and when they form, but it is totally silent on the crucial issue of how exactly this power can be used. (As every card player knows, the distribution of the cards does not, in itself, suffice to determine the course of the game; it is important to know how the “hands” are played.)

Cited by 0