Download now Free registration required
Given n independent but not necessarily identical random processes, this paper investigates the general problem of determining how frequently, on average, any given process becomes at least the largest among all processes. This problem requires determining the Level Crossing Rate (LCR) of a carefully defined ordered process, which the authors solve by developing a general mathematical framework based on the theory of permanents. Their results are very general and may be applicable for a wide range of engineering applications which involve ordered random processes.
- Format: PDF
- Size: 163.7 KB