moment based criteria for determining bioequivalence summary in comparative bioavailability trials the focus in the determination of bioequivalence has been to show that the average bioavailability on a test formulation is similar to the average bioavailability on a reference formulation it has been argued that this is not adequate to insure interchangeability of formulations we introduce a moment based criterion which ensures interchangeability for at least a certain proportion of the population an algorithm is given for determining the constant in the criterion an example is used to illustrate how the criterion may be applied

primes in short intervals contrary to what would be predicted on the basis of cramer s model con cerning the distribution of prime numbers we develop evidence that the distribution of x h x for 0 x n is approximately normal with mean h and variance h log n h when n h n 1

random matrix theory and the zeros of ζ s we study the density of the roots of the derivative of the characteristic polynomial z u z of an n n random unitary matrix with distribution given by haar measure on the unitary group based on previous random matrix theory models of the riemann zeta function s this is expected to be an accurate description for the horizontal distribution of the zeros of s to the right of the critical line we show that as n the fraction of the roots of z u z that lie in the region 1 x n 1 z 1 tends to a limit function we derive asymptotic expressions for this function in the limits x and x 0 and compare them with numerical experiments

cayley differential unitary space time codes one method for communicating with multiple antennas is to encode the transmitted data differentially using unitary matrices at the transmitter and to decode differentially without knowing the channel coefficients at the receiver since channel knowledge is not required at the receiver differential schemes are ideal for use on wireless links where channel tracking is undesirable or infeasible either because of rapid changes in the channel characteristics or because of limited system resources although this basic principle is well understood it is not known how to generate good performing constellations of unitary matrices for any number of transmit and receive antennas and for any rate this is especially true at high rates where the constellations must be rapidly encoded and decoded we propose a class of cayley codes that works with any number of antennas and has efficient encoding and decoding at any rate the codes are named for their use of the cayley transform which maps the highly nonlinear stiefel manifold of unitary matrices to the linear space of skew hermitian matrices this transformation leads to a simple linear constellation structure in the cayley transform domain and to an information theoretic design criterion based on emulating a cauchy random matrix moreover the resulting cayley codes allow polynomial time near maximum likelihood ml decoding based on either successive nulling canceling or sphere decoding simulations show that the cayley codes allow efficient and effective high rate data transmission in multiantenna communication systems without knowing the channel

full diversity high rate space time block codes from division algebras we present some general techniques for constructing full rank minimal delay rate at least one space time block codes stbcs over a variety of signal sets for arbitrary number of transmit antennas using commutative division algebras field extensions as well as using noncommutative division algebras of the rational field spl qopf embedded in matrix rings the first half of the paper deals with constructions using field extensions of spl qopf working with cyclotomic field extensions we construct several families of stbcs over a wide range of signal sets that are of full rank minimal delay and rate at least one appropriate for any number of transmit antennas we study the coding gain and capacity of these codes using transcendental extensions we construct arbitrary rate codes that are full rank for arbitrary number of antennas we also present a method of constructing stbcs using noncyclotomic field extensions in the later half of the paper we discuss two ways of embedding noncommutative division algebras into matrices left regular representation and representation over maximal cyclic subfields the 4 spl times 4 real orthogonal design is obtained by the left regular representation of quaternions alamouti s 1998 code is just a special case of the construction using representation over maximal cyclic subfields and we observe certain algebraic uniqueness characteristics of it also we discuss a general principle for constructing cyclic division algebras using the nth root of a transcendental element and study the capacity of the stbcs obtained from this construction another family of cyclic division algebras discovered by brauer 1933 is discussed and several examples of stbcs derived from each of these constructions are presented

assessment of individual and population bioequivalence using the probability that bioavailabilities are similar in this paper a new method for the assessment of both individual and population bioequivalence is proposed that is derived from the approach of schall and luus 1993 statistics in medicine 12 1109 1124 the method considers the probability that the bioavailability of the test product is close to the bioavailability of the reference product against the probability that the bioavailability of the reference product is close to itself when administered on different occasions the method can accommodate unequal variances of the bioavailabilities of the test and reference formulations as well as formulation by subject interaction it is thus as general and comprehensive as the methods proposed by sheiner 1992 statistics in medicine 11 1777 1778 and schall and luus 1993 but the resulting bioequivalence criteria are simple and easy to interpret

