7,886 research outputs found
ALOHA With Collision Resolution(ALOHA-CR): Theory and Software Defined Radio Implementation
A cross-layer scheme, namely ALOHA With Collision Resolution (ALOHA-CR), is
proposed for high throughput wireless communications in a cellular scenario.
Transmissions occur in a time-slotted ALOHA-type fashion but with an important
difference: simultaneous transmissions of two users can be successful. If more
than two users transmit in the same slot the collision cannot be resolved and
retransmission is required. If only one user transmits, the transmitted packet
is recovered with some probability, depending on the state of the channel. If
two users transmit the collision is resolved and the packets are recovered by
first over-sampling the collision signal and then exploiting independent
information about the two users that is contained in the signal polyphase
components. The ALOHA-CR throughput is derived under the infinite backlog
assumption and also under the assumption of finite backlog. The contention
probability is determined under these two assumptions in order to maximize the
network throughput and maintain stability. Queuing delay analysis for network
users is also conducted. The performance of ALOHA-CR is demonstrated on the
Wireless Open Access Research Platform (WARP) test-bed containing five software
defined radio nodes. Analysis and test-bed results indicate that ALOHA-CR leads
to significant increase in throughput and reduction of service delays
A study of high density bit transition requirements versus the effects on BCH error correcting coding
Several methods for increasing bit transition densities in a data stream are summarized, discussed in detail, and compared against constraints imposed by the 2 MHz data link of the space shuttle high rate multiplexer unit. These methods include use of alternate pulse code modulation waveforms, data stream modification by insertion, alternate bit inversion, differential encoding, error encoding, and use of bit scramblers. The psuedo-random cover sequence generator was chosen for application to the 2 MHz data link of the space shuttle high rate multiplexer unit. This method is fully analyzed and a design implementation proposed
Synchronization of pulse code modulation telemetry
Pulse Code Modulation (PCM) is one of the most widely utilized radio telemetry techniques for the recovery of test data from aerospace vehicles. Synchronization of the receiver with the transmitted data is perhaps the prime requisite of a PCM telemetry system. In this paper the frame synchronization process is analyzed by developing equations which define the three modes of synchronizer operation (SEARCH, VERIFY, and LOCK) in terms of the relative probabilities of operation. The criteria employed to optimize the synchronization process are the mean time to acquire true synchronization, the probability of true synchronization after verification of the synchronization decision, and the percentage of data last due to synchronization dropout (the dropout resulting from noise in the received signal). The results of this analysis are used to derive optimum synchronization system parameter settings for a hypothetical telemetry system. The problem of deriving an optimum PCM synchronization code is also presented. It is based on the criteria of minimum probability of false occurrence of the pattern in the received signal. Prior to discussing the frame synchronization problem, a general description of a typical airborne PCM telemetry system is made. Also, a brief description of bit synchronization and data regeneration techniques and their affect on the frame sync problem is included --Abstract, page ii
Fast antijamming timing acquisition using multilayer synchronization sequence
Pseudonoise (PN) sequences are widely used as preamble sequences to establish timing synchronization in military wireless communication systems. At the receiver, searching and detection techniques, such as the full parallel search (FPS) and the serial search (SS), are usually adopted to acquire correct timing position. However, the synchronization sequence has to be very long to combat jamming that reduces the signal-to-noise ratio (SNR) to an extremely low level. In this adverse scenario, the FPS scheme becomes too complex to implement, whereas the SS method suffers from the drawback of long mean acquisition time (MAT). In this paper, a fast timing acquisition method is proposed, using the multilayer synchronization sequence based on cyclical codes. Specifically, the transmitted preamble is the Kronecker product of Bose–Chaudhuri-Hocquenghem (BCH) codewords and PN sequences. At the receiver, the cyclical nature of BCH codes is exploited to test only a part of the entire sequence, resulting in shorter acquisition time. The algorithm is evaluated using the metrics of MAT and detection probability (DP). Theoretical expressions of MAT and DP are derived from the constant false-alarm rate (CFAR) criterion. Theoretical analysis and simulation results show that our proposed scheme dramatically reduces the acquisition time while achieving similar DP performance and maintaining a reasonably low real-time hardware implementation complexity, in comparison with the SS schem
- …