Sökning: "minimum Euclidean distance"
Visar resultat 1 - 5 av 8 avhandlingar innehållade orden minimum Euclidean distance.
1. On Spectrally Efficient Continuous Phase Modulation
Sammanfattning : Spectrally efficient partial response continuous phase modulation (CPM)for wireless links is considered. Continuous phase modulation defines constantenvelope phase codes, which are advantageous when using non-linear amplifiers. LÄS MER
2. Bounds on the Performance of PSK Block Codes
Sammanfattning : In wireless communication, the minimum Euclidean distance between codewords is a major factor for the ability to correct errors in messages, and it is of interest to maximize the minimum Euclidean distance. The thesis improves previously established general upper bounds on minimum Euclidean distance of phase shift keying block codes. LÄS MER
3. Superimposed codes for additive channels
Sammanfattning : We consider a situation where several users send information over a single additive channel. We suppose the transmission is synchronized and that at most m of the total number of potential T users transmit simultaneously. The receiver gets a message which is the sum of the messages of the active users at that moment. LÄS MER
4. Combinatorial Optimization : Three Applications
Sammanfattning : Combinatorial optimization is a diverse area of mathematics. It concerns optimization on feasible regions defined by discrete sets, graphs, hypergraphs, matroids, etc. . . LÄS MER
5. Partial Response and Faster-than-Nyquist Signaling
Sammanfattning : Bandwidth efficiency is a key objective in the design of a digital communication system. Traditionally it is accomplished by increasing the constellation size of the signaling system. In this thesis alternative techniques are studied. Because the communication channel is continuous, so must the actual time signals be. LÄS MER