Optimum arrival-time distribution for delay capture inspread-spectrum packet radio networks

The optimum arrival-time distribution that maximizes the delay-capture probability in spread-spectrum packet radio networks is derived. It is shown that when the optimum arrival-time distribution is employed, the capture probability converges to a finite value as the number of contending packets increases. Normalized throughput and average number of packet retransmissions are computed for slotted ALOHA multipoint-to-point packet radio networks employing direct-sequence spread-spectrum modulation. It is shown that large performance improvement is obtained by optimizing the arrival-time distribution compared to the uniform arrival-time distribution assumed by Davis and Gronemeyer (1980), especially when error-correction coding is employed. Two practical modifications are derived which are shown to provide performance close to the optimum along with an adaptive network load control scheme     

A novel U-turn counting hangup detection algorithm for SDPSKmodulation

A new hangup detection algorithm for symmetric differential phase-shift keying (SDPSK) modulation is proposed. Hangup is detected by observing phase transition patterns in the received SDPSK signal trajectory. The average pull-in times with and without the proposed hangup detector are compared. Simulation results show that the proposed algorithm significantly reduces the average pull-in time when the initial timing error is near the unstable null. We also show that the proposed algorithm is very robust against carrier frequency offsets     

Antijamming performance of a multicarrier direct-sequencespread-spectrum system

Uncoded antijamming capability of the multicarrier direct-sequence spread-spectrum system proposed by Kondo and Milstein (see ibid. vol.44, p.238-46, 1996 ) is analyzed. Joint pulse/partial-band noise jamming is considered with various subcarrier demodulator output combining schemes. We find that full-band pulse jamming maximizes the error probability for all cases considered. With Rayleigh fading and maximal-ratio combining, the multicarrier system achieves performance very close to that of the single-carrier system without fading even with a very small number of subcarriers     

The Study on Effect of Exhaust Performance According to Active Muffler Valve Spring as Followed Spring Constant

This study represents the influence on exhaust performance by active muffler valve spring. The main experimental parameters were engine speeds and torsion coil spring constants in the active muffler. When the muffler valve spring has a low spring constant of k = 0.75, the sound pressure level was low at the region of engine speed 2000 to 2500 r/min, and the velocity of exhaust gas was high at spring constant k = 0.75. When the engine speed was under 1500 r/min, the mean concentration of CO was high in case without muffler valve. When the engine speed in the range of 1600 to 2600 r/min with spring constant k = 0.75, the mean HC concentration showed the lowest value. Without muffler valve, the temperature in the muffler was higher than the case with muffler valve. This research represented that the performance of the active muffler valve spring constant k = 0.75 was higher than that without muffler valve and valve spring constant k = 0.70. Among the three cases of experimental condition, with a spring con     

Adaptive PN code acquisition using instantaneous power-scaled detection threshold under Rayleigh fading and pulsed Gaussian noise jamming

An adaptive serial search pseudonoise (PN) code acquisition scheme is proposed, in which the detection threshold is scaled by the instantaneous received power measured prior to PN code correlation. We observe that the proposed scheme achieves significantly improved mean acquisition times compared to the conventional nonadaptive schemes under Rayleigh fading and pulsed Gaussian noise jamming. Furthermore, the proposed scheme is shown to be optimum under pulsed Gaussian noise jamming in the sense that it forces the worst case jamming fraction to unity.     

Iterative decoding and channel parameter estimation algorithms for repeat-accumulate codes

The sensitivity of the iterative decoder for repeat-accumulate (RA) codes to carrier phase and channel signal-to-noise ratio estimation errors is investigated, and efficient algorithms to estimate and correct these errors are developed. The behavior of RA codes with imperfect channel estimation is different from that of turbo codes, and correction algorithms specific to RA codes must be formulated. The proposed algorithms use the soft information generated within the iterative decoder, and thus, are not only hardware-efficient, but also offer excellent performance.     

Probability of error in frequency-hop spread-spectrummultiple-access communication systems with noncoherent reception

Expressions are developed for the probability of error for asynchronous frequency-hop spread-spectrum multiple-access networks using Markov hopping patterns and binary frequency shift keying (BFSK) with one symbol transmitted per hop. The expressions are exact when there is one interfering user and orthogonal BFSK is used. They provide excellent approximations when there are more than one interfering user. It is also shown that the error probability when Markov hopping patterns are used is a good approximation to the error probability when memoryless hopping patterns are used. By computing the channel capacity and the associated throughput, a simple hard decision receiver is shown to perform much better than a receiver using perfect side-information to erase the symbols transmitted on hops that were hit when all the users have the same power and one binary symbol is transmitted per hop     

Improving the performance of turbo codes with a simple protection scheme for error-prone bit positions

It is well known that turbo codes provide highly unequal error protection within a transmitted frame. Previous attempts to exploit this fact focused mainly on adding additional redundancy to provide extra protection for the error-prone bit positions. Here, instead, we use the error-detection capability of the cyclic redundancy check (CRC), which is almost always employed in practical systems. Once a frame is declared uncorrectable by the CRC, a process termed the error-prone bit processing procedure is activated in an attempt to correct the probable error patterns which are a priori identified as being error-prone.