| The use of sequences is closely related to code signals, frequency and times for sonar sequences, and slot timing and frame timing for PPM ( Pulse Position Modulation) sequences. The problem for sonar and PPM sequences is given m (frequencies or flame timing), construct a sequence s = {lcub}s1, s2,…, Sn) where each Si ∈ {lcub}1, 2,…, m{rcub}, for n as large is possible. Various algebraic constructions of sonar sequences and PPM exist, however they do not determine the total number of possible sequences. An alternative to these algebraic methods is to implement computational algorithms; however this approach requires extensive computational time in some cases. This work intends to search sonar and PPM sequences, analyze their properties and symmetries, and then utilize algorithms designed for parallel computation utilizing MPI (Message Passing Interface). A brief analysis of the results and performance is conducted to obtain possible conclusions. |