geometrical structure of the neuronal network of caenorhabditis elegans the neuronal network of the soil nematode caenorhabditis elegans c elegans which is a good prototype for biological studies is investigated here the neuronal network is simpli4ed as a graph we use three indicators to characterize the graph vertex degree generalized eccentricity ge and complete subgraphs the graph has the central part and the strong clustering structure we present a simple model which shows that the neuronal network has a high dimensional geometrical structure c

unitary space time modulation for multiple antenna communications in rayleigh flat fading motivated by information theoretic considerations we propose a signaling scheme unitary space time modulation for multiple antenna communication links this modulation is ideally suited for rayleigh fast fading environments since it does not require the receiver to know or learn the propagation coefficients unitary space time modulation uses constellations of t spl times m space time signals spl phi sub i l 1 l where t represents the coherence interval during which the fading is approximately constant and m t is the number of transmitter antennas the columns of each spl phi sub i are orthonormal when the receiver does not know the propagation coefficients which between pairs of transmitter and receiver antennas are modeled as statistically independent this modulation performs very well either when the signal to noise ratio snr is high or when t spl gt m we design some multiple antenna signal constellations and simulate their effectiveness as measured by bit error probability with maximum likelihood decoding we demonstrate that two antennas have a 6 db diversity gain over one antenna at 15 db snr

sample size determination for proving equivalence based on the ratio of two means for normally distributed data equivalence trials aim to demonstrate that two treatments do not differ by more than a prespecified clinically irrelevant amount we consider the problem when equivalence is defined in terms of the ratio of population means and the original untransformed data are normally distributed application of the intersection union principle to the test proposed by sasabuchi results in a two one sided tests procedure of size we give the associated 100 1 2 per cent confidence interval and derive the exact methods for calculation of power and sample sizes for the parallel group design and the two period cross over we present tables and figures of required sample sizes and achieved power copyright 1999 john wiley sons ltd

systematic design of unitary space time constellations we propose a systematic method for creating constellations of unitary space time signals for multiple antenna communication links unitary space time signals which are orthonormal in time across the antennas have been shown to be well tailored to a rayleigh fading channel where neither the transmitter nor the receiver knows the fading coefficients the signals can achieve low probability of error by exploiting multiple antenna diversity because the fading coefficients are not known the criterion for creating and evaluating the constellation is nonstandard and differs markedly from the familiar maximum euclidean distance norm our construction begins with the first signal in the constellation an oblong complex valued matrix whose columns are orthonormal and systematically produces the remaining signals by successively rotating this signal in a high dimensional complex space this construction easily produces large constellations of high dimensional signals we demonstrate its efficacy through examples involving one two and three transmitter antennas

structured unitary space time autocoding constellations we previously showed that arbitrarily reliable communication is possible within a single coherence interval in rayleigh flat fading as the symbol duration of the coherence interval and the number of transmit antennas grow simultaneously this effect where the space time signals act as their own channel codes is called autocoding for relatively short e g 16 symbol coherence intervals a codebook of independent isotropically random unitary space time signals theoretically supports transmission rates that are a significant fraction of autocapacity with an extremely low probability of error the exploitation of space time autocoding requires the creation and decoding of extraordinarily large constellations typically l 2 sup 80 we make progress on the first part of the problem through a random but highly structured constellation that is completely specified by log sub 2 l independent isotropically distributed unitary matrices the distinguishing property of this construction is that any two signals in the constellation are pairwise statistically independent and isotropically distributed thus the pairwise probability of error and hence the union bound on the block probability of error of the structured constellation is identical to that of a fully random constellation of independent signals we establish the limitations of an earlier construction through a subsidiary result that is interesting in its own right the square or for that matter any integer power greater than one of an isotropically random unitary matrix is not isotropically random with the sole exception of the one by one unitary matrix

