Search

Algorithmic composition is often limited to score generation, but may also include sound production. All levels from sound synthesis to the generation of a complete composition can be integrated into one monolithic program. A strict separation of the low level of sound synthesis and higher levels otherwise reserved for algorithmic composition is not necessary, information can flow between all levels. An interesting challenge in this kind of thorough algorithmic composition is to generate as complex music as possible with as little code as possible. The challenge has been accepted, successfully or not, in a series of compositions called Kolmogorov Variations. We discuss the techniques used in a few of the pieces as well as the promises and perils of this strict approach to algorithmic composition.

This work analyzes the most common wireless cooperative network protocols, verifying potentialities and performance relative to the non cooperative methodology, also techniques that can maximize the performance, such as combining signal rules and relay selection. Furthermore, considerations are provided for the computational complexity of topologies, combining techniques and protocols of cooperative networks.

This work investigates issues concerning the computational complexity of multiuser receivers in direct sequence code division multiple access (DS/CDMA) systems based on heuristic techniques and implemented on commercial platform for digital signal processing (DSP) (Texas TMS320C6713). The multiuser detection algorithms which were implemented in baseband are based on the heuristic local search (LS) and simulated annealing (SA) approaches. Figures of merit regarding to the computational complexity increasing, due to the system loading increment (number of active users) are discussed, and a brief methodology for the design/implementation of the baseband receiver using DSP platform is presented as well.