Leveraging coherent distributed space-time codes for noncoherent communication in relay networks via training

For point to point multiple input multiple output systems, Dayal-Brehler-Varanasi have proved that training codes achieve the same diversity order as that of the underlying coherent space time block code (STBC) if a simple minimum mean squared error estimate of the channel formed using the training part is employed for coherent detection of the underlying STBC. In this letter, a similar strategy involving a combination of training, channel estimation and detection in conjunction with existing coherent distributed STBCs is proposed for noncoherent communication in Amplify-and-Forward (AF) relay networks. Simulation results show that the proposed simple strategy outperforms distributed differential space-time coding for AF relay networks. Finally, the proposed strategy is extended to asynchronous relay networks using orthogonal frequency division multiplexing.

Diversity: Cultural and biological

Early human populations utilized a wide range of biological resources in a tremendous diversity of environments. As a result, they possessed high levels of cultural diversity dependent on and supportive of high levels of biological diversity. This pattern changed drastically with technological innovations enabling certain human groups to break down territorial barriers and to usurp resources of other groups. The dominant groups have gone on to exhaust a whole range of resources, depleting both biological and cultural diversity. Traditions of resource conservation can, however, re-emerge when the dominant cultures spread over the entire area and the innovations diffuse to other human groups. This could change once again as genetically engineered organisms become an economically viable proposition with the accruing advantages concentrated in the hands of a few human groups: a further drastic reduction in biological and cultural diversity may ensue.

Cultural-Evolution of Ecological Prudence

Animals often behave in a profligate fashion and decimate the populations of plants and animals they depend upon. They may, however, evolve prudent behaviour under special conditions, namely when such prudence greatly enhances the success of populations that are not too prone to invasions by profligate individuals. Cultural evolution in human societies can also lead to the adoption of prudent practices under similar conditions. These are more likely to be realized in stable environments in which the human populations tend to grow close to the carrying capacity, when the human groups are closed, and when the technology is stagnant. These conditions probably prevailed in the hunter—gatherer societies of the tropics and subtropics, and led to the adoption of a number of socially imposed restraints on the use of plant and animal resources. Such practices were rationalized in the form of Nature-worship. The Indian caste society became so organized as to fulfill these conditions, and gave rise to two religions, Buddhism and Jainism, which emphasize compassion towards all forms of life. The pastoral nomads of the middle east, on the other hand, lived in an environment which militated against prudence, and these societies gave rise to religions like Christianity, which declared war on nature. As the ruling elite and state have grown in power, they have tried to wrest control of natural resources from the local communities. This has sometimes resulted in conservation and prudent use under guidance from the state, but has often led to conflicts with local populations to the detriment of prudent behaviour. Modern technological progress has also often removed the need for conservation, as when availability of coal permitted the deforestation of England. While modern scientific understanding has led to a better appreciation of the need for prudence, the prevailing social and economic conditions often militate against any implementation of the understanding, as is seen from the history of whaling. However, the imperative for survival of the poor from the Third-World countries may finally bring about conditions in which ecological prudence may once again come to dominate human cultures as it might once have done with stable societies of hunter—gatherers.

Systematic Construction of Linear Transform Based Full-Diversity, Rate-One Space-Time Frequency Codes

In this paper, we generalize the existing rate-one space frequency (SF) and space-time frequency (STF) code constructions. The objective of this exercise is to provide a systematic design of full-diversity STF codes with high coding gain. Under this generalization, STF codes are formulated as linear transformations of data. Conditions on these linear transforms are then derived so that the resulting STF codes achieve full diversity and high coding gain with a moderate decoding complexity. Many of these conditions involve channel parameters like delay profile (DP) and temporal correlation. When these quantities are not available at the transmitter, design of codes that exploit full diversity on channels with arbitrary DIP and temporal correlation is considered. Complete characterization of a class of such robust codes is provided and their bit error rate (BER) performance is evaluated. On the other hand, when channel DIP and temporal correlation are available at the transmitter, linear transforms are optimized to maximize the coding gain of full-diversity STF codes. BER performance of such optimized codes is shown to be better than those of existing codes.

On the Conversion of Hensel Codes to Farey Rationals