the subject by formulation interaction as a criterion of interchangeability of drugs summary the primary purpose of a bioequivalence study is often to meet the regulatory requirement of similar average bioavailabilities this is usually done by estimating the mean difference between formulations in a crossover design however a small difference as well as a rather narrow confidence interval might be obtained also if the subjects respond differently to the formulations i e if there is a nonnegligible subject by formulation interaction hence it can be argued that this interaction should be part of the criterion of interchangeability to be able to study this interaction the ordinary simple crossover design is not appropriate instead a design where each formulation is administered at least twice to each subject is desirable such a design is obtained by repeating a simple crossover layout to evaluate the impact of the subject by formulation interaction the ratio of the variance components of the interaction and the error is estimated this approach is illustrated by an example two different formulations of a drug are considered bioequivalent if their average bioavailabilities are similar the assessment of this similarity is usually based on an interval estimate of the mean difference between the formulations however this focus on means is an insufficient criterion since a small difference as well as a rather narrow confidence interval might be obtained also if the formulation differences show a considerable variation among subjects the impact on drug interchangeability of this so called subject byformulation interaction is discussed for example by hwang et al 1978 in order to estimate this interaction they suggest a design where each formulation is administered at least twice to each subject in this paper we briefly discuss how to design and analyze a bioequivalence study in order to evaluate the impact of the subject by formulation interaction as a measure of the magnitude of the interaction we propose the ratio of the variance components of the interaction and the error the ideas of the paper are illustrated with data from a comparative study of two generic formulations of furosemide

on the design of layered space time systems for autocoding hochwald et al see ieee trans inform theory nov 2001 have recognized that arbitrarily reliable communication is possible in multiantenna systems with coding over only a single coherence interval in particular they showed that reliable communication is possible for all rates r spl les c sub a with code words that extend over a single coherence interval when the number of transmit antennas and coherence interval n t spl rarr spl infin they coined the names autocoding for this phenomenon and autocapacity for c sub a they also proposed a signalling scheme based on random unitary matrices that achieves a significant fraction of this capacity the main limitation however is that currently no decoder of reasonable complexity is known for this signalling scheme we investigate the application of space time layering to autocoding we show that properly constructed layered systems can achieve the autocapacity with a reasonable complexity receiver composed of minimum mean square error mmse decision feedback multiuser detectors and single user decoders in addition to this asymptotic result we propose a specific layering approach the threaded space time layering that combines generalized bit interleaved space time coded modulation iterative signal processing and pilot symbol assisted channel estimation we show that this approach is well suited for practical systems with limited numbers of transmit antennas and small coherence intervals finally we report simulation results that demonstrate the ability of the threaded approach to achieve significant fractions of the autocapacity with a realizable receiver the simulation results also indicate significant performance gains over the cayley differential space time signalling scheme in certain scenarios

network formed by traces of random walks abstract we propose a model of time evolving networks in which a kind of transport between vertices generates new edges in the graph we call the model network formed by traces of random walks because the transports are represented abstractly by random walks our numerical calculations yield several important properties observed commonly in complex networks although the graph at initial time is only a one dimensional lattice for example the distribution of vertex degree exhibits various behaviors such as exponential power law like and bi modal distribution according to change of probability of extinction of edges another property such as strong clustering structure and small mean vertex vertex distance can also be found the transports represented by random walks in a framework of strong links between regular lattice is a new mechanisms which yields biased acquisition of links for vertices

the validity of the test of individual equivalence ratios summary we evaluate the validity of the test of individual equivalence ratios tier a term coined by anderson hauck 1990 the test was also proposed in wellek 1989 it is proved to be a valid test under a class of unimodal symmetric distributions this includes normal distributions since most bioequivalence studies involve data which are normal or at least unimodal and symmetric the test is typically valid it is however not always valid as shown by counter examples

eigenvalue distributions of random unitary matrices let u be an n n random matrix chosen from haar measure on the unitary group for a fixed arc of the unit circle let x be the number of eigenvalues of m which lie in the specified arc we study this random variable as the dimension n grows using the connection between toeplitz matrices and random unitary matrices and show that x e x var x 1 2 is asymptotically normally distributed in addition we show that for several fixed arcs i1 im the corresponding random variables are jointly normal in the large n limit

high powers of random elements of compact lie groups if a random unitary matrix u is raised to a sufficiently high power its eigenvalues are exactly distributed as independent uniform phases we prove this result and apply it to give exact asymptotics of the variance of the number of eigenvalues of u falling in a given arc as the dimension of u tends to infinity the independence result it turns out extends to arbitrary representations of arbitrary compact lie groups we state and prove this more general theorem paying special attention to the compact classical groups and to wreath products this paper is excerpted from the author s doctoral thesis 9

associative recall in non randomly diluted neuronal networks abstract the potential for associative recall of diluted neuronal networks is investigated with respect to several biologically relevant configurations more specifically the position of the cells along the input space and the spatial distribution of their connections first we put the asymmetric hopfield model onto a scale free barabasi albert network then a geometrical diluted architecture which maps from l bit input patterns into n neurons networks with r n l r 0 1 0 2 and 0 3 is considered the distribution of the connections between cells along the one dimensional input space follows a normal distribution centered at each cell in the sense that cells that are closer to each other have increased probability to interconnect the models also explicitly consider the placement of the neuronal cells along the input space in such a way that denser regions of that space tend to become denser therefore implementing a special case of the barabasi albert connecting scheme the obtained results indicate that for the case of the considered stimuli and noise the network performance increases with the spatial uniformity of cell distribution

