Trellis phase codes for power-bandwith efficient satellite communications

Support work on improved power and spectrum utilization on digital satellite channels was performed. Specific attention is given to the class of signalling schemes known as continuous phase modulation (CPM). The specific work described in this report addresses: analytical bounds on error probability for multi-h phase codes, power and bandwidth characterization of 4-ary multi-h codes, and initial results of channel simulation to assess the impact of band limiting filters and nonlinear amplifiers on CPM performance

Sign-Compute-Resolve for Tree Splitting Random Access

We present a framework for random access that is based on three elements: physical-layer network coding (PLNC), signature codes and tree splitting. In presence of a collision, physical-layer network coding enables the receiver to decode, i.e. compute, the sum of the packets that were transmitted by the individual users. For each user, the packet consists of the user's signature, as well as the data that the user wants to communicate. As long as no more than K users collide, their identities can be recovered from the sum of their signatures. This framework for creating and transmitting packets can be used as a fundamental building block in random access algorithms, since it helps to deal efficiently with the uncertainty of the set of contending terminals. In this paper we show how to apply the framework in conjunction with a tree-splitting algorithm, which is required to deal with the case that more than K users collide. We demonstrate that our approach achieves throughput that tends to 1 rapidly as K increases. We also present results on net data-rate of the system, showing the impact of the overheads of the constituent elements of the proposed protocol. We compare the performance of our scheme with an upper bound that is obtained under the assumption that the active users are a priori known. Also, we consider an upper bound on the net data-rate for any PLNC based strategy in which one linear equation per slot is decoded. We show that already at modest packet lengths, the net data-rate of our scheme becomes close to the second upper bound, i.e. the overhead of the contention resolution algorithm and the signature codes vanishes.Comment: This is an extended version of arXiv:1409.6902. Accepted for publication in the IEEE Transactions on Information Theor

An improved algorithm for evaluating trellis phase codes

A method is described for evaluating the minimum distance parameters of trellis phase codes, including CPFSK, partial response FM, and more importantly, coded CPM (continuous phase modulation) schemes. The algorithm provides dramatically faster execution times and lesser memory requirements than previous algorithms. Results of sample calculations and timing comparisons are included

Telemetering and telecommunications research

The research center activities during the reporting period have been focused in three areas: (1) developing the necessary equipment and test procedures to support the testing of 8PSK-TCM through TDRSS from the WSGT; (2) extending the theoretical decoder work to higher speeds with a design goal of 600MBPS at 2 bits/Hz; and (3) completing the initial phase of the CPFSK Multi-H research and determining what subsets (if any) of these coding schemes are useful in the TDRSS environment. The equipment for the WSGT TCM testing has been completed and is functioning in the lab at NMSU. Measured results to date indicate that the uncoded system with the modified HRD and NMSU symbol sync operates at 1 to 1.5 dB from theory when processing encoded 8PSK. The NMSU pragmatic decoder when combined with these units produces approximately 2.9 dB of coding gain at 10(exp -5) BER. Our study of CPFSK with Multi-H coding has reached a critical stage. The principal conclusions reached in this activity are: (1) no scheme using Multi-H alone investigated by us or found in the literature produces power/bandwidth trades that are as good as TCM with filtered 8PSK; (2) when Multi-H is combined with convolutional coding, one can obtain better coding gain than with Multi-H alone but still no better power/bandwidth performance than TCM and these gains are available only with complex receivers; (3) the only advantage we can find for the CPFSK schemes over filtered MPSK with TCM is that they are constant envelope (however, constant envelope is of no benefit in a multiple access channel and of questionable benefit in a single access channel since driving the TWT to saturation in this situation is generally acceptable); and (4) based upon these results the center's research program will focus on concluding the existing CPFSK studies

A deterministic algorithm that achieves the PMEPR of c log n for multicarrier signals

Multicarrier signals often exhibit large peak to mean envelope power ratios (PMEPR) which can be problematic in practice. In this paper, we study adjusting the sign of each subcarrier in order to reduce the PMEPR of a multicarrier signal with n subcarriers. Considering that any randomly chosen codeword has PMEPR of log n with probability one and for large values of n [1], randomly choosing signs should lead to the PMEPR of log n in the probability sense. Based on the derandomization algorithm suggested in [2], we propose a deterministic and efficient algorithm to design signs such that the PMEPR of the resulting codeword is less than c log n for any n where c is a constant independent of n. By using a symmetric q-ary constellation, this algorithm in fact constructs a code with rate 1 - logq 2, PMEPR of c log n, and with simple encoding and decoding. We then present simulation results for our algorithm