Three different algorithms are described for the conversion of Hensel codes to Farey rationals. The first algorithm is based on the trial and error factorization of the weight of a Hensel code, inversion and range test. The second algorithm is deterministic and uses a pair of different p-adic systems for simultaneous computation; from the resulting weights of the two different Hensel codes of the same rational, two equivalence classes of rationals are generated using the respective primitive roots. The intersection of these two equivalence classes uniquely identifies the rational. Both the above algorithms are exponential (in time and/or space).

Space-Time Codes Achieving the DMD Tradeoff of the MIMO-ARQ Channel

For the quasi-static, Rayleigh-fading multiple-input multiple-output (MIMO) channel with n(t) transmit and n(r) receive antennas, Zheng and Tse showed that there exists a fundamental tradeoff between diversity and spatial-multiplexing gains, referred to as the diversity-multiplexing gain (D-MG) tradeoff. Subsequently, El Gamal, Caire, and Damen considered signaling across the same channel using an L-round automatic retransmission request (ARQ) protocol that assumes the presence of a noiseless feedback channel capable of conveying one bit of information per use of the feedback channel. They showed that given a fixed number L of ARQ rounds and no power control, there is a tradeoff between diversity and multiplexing gains, termed the diversity-multiplexing-delay (DMD) tradeoff. This tradeoff indicates that the diversity gain under the ARQ scheme for a particular information rate is considerably larger than that obtainable in the absence of feedback. In this paper, a set of sufficient conditions under which a space-time (ST) code will achieve the DMD tradeoff is presented. This is followed by two classes of explicit constructions of ST codes which meet these conditions. Constructions belonging to the first class achieve minimum delay and apply to a broad class of fading channels whenever n(r) >= n(t) and either L/n(t) or n(t)kslashL. The second class of constructions do not achieve minimum delay, but do achieve the DMD tradeoff of the fading channel for all statistical descriptions of the channel and for all values of the parameters n(r,) n(t,) L.

D-MG Tradeoff and Optimal Codes for a Class of AF and DF Cooperative Communication Protocols

Cooperative relay communication in a fading channel environment under the orthogonal amplify-and-forward (OAF), nonorthogonal and orthogonal selection decode-and-forward (NSDF and OSDF) protocols is considered here. The diversity-multiplexing gain tradeoff (DMT) of the three protocols is determined and DMT-optimal distributed space-time (ST) code constructions are provided. The codes constructed are sphere decodable and in some instances incur minimum possible delay. Included in our results is the perhaps surprising finding that the orthogonal and the nonorthogonal amplify-and-forward (NAF) protocols have identical DMT when the time durations of the broadcast and cooperative phases are optimally chosen to suit the respective protocol. Moreover our code construction for the OAF protocol incurs less delay. Two variants of the NSDF protocol are considered: fixed-NSDF and variable-NSDF protocol. In the variable-NSDF protocol, the fraction of time occupied by the broadcast phase is allowed to vary with multiplexing gain. The variable-NSDF protocol is shown to improve on the DMT of the best previously known static protocol when the number of relays is greater than two. Also included is a DMT optimal code construction for the NAF protocol.

Ternary Barker codes

Certain ternary codes having good autocorrelation properties akin to Barker codes are described.

Optical Barker codes

Certain binary codes having good autocorrelation properties akin to Barker codes are studied.

Systematic search for optical Barker codes with minimum length

A method that yields optical Barker codes of smallest known lengths for given discrimination is described.

Optical Barker codes

Certain binary codes having good autocorrelation properties akin to Barker codes are studied.

Equivalent rate 1/2 quasi-cyclic codes

Chen et al. [1] give a list of quasi-cyclic (2m,m) codes which have the largest minimum distance of any quasi-cyclic code, for various values ofm. We present the weight distribution of these codes. It will be seen that many of the codes found by Chen et al. [1] are equivalent in the sense of having identical weight distributions.

(v, k, λ) Configurations and self-dual codes

The incidence matrix of a (v, k, λ) configuration is used to construct a (2v, v) and a (2v + 2, v + 1) self-dual code. If the incidence matrix is a circulant, the codes obtained are quasi-cyclic and extended quasi-cyclic, respectively. The weight distributions of some codes of this type are obtained.

Optical Barker sequences and self-orthogonal convolutional codes

The relation between optical Barker codes and self-orthogonal convolutional codes is pointed out. It is then used to update the results in earlier publication.