space time autocoding prior treatments of space time communications in rayleigh flat fading generally assume that channel coding covers either one fading interval in which case there is a nonzero outage capacity or multiple fading intervals in which case there is a nonzero shannon capacity however we establish conditions under which channel codes span only one fading interval and yet are arbitrarily reliable in short space time signals are their own channel codes we call this phenomenon space time autocoding and the accompanying capacity the space time autocapacity let an m transmitter antenna n receiver antenna rayleigh flat fading channel be characterized by an m spl times n matrix of independent propagation coefficients distributed as zero mean unit variance complex gaussian random variables this propagation matrix is unknown to the transmitter it remains constant during a t symbol coherence interval and there is a fixed total transmit power let the coherence interval and number of transmitter antennas be related as t spl beta m for some constant spl beta a t spl times m matrix valued signal associated with r spl middot t bits of information for some rate r is transmitted during the t symbol coherence interval then there is a positive space time autocapacity c sub a such that for all r c sub a the block probability of error goes to zero as the pair t m spl rarr spl infin such that t m spl beta the autocoding effect occurs whether or not the propagation matrix is known to the receiver and c sub a nlog 1 spl rho in either case independently of spl beta where spl rho is the expected signal to noise ratio snr at each receiver antenna lower bounds on the cutoff rate derived from random unitary space time signals suggest that the autocoding effect manifests itself for relatively small values of t and m for example within a single coherence interval of duration t 16 for m 7 transmitter antennas and n 4 receiver antennas and an 18 db expected snr a total of 80 bits corresponding to rate r 5 can theoretically be transmitted with a block probability of error less than 10 sup 9 all without any training or knowledge of the propagation matrix

unitary space time constellation design based on the chernoff bound of the pairwise error probability unitary space time constellation design is considered for noncoherent multiple antenna communications where neither the transmitter nor the receiver knows the fading coefficients of the channel by employing the clarke s subdifferential theorem of the sum of the kappa largest singular values of a unitary matrix we present a numerical optimization procedure for finding unitary space time signal constellations of any dimension the chernoff bound of the pairwise error probability is used directly as a design criterion the constellations are found by performing gradient descent search on a family ldquosurrogaterdquo functions that converge to the maximum pairwise error probability the complexity of the search procedure increases with the dimension and the size of the constellation but it can be considered to be acceptable for an off line design procedure since the designed constellations are unstructured and thus require an exhaustive search over all codewords in decoding their main practical value is to serve as constellation design performance benchmarks we compare the performance of the new constellations to that of some other well known constellations computer simulation results illustrate typically about 0 4 3 5 db performance gains

kullback leibler divergence for evaluating bioequivalence in this paper we propose a methodology for evaluating the bioequivalence of two formulations of a drug that encompasses not only average bioequivalence abe but also the more recently introduced measures of population bioequivalence pbe and individual bioequivalence ibe the latter two measures are concerned with prescribability pbe and switchability ibe the main idea is to use the kullback leibler divergence kld as a measure of discrepancy between the distributions of the two formulations two formulations are declared bioequivalent if the upper bound of a level confidence interval for the kld is less than a given goalpost to be set by a regulator this new methodology overcomes many of the disadvantages of the corresponding measures recommended by the fda in particular the kld i possesses the natural hierarchical property that ibe pbe abe ii satisfies the properties of a true distance metric iii is invariant to monotonic transformations of the data iv generalizes easily to the multivariate case where equivalence on more than one parameter for example auc cmax and tmax is required and v is applicable over a wide range of distributions of the response variable for example those in the exponential family the performance of the kld relative to the metric proposed in guidance by the fda for the evaluation of individual bioequivalence is evaluated using a simulation study previously published retrospective analyses using the fda proposed metric are contrasted with those based on the kld it is concluded that the kld is a viable alternative to the fda proposed metric and that its mathematical and statistical properties make it a readily interpretable measure of the differences between formulations copyright 2003 john wiley sons ltd

