this m File can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)
Notes:
1. Input error checking included
2. Inputs can be specified in any order, so long as the parameter pairs are specified as a parameter , value
This m-File simulates MPSK (theoretical and simulated) with Gray coding
This m-File simulates MPSK (BPSK,QPSK,8PSK)with theoretical and simulated results using Gray coding. Numerical examples of a satellite link design are shown using QPSK and/or 8PSK when the bit rate(Rb)is greater than the channel bandwidth Wc (Band-limited channel).