on the potential of the excluded volume and autocorrelation as neuromorphometric descriptors abstract this work investigates at what degree two neuromorphometric measurements namely the autocorrelation and the excluded volume of a neuronal cell can influence the characterization and classification of such type of cells while the autocorrelation function presents good potential for quantifying the dendrite dendrite connectivity of cells in mosaic tilings the excluded volume i e the amount of the surround space which is geometrically not accessible to an axon or dendrite provides a complementary characterization of the cell connectivity the potential of such approaches is illustrated with respect to real neuronal cells

leveraging coherent space time codes for noncoherent communication via training training codes are introduced for the multiple antenna noncoherent multiple block rayleigh fading channel in which the fading coefficients which are constant over a fixed number of dimensions coherence interval for each block and then change independently to a new realization are known neither at the transmitter nor at the receiver each codeword of a training code consists of a part known to the receiver used to form a minimum mean squared error mmse estimate of the channel and a part that contains codeword s of a space time block or trellis code designed for the coherent channel in which the receiver has perfect knowledge of the channel the channel estimate is used as if it were error free for decoding the information bearing part of the training codeword training codes are hence easily designed to have high rate and low decoding complexity by choosing the underlying coherent code to have high rate and to be efficiently decodable conditions for which the estimator detector e d receiver is equivalent to the optimal noncoherent receiver are established a key performance analysis result of this paper is that the training codes when decoded with the e d receiver achieve a diversity order of the error probability that is equal to the diversity order of the underlying coherent code in some cases the performance of training codes can be measured relative to coherent reception via training efficiency which is then optimized over the energy allocation between the training and data phases in the limit of increasing block lengths training codes always achieve the performance of coherent reception the examples of training codes provided in this work have polynomial complexity in rate but an error rate comparable to the best performing unitary designs available even though the latter require exponential decoding complexity

further results on noncoherent block coded mpsk transactions papers a novel noncoherent block coding scheme called noncoherent block coded mpsk nbc mpsk was proposed recently in this paper we present further research results on nbc mpsk we first focus on the rotational invariance ri of nbc mpsk based on the ri property of nbc mpsk with multistage decoding a noncoherent near optimal linear complexity multistage decoder for nbc mpsk is proposed then we investigate a tree search ml decoding algorithm for nbcmpsk the derived algorithm is shown to have low complexity and excellent error performance in this paper we also utilize the idea of the nbc mpsk to design noncoherent space time block codes called noncoherent space time block coded mpsk nstbc mpsk for two transmit antennas we propose a signal set with set partitioning and derive the minimum noncohent distance of nstbc mpsk with this signal set for the decoding of nstbc mpsk we modify the ml decoding algorithm of nbc mpsk and propose an iterative hard decision decoding algorithm compared with training codes and unitary space time modulation nbc mpsk and nstbc mpsk have larger minimum noncoherent distance and thus better error performance for the noncoherent ml decoder

energy efficient full diversity collaborative unitary space time block code designs via unique factorization of signals in this paper a novel concept called a uniquely factorable constellation pair ufcp is proposed for the systematic design of a noncoherent full diversity collaborative unitary space time block code by normalizing two alamouti codes for a wireless communication system having two transmitter antennas and a single receiver antenna it is proved that such a unitary ufcp code assures the unique identification of both channel coefficients and transmitted signals in a noise free case as well as full diversity for the noncoherent maximum likelihood receiver in a noise case to further improve error performance an optimal unitary ufcp code is designed by appropriately and uniquely factorizing a pair of energy efficient cross quadrature amplitude modulation qam constellations to maximize the coding gain subject to a transmission bit rate constraint after a deep investigation of the fractional coding gain function a technical approach developed in this paper to maximizing the coding gain is to carefully design an energy scale to compress the first three largest energy points in the corner of the qam constellations in the denominator of the objective as well as carefully design a constellation triple forming two ufcps with one collaborating with the other two so as to make the accumulated minimum euclidean distance along the two transmitter antennas in the numerator of the objective as large as possible and at the same time to avoid as many corner points of the qam constellations with the largest energy as possible to achieve the minimum of the numerator in other words the optimal coding gain is attained by intelligent constellations collaboration and efficient energy compression computer simulations demonstrate that error performance of the optimal unitary ufcp code presented in this paper outperforms those of the differential code and the signal to noise ratio efficient training code

consistency of the bootstrap procedure in individual bioequivalence recently new concepts have been proposed for assessing bioequivalence of two drug formulations namely the so called population and individual bioequivalence using moment based and probability based measures for evaluating the proposed bioequivalence concepts criteria have been formulated to decide whether two formulations should be regarded as bioequivalent or not this decision has of course to be based on an adequate statistical method where the food and drug administration fda guidance 1997 recommends the use of a bootstrap percentile interval in this paper we discuss theoretical properties such as consistency and accuracy of the recommended bootstrap intervals we focus our investigations on the concept of individual bioequivalence and here especially on the scaled versions of the moment based as well as the probability based measures as recommended by the fda as estimates for the former we consider those obtained from an according analysis of variance and restricted maximum likelihood estimators under mixed effect models where an unbiased estimator of the latter can be derived from the corresponding relative frequencies

unitary space time modulation via cayley transform a prevoiusly proposed method for communicating with multiple antennas over block fading channels is unitary space time modulation ustm in this method the signals transmitted from the antennas viewed as a matrix with spatial and temporal dimensions form a unitary matrix i e one with orthonormal columns since channel knowledge is not required at the receiver ustm schemes are suitable for use on wireless links where channel tracking is undesirable or infeasible either because of rapid changes in the channel characteristics or because of limited system resources previous results have shown that if suitably designed ustm schemes can achieve full channel capacity at high snr and moreover that all this can be done over a single coherence interval provided the coherence interval and number of transmit antennas are sufficiently large which is a phenomenon referred to as autocoding while all this is well recognized what is not clear is how to generate good performing constellations of nonsquare unitary matrices that lend themselves to efficient encoding decoding the schemes proposed so far either exhibit poor performance especially at high rates or have no efficient decoding algorithms we propose to use the cayley transform to design ustm constellations this work can be viewed as a generalization to the nonsquare case of the cayley codes that have been proposed for differential ustm the codes are designed based on an information theoretic criterion and lend themselves to polynomial time often cubic near maximum likelihood decoding using a sphere decoding algorithm simulations suggest that the resulting codes allow for effective high rate data transmission in multiantenna communication systems without knowing the channel however our preliminary results do not show a substantial advantage over training based schemes

a new family of unitary space time codes with a fast parallel sphere decoder algorithm in this paper we propose a new design criterion and a new class of unitary signal constellations for differential space time modulation for multiple antenna systems over rayleigh flat fading channels with unknown fading coefficients extensive simulations show that the new codes have significantly better performance than existing codes we have compared the performance of our codes with differential detection schemes using orthogonal design cayley differential codes fixed point free group codes and product of groups and for the same bit error rate our codes allow smaller signal to noise ratio snr by as much as 10 db the design of the new codes is accomplished in a systematic way through the optimization of a performance index that closely describes the bit error rate as a function of the snr the new performance index is computationally simple and we have derived analytical expressions for its gradient with respect to constellation parameters decoding of the proposed constellations is reduced to a set of one dimensional closest point problems that we solve using parallel sphere decoder algorithms this decoding strategy can also improve efficiency of existing codes

moments of traces of circular beta ensembles let 1 n be random variables from dyson s circular ensemble with probability density function constq 1 j kn je i j e i k

scale free characteristics of random networks the topology of the world wide web the world wide web forms a large directed graph whose vertices are documents and edges are links pointing from one document to another here we demonstrate that despite its apparent random character the topology of this graph has a number of universal scale free characteristics we introduce a model that leads to a scale free network capturing in a minimal fashion the self organization processes governing the world wide web c 2000 elsevier science b v all rights reserved pacs 84 35 i 64 60 fr 87 23 ge

full diversity blind space time block codes in this paper the systematic design of a space time block code is considered for a wireless communication system with multiple transmitter receiver antennas and flat fading in which channel state information is completely unknown from the viewpoint of blind signal processing a necessary and sufficient condition is given for the unique identification of the multi input multi output flat fading channel and transmitted signal then some novel unique factorizations for a pair of coprime p ary and q ary phase shift keying psk constellations are established with this and currently available coherent space time block code designs a method is developed to systematically construct full diversity blind nonunitary space time block codes as well as unitary codes by just performing the qr decomposition of the nonunitary codes it is proved that under a noise free environment the code design proposed in this paper can guarantee that the transmitted signals and the channel coefficients are uniquely identified and that under a complex gaussian noise environment in which pth order and q th order statistics p and q are co prime of the received signals are available the channel coefficients can be still uniquely identified in addition a closed form solution to determine the channel coefficients is obtained