Optical WDM network is the suitable transport mechanism for ever increasing bandwidth intensive internet applications. The WDM technique transmits the data over several different wavelengths simultaneously through an opticalfiber and the switching is done at wavelength level. The connection between the source and destination is called the light path. Since the WDM network carries huge amount of tra c, any failure can cause massive data loss. Therefore protecting the network against failure is an important issue. Maintaining high level of service availability is an important aspect of service provider. To provide cost effective service, all-optical network is the suitable choice for the service provider. But in all optical network, the signals are forced to remain in optical domain from source to destination. In the firrst part of the thesis, we deal the physical layer impairments (PLIs) aware shared-path provisioning on a wavelength routed all-optical networks. As the signal travels longer distances, the quality of the signal gets degraded and the receiver may not be able to detect the optical signal properly. Our objective is to establish a light path for both the working path and protection path with acceptable signal quality at the receiver. We propose an impairment aware integer linear programming (ILP) and impairment aware heuristic algorithm that takes into account the PLIs. The ILP provides the optimal solution. It is solved using IBM ILOG CPLEX solver. It is intractable for large size net-work. Therefore we propose the heuristic algorithm for large size network. It is evaluated through discrete-event simulation. But the algorithm provides only the suboptimal solution. To know the performance of this algorithm, the simulation result is compared with the optimal solution. We compute total blocking probability, restoration delay, computation time, and connection setup delay with respect to network load for the heuristic algorithm. We compare the performance of shared-path protection with dedicated-path protection and evaluate the percentage of resource saving of shared-path protection over the dedicated-path protection. In the second and third part of the thesis, we address the issues related to flexible-grid optical networks. In wavelength routed optical network, the bandwidth of each wavelength is fixed and rigid. It supports coarse grained tra c grooming and leads to ancient spectrum utilization. To overcome this, flexible-grid optical networks are proposed. It supports flexible bandwidth, and ne grained tra c groom In the second part of the thesis, we address the routing and spectrum allocation (RSA) algorithm for variable-bit-rate data tra c for flexible-grid optical networks. The RSA problem is NP-complete. Therefore a two-step heuristic approach (routing and spectrum allocation) is proposed to solve the RSA problem. The first step is solved by using a classical shortest path algorithm. For the second step we propose two heuristic schemes for frequency-slot allocation: (i) largest number of free frequency-slot allocation scheme and (ii) largest number of free frequency-slot maintaining scheme. As the network load increases, the spectrum is highly fragmented. To mitigate the fragmentation of the spectrum, we propose a xed-path least-fragmentation heuristic algorithm which fragments the spectrum minimally. It also supports varying-bit-rate tra c and also supports dynamic arrival connection requests. Through extensive simulations the proposed algorithms have been evaluated. Our simulation results show that the algorithms perform better in terms of spectrum utilization, blocking probability, and fraction of fragmentation of the spectrum. The spectrum utilization can reach up to a maximum of 92% and that only 71% of the spectrum is fragmented under maximum network load condition. Finally in the third part of the thesis, we discuss PLIs-aware RSA for the transparent exible-grid optical network. In this network, not only the optical signal expected to travel longer distance, but also to support higher line rates, i.e., data rate is increased up to 1 Tb/s. In such a high data rate, the optical signals are more prone to impairments and noises. As the transmission distance increases, optical signals are subject to tra-verse over many bandwidth-variable wavelength cross connects (BV-WXC) and multiple fibber spans due to which the PLIs get accumulated and are added to the optical signal. These accumulated impairments degrades the signal quality to an unacceptable level at the receiver, the quality of transmission falls below the acceptable threshold value, and the receiver may not be able to detect the signal properly. Therefore our objective is to develop an impairment aware RSA algorithm which establishes the QoT satisfied empathy based on the available resources and the quality of the signal available at the receiver. We formulate the PLIs-RSA problem as an ILP that provides an optimal solution. The optimal solution is obtained by solving the ILP using IBM ILOG CPLEX optimization solver. Since ILP is not efficient for large-size networks, we propose a heuristic algorithm for such a large-size networks. The signal power is measured at the receiver and the connection is established only when the signal power lies above the threshold value. The heuristic algorithm is evaluated through discrete-event simulation. It gives the sub-optimal solution. The simulation result is compared with optimal solution. The result shows that heuristic algorithm performs closer to the ILP. We compute the total blocking probability versus the network load for different spectrum allocation schemes. Total blocking probability is the sum of frequency-slot blocking probability and QoT blocking probability. We compute spectrum efficiency for the proposed algorithm. We also compare our algorithm with the existing routing and spectrum allocation algorithm, and the result shows that our algorithm outperforms the existing algorithms in terms of blocking probability and spectrum utilization.

Abstract This thesis concentrates on evaluating and improving the throughput performances of mobile users in high speed vehicles. In particular, high speed train (HST) scenarios are considered. Emphasis is placed on practical designs and methods that take into account distinctive HST characteristics. A two-hop communication link, i.e., base station (BS)-to-HST and HST-to-onboard users (OBUs) is adopted. The main target is to improve the throughput performance on the BS-to-HST communication link, which is assumed to be the main bottleneck in the whole communication link, since the HST-to-OBU communication link is assumed to have good channel quality due to the short link distance with relatively stationary OBUs. The algorithms developed are assessed through link and system level simulations. A theoretical and practical study of the throughput maximization problem in a single and multi-cell multiple-input multiple-output orthogonal frequency-division multiplexing (MIMO-OFDM) train scenario are considered with and without cooperation between train carriages. Two low-complexity transmission schemes based on simple antenna selection (AS) methods with spatial multiplexing (SM) are proposed. The simulation results demonstrate that large antenna arrays with AS and SM transmission strategies have the potential to significantly improve the throughput of the BS-to-train link in HST scenarios. Resource sharing methodologies between the moving relay nodes (MRNs) on the HST and ground macro users (GMUs) were also studied in a multi-cell MIMO-OFDM train scenario. Direct application of existing resource scheduling methods will not be appropriate to efficiently and fairly share resources, since the MRNs and the GMUs have different processing capabilities. Hence, two hybrid resource scheduling methods are analyzed in conjunction with joint and disjoint resource management. The tradeoff between the number of MRNs and receive antennas that should be installed on an HST was also examined in the context of throughput performance and capital expenditure. Results show that joint scheduling does not provide the best overall performance and there is a need to schedule each group of mobile terminals (MTs) separately. Finally, the feasibility of the use of higher frequency bands (HFBs) was examined in HST scenarios. A timer-based beam selection scheme for HST, which does not require any training time to select the appropriate beam is also proposed. The proposed beam selection scheme (PBSS) displays a close performance to the ideal singular value decomposition (SVD) scheme. / Tiivistelmä Tämä väitöskirja keskittyy mobiilikäyttäjien tiedonsiirtonopeuksien arviointiin ja parantamiseen nopeasti liikkuvissa kulkuneuvoissa. Työ käsittelee erityisesti tiedonsiirtoa suurnopeusjunissa. Työssä korostetaan käytännön menetelmiä, jotka ottavat huomioon nopeasti liikkuvien junien tiedonsiirron erityispiirteet. Työssä käytetään kahden hypyn linkkimallia, jossa tiedonsiirto kulkee tukiasemalta junaan ja junasta käyttäjälle, joka on junassa. Päätavoite on parantaa datanopeuksia tukiaseman ja junan välisessä tiedonsiirtolinkissä, jonka uskotaan olevan suurin pullonkaula koko tiedonsiirtolinkissä, koska junan ja lähes paikallaan olevan käyttäjän välinen kanava voidaan olettaa hyvälaatuiseksi linkin lyhyyden vuoksi. Kehitettyjen algoritmien suorituskykyä arvioidaan linkki- ja järjestelmätason simulaatioilla. Työssä tutkitaan tiedonsiirtonopeuden maksimointiongelmaa teoreettisella ja käytännön tasolla yhden ja usean solun MIMO OFDM junaskenaarioissa, joissa junan vaunut tekevät tai eivät tee yhteistyötä. Työssä esitetään kaksi alhaisen kompleksisuuden lähetysmenetelmää, jotka hyödyntävät yksinkertaista antennin valintamenetelmää ja tilatason multipleksointia. Simulointitulokset osoittavat, että suuret antenniryhmät, jotka hyödyntävät näitä lähetysmenetelmiä, voivat parantaa merkittävästi tiedonsiirtonopeutta tukiasemalta junaan päin. Työssä tutkitaan myös resurssien jakomenetelmiä liikkuvien junassa olevien releiden ja maatason makrokäyttäjien välillä monen solun MIMO-OFDM junaskenaariossa. Nykyisten resurssinhallintamenetelmien käyttö ei ole suoraan mahdollista tehokasta ja oikeudenmukaista resurssien jakoa, koska releillä ja makrokäyttäjillä on erilaiset prosessointikyvyt. Tämän vuoksi työssä analysoidaan kahta hybridimenetelmään resurssien skeduloinnille. Tutkimukset selventävät tasapainoa releiden lukumäärän ja junaan asennettavien vastaanotinantennien välillä tiedonsiirtonopeuden ja kustannusten osalta. Tulokset osoittavat, että yhteinen resurssien jako ei saavuta parasta suorituskykyä, eikä ole tarvetta ajoittaa jokaista matkaviestinterminaaliryhmää erikseen. Lopuksi työssä tutkitaan korkeampien taajuusalueiden soveltuvuutta tiedonsiirtoon suurnopeusjunissa. Työssä ehdotetaan ajastinpohjaista keilanvalintamenetelmää, joka ei vaadi opetusjaksoa sopivan keilan valintaan. Ehdotetun menetelmän saavuttama suorituskyky on lähellä ideaalisen singulaariarvohajotelmaa hyödyntävän menetelmän suorituskykyä.

O surgimento de novos serviços de telecomunicações tem provocado um enorme aumento no tráfego de dados nas redes de transmissão. Para atender a essa demanda crescente, novas tecnologias foram desenvolvidas e implementadas ao longo dos anos, sendo que um dos principais avanços está na área de transmissão óptica, devido à grande capacidade de transporte de informação da fibra óptica. A tecnologia que melhor explora a capacidade desse meio de transmissão atualmente é a multiplexação por divisão de comprimento de onda ou Wavelength Division Multiplexing (WDM) que permite a transmissão de diversos sinais utilizando apenas uma fibra óptica. Redes ópticas WDM se tornaram muito complexas, com enorme capacidade de transmissão de informação (terabits por segundo), para atender à explosão de necessidade por largura de banda. Nesse contexto, é de extrema importância que os recursos dessas redes sejam utilizados de forma inteligente e otimizada. Um dos maiores desafios em uma rede óptica é a escolha de uma rota e a seleção de um comprimento de onda disponível na rede para atender uma solicitação de conexão utilizando o menor número de recursos possível. Esse problema é bastante complexo e ficou conhecido como problema de roteamento e alocação de comprimento de onda ou, simplesmente, problema RWA (Routing and Wavelentgh Assignment problem). Muitos estudos foram realizados com o objetivo de encontrar uma solução eficiente para esse problema, mas nem sempre é possível aliar bom desempenho com baixo tempo de execução, requisito fundamental em redes de telecomunicações. A técnica de algoritmo genético (AG) tem sido utilizada para encontrar soluções de problemas de otimização, como é o caso do problema RWA, e tem obtido resultados superiores quando comparada com soluções heurísticas tradicionais encontradas na literatura. Esta dissertação apresenta, resumidamente, os conceitos de redes ópticas e de algoritmos genéticos, e descreve uma formulação do problema RWA adequada à solução por algoritmo genético. / The advent of new telecommunication services resulted in a huge increase of data traffic in the transmission networks. New technologies were developed and implemented over the years to attend to this growing demand, and the optical transmission technology stands. It has advanced greatly, due to the optical fibers large capacity of information transmission. Actually, the best technology to exploits the capacity of the fiber is the wavelength-division multiplexing (WDM), allowing the transmission of multiple signals over a single optical fiber. The WDM optical networks have become very complex, with huge capacity (terabits per second), to attend the ever growing need for bandwidth. In this context, it is extremely important to use the networks resources in an intelligent and optimized way. One of the biggest challenges in an optical network is choosing a route, and selecting a available wavelength on the network to attend a connection request using the least amount of resources. This problem is quite complex, and is known as the routing and wavelength assignment problem or simply RWA problem. Many studies were conducted in order to find an efficient solution to this problem, but it is not always possible to combine good performance with low execution time, a fundamental requirement in telecommunications networks. Genetic Algorithms have been used to solve hard optimization problems, as is the case of the RWA problem, and has produced remarkable results when compared to traditional heuristics found in the literature. This work presents an overview of the concepts of optical networks and genetic algorithms, and describes a formulation of RWA problem that is adequate for solution by genetic algorithm.

Nessa dissertação apresenta-se um novo modelo de cooperação com codificação de rede para cenários em que há múltiplo acesso por divisão de frequências ortogonais (OFDMA). O modelo proposto é desenvolvido sobre o modelo da Codificação de Rede Dinâmica Generalizada (GDNC) incorporando-se a ele a alocação de subportadoras pelo algoritmo de máximas combinações com restrição (MCMA). O objetivo é incorporar ao GDNC a possibilidade de explorar a diversidade em frequência através da correta alocação de subportadoras para os diversos nós do sistema. A análise do modelo proposto, GDNCOFDMA, é desenvolvida em cenários nos quais o desvanecimento dos blocos de coerência é do tipo Rayleigh. Expressões para probabilidade de outage atingida pelo sistema, assim como a curva diversidade-multiplexação (DMT) obtidas são confrontadas com simulações numéricas. O desempenho do GDNC-OFDMA é confrontado com esquema análogo que também explora a diversidade em frequência da mesma forma, o NCC-OFDMA, que é revisitado nesse trabalho de forma a se obter uma versão mais realista do que a originalmente proposta. Os resultados obtidos mostram que o GDNC-OFDMA supera o desempenho em termos de diversidade em relação ao esquema GDNC com o custo de uma redução na taxa de multiplexação, devendo ser preferível a sua adoção nos cenários em que se aplica ao invés da versão original. Ainda, o GDNC-OFDMA tem melhor desempenho em termos de probabilidade de outage e diversidade comparativamente ao NCC-OFDMA. / In this master’s thesis a new model for network-coded cooperative communication in orthogonal frequency division multiple access (OFDMA) scenarios is proposed. The proposed model is an extension of the Generalized Dynamic Network Coding (GDNC), incorporating into it a subcarrier allocation method provided by the maximum-constraint matching allocation (MCMA) algorithm. The objective is to provide GDNC with the ability to explore frequency diversity through proper subcarrier allocation for the nodes in the system. The analysis of the proposed model, GDNC-OFDMA, is developed in scenarios in which coherence blocks undergo Rayleigh fading. Equations for outage probability of the system, as well as the diversity-multiplexing trade-off (DMT) are obtained and compared with numerical simulations. The performance of GDNC-OFDMA is compared with an analogous scheme which also explores frequency diversity in the same manner, the NCC-OFDMA, which is reviewed in this work in order to obtain a more realistic version compared to the one originally proposed. Results showed that GDNCOFDMA surpasses GDNC in terms of diversity at the cost of a decreasing in multiplexing rate, being preferable its adoption in applicable scenarios rather than the original version. Moreover, GDNC-OFDMA has better performance in terms of outage probability and diversity when compared to NCC-OFDMA.

Orientador: Celso de Almeida / Tese (doutorado) - Umiversidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de Computação / Made available in DSpace on 2018-08-17T06:29:22Z (GMT). No. of bitstreams: 1 Hoefel_RogerPierreFabris_D.pdf: 16131215 bytes, checksum: 8d67fff6992c05fd8d2eac683e4a1f9e (MD5) Previous issue date: 2000 / Resumo: O objetivo deste trabalho é o de analisar, caracterizar e apresentar soluções para o excitante desafio de projetar protocolos de acesso para o transporte de pacotes multimídia no enlace reverso de sistemas celulares terrestres que empregam interface do ar do tipo TD/DS-CDMA (Time Division/Direct Sequence Code Division Multiple Access). Os estudos relativos aos aspectos inerentes à transmissão de pacotes em sistemas TD/DS-CDMA são particularizados na análise dos protocolos CDMA/PRMA (Code Division Multiple Access/ Packet Reservation Multiple Access) e Slotted CDMA/ALOHA. CDMA/PRMA é um protocolo de múltiplo acesso híbrido, no qual se aplicam os conceitos de multiplexação no tempo~por código e de alocação de recursos por meio de reserva. O acesso controlado ao canal do protocolo CDMA/PRMA permite a redução da variação da carga instantânea do canal e, conseqüentemente, redução da interferência de múltiplo acesso em relação ao protocolo Slotted CDMA/ ALOHA, onde os terminais acessam no próximo slot de tempo tão logo tenham pacotes a transmitir. Utiliza-se simulação computacional de maneira intensiva para à obtenção de resultados concernentes ao desempenho dos protocolos CDMA/PRMA e Slotted CDMA/ ALOHA em distintas condições operacionais. Estes resultados são validados por análises numéricas. Entre outros aspectos deste trabalho, destaca-se: (i) o modelo do ponto de equilíbrio proposto para os protocolos CDMA/PRMA e Slotted CDMA/ ALOHA; (ii) as expressões numéricas propostas para uma análise de desempenho do protocolo CDMA/PRMA; (iii) o desenvolvimento de um simulador de rede de pacotes para a investigação dos efeitos da interferência externa nas redes de pacotes CDMA/PRMA e Slotted CDMA/ ALOHA; (iv) efeitos dos parâmetros de projeto no desempenho dos protocolos CDMA/PRMA e Slotted CDMA/ ALORA; (v) estudo do desempenho dos protocolos CDMA/PRMA e Slotted CDMA/ ALORA com tráfego de vídeo com taxa variável e tráfego de dados WWW; (vi) a investigação dos efeitos do controle de potência, do desvanecimento rápido e do desvanecimento lento no desempenho dos protocolos CDMA/PRMA e Slotted CDMA/ ALORA com tráfego multimídia; (vii) o projeto integrado do protocolo CDMA/PRMA com receptor de detecção conjunta descorrelacionadora / Abstract: This thesis has the objective of to analyze, to characterize and to propose solutions to the challenge of design medium access control protocols for transmission of multimedia packets over the reverse channel of land mobile cellular systems based on TD/DS-CDMA (Time Division/Direct Sequence Code Division Multiple Access) air interface. Some inherent aspects of packet transmission over the reverse link of TD/DS-CDMA systems are particularized in the analysis of the CDMA/PRMA (Code Division Multiple Access/Packet Reservation Multiple Access) and Slotted CDMA/ ALOHA protocols. The joint CDMA/PRMA protocol is a hybrid multiple-access technique that combines time-division, code-division and Reservation ALOHA concepts. The CDMA/PRMA medium access control brings to reduction of the users variance on the channel, so a larger capacity is obtained in relation to the Slotted CDMA/ ALOHA protocol, where a mobile station accesses a time slot as soon as it has packets to transmit. It is used intensely computational simulation techniques to obtain some performance results concerning to CDMA/PRMA Slotted and CDMA/ ALOHA behavior over distinct operational conditions. It is utilized numerical techniques to validate some of obtained results. It is emphasized the following aspects of this Thesis: (i) a equilibrium point analysis model for the CDMA/PRMA and Slotted CDMA/ ALOHA protocols; (ii) some numerical expressions that permits to analyze the CDMA/PRMA behavior on voice-only traffic; (iii) a system level network simulator developed to assess and to compare the intercell interference effects on the CDMA/PRMA and Slotted CDMA/ ALOHA protocols performance; (iv) the design parameters effects on the performance of CDMA/PRMA and Slotted CDMA/ALOHA systems; (v) some studies of CDMA/PRMA and Slotted CDMA/ALOHA behavior on mixed voice/variable bit rate video and voice/WWW browsing traffic; (vi) some analysis of the imperfect power control effects, slow and fast fading effects on the capacity of CDMA/PRMA and Slotted CDMA/ ALOHA protocols; (vii) a integrated design of CDMA/PRMA protocol and a multiuser decorrelator detector / Doutorado / Telecomunicações e Telemática / Doutor em Engenharia Elétrica

Submitted by Marta Toyoda (1144061@mackenzie.br) on 2018-02-08T19:53:42Z No. of bitstreams: 2 RENATO PIVESSO FRANZIN.pdf: 4022365 bytes, checksum: 9a9f1f649dcaff054b2cc033a7c69dba (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Approved for entry into archive by Paola Damato (repositorio@mackenzie.br) on 2018-02-22T13:30:38Z (GMT) No. of bitstreams: 2 RENATO PIVESSO FRANZIN.pdf: 4022365 bytes, checksum: 9a9f1f649dcaff054b2cc033a7c69dba (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Made available in DSpace on 2018-02-22T13:30:38Z (GMT). No. of bitstreams: 2 RENATO PIVESSO FRANZIN.pdf: 4022365 bytes, checksum: 9a9f1f649dcaff054b2cc033a7c69dba (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Previous issue date: 2017-10-27 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / The present dissertation presented a comparative analysis between OFDM and FBMC modulation techniques, applied in Power Line Communication (PLC) technology, considering realistic channel models. With the growing demand for access to broadband data networks, there is a need to integrate the various data communication technologies. In this scenario, PLC networks can o er a viable alternative as a provider of network access, since they use the infrastructure of the transmission lines. However, the electrical network is a hostile medium for data transmission, presenting impedance mismatches, noise interference and signal propagation in multipath, characterizing the PLC channel model. With the objective of increasing the data transmission rate, as well as to obtain a better utilization of available bandwidth, the present work proposed to replace the OFDM technique by FBMC in PLC networks. For this, a study of the channel model was carried out to obtain the necessary parameters for the computational simulations through Matlab software. The OFDM and FBMC techniques were implemented according to IEEE 1901 standard technical speci cations. With the results obtained in the simulations, it was veri ed that the FBMC is more robust the channel interferences, presenting gains of up to 8 dB in the bit error rate, and an increase in the data transmission rate and spectral e ciency of up to 25% in relation to OFDM. Therefore, the FBMC technique can be implemented at the physical layer of the IEEE 1901 standard, replacing OFDM. / A presente dissertação apresentou uma análise comparativa entre as t_ecnicas de modulação OFDM e FBMC, aplicadas na tecnologia Power Line Communication (PLC), considerando modelos realísticos de canais. Com a crescente demanda ao acesso das redes de dados em banda larga, há uma necessidade de integração das diversas tecnologias de comunicação de dados. Nesse cenário, as redes PLC podem oferecer uma alternativa viável como provedora de acesso à rede, pois utilizam a infraestrutura das linhas de transmissão de energia elétrica. Entretanto, a rede elétrica é um meio hostil para transmissão de dados, apresentando desajustes de impedância, interferência de ruído e propagação do sinal em multipercursos, caracterizando o modelo do canal PLC. Com o objetivo de aumentar a taxa de transmissão de dados, como também obter um melhor aproveitamento da largura de banda disponível, o presente trabalho propôs substituir a técnica OFDM pela FBMC em redes PLC. Para isso, foi realizado um estudo do modelo do canal, para obter os parâmetros necessários para as simulações computacionais por meio do software Matlab. As técnicas OFDM e FBMC foram implementadas de acordo com especificações técnicas do padrão IEEE 1901. Com os resultados obtidos nas simulações, constatou que o FBMC é mais robusto as interferências do canal, apresentando ganhos de até 8 dB na taxa de erro de bit, e um incremento na taxa de transmissão de dados e eficiência espectral de até 25% em relação ao OFDM. Portanto, a técnica FBMC pode ser implementada na camada física do padrão IEEE 1901, substituindo o OFDM.

This paper presents a new hybrid PAPR reduction technique for the OFDM signal, which combines a multiple symbol representations method with a signal clipping method. The clipping method is a nonlinear PAPR reduction scheme, where the amplitude of the signal is limited to a given threshold. Considering the fact that the signal must be interpolated before A/D conversion, a variety of clipping methods has been proposed. Some methods suggest the clipping before interpolation, having the disadvantage of the peaks re-growth. Other methods contributed that the clipping after interpolation, having the disadvantage of out-of-band power production. In order to overcome this problem different filtering techniques have been proposed. Filtering can also cause peak re-growth, but less than the clipping before interpolation. Another clipping technique supposes that only subcarriers having the highest phase difference between the original signal and its clipped variant will be changed. This is the case of the partial clipping method. To further reduce the PAPR, the dynamic of the clipped signal can be compressed. Linear methods like partial transmit sequence or selective mapping has been proposed for the reduction of PAPR as well. Another PAPR reduction method is the tone reservation. It uses tones on which no data is sent to reduce the transmitted signal peaks. Derivatives of this method with lower computation complexity and improved performance have been proposed: One-Tone One-Peak and one by-one iteration. A similar PAPR reduction method is the multiple symbol representations, where alternative signalling points are used to represent one symbol. The simulation results highlight the advantages of the proposed PAPR reduction method. / The proposed technique namely Adaptive Active Constellation Extension (Adaptive ACE) Algorithm reduced the high Peak-to-Average Power Ratio (PAPR) of the Orthogonal Frequency Division Multiplexing (OFDM) systems. The Peak-to-Average Power Ratio (PAPR) is equal to 6.8 dB for the target clipping ratios of 4 dB, 2 dB and 0 dB by using Adaptive Active Constellation Extension (Adaptive ACE) Algorithm. Thus, the minimum PAPR can be achieved for low target clipping ratios. The Signal-to-Noise Ratio (SNR) of the Orthogonal Frequency Division Multiplexing (OFDM) signal obtained by the Adaptive Active Constellation Extension (Adaptive ACE) algorithm is equal to 1.2 dB at a Bit Error Rate (BER) of 10-0..4 for different constellation orders like 4-Quadrature Amplitude Modulation (4-QAM), 16-Quadrature Amplitude Modulation (16-QAM) and 64-Quadrature Amplitude Modulation (16-QAM). Here, the Bit Error Rate of 10-0.4 or 0.398, that means a total of 398-bits are in error when 1000-bits are transmitted via a communication channel or approximately 4-bits are in error when 10-bits are transmitted via a communication channel, which is high when compared to that of the original Orthogonal Frequency Division Multiplexing (OFDM) signal. The other problems faced by the Adaptive Active Constellation Extension (Adaptive ACE) algorithm are Out-of-Band Interference (OBI) and peak regrowth. Here, the Out-of-Band Interference (OBI) is a form of noise or an unwanted signal, which is caused when the original Orthogonal Frequency Division Multiplexing (OFDM) signal is clipped for reducing the peak signals which are outside of the predetermined area and the peak regrowth is obtained after filtering the clipped signal. The peak regrowth results to, increase in the computational time and computational complexity. In this paper, we have proposed a PAPR reduction scheme to improve the bit error rate performance by applying companding transform technique. Hence, 1-1.5 dB reduction in PAPR with this Non-companding technique is achieved. In Future, We can accept to implement the same on Rician and Rayleigh channels. / Clement Ranjith Anthikkad (E-mail: clement.ranjith@gmail.com / clan11@bth.se) & Irfan Ahmed Baig (E-mail: baig.irfanahmed@gmail.com / ir-a11@bth.se )

Depuis une dizaine d’années, avec la diversification des appareils connectés (PCs, Tablettes, TVs et Smartphones), l’écosystème Internet s’est drastiquement étendu. Aujourd’hui, 80 % du trafic IP mondial est concentré dans les centres de données. Pour répondre aux problématiques d’échelle des centres de données en terme de densité de bande passante, de consommation énergétique et de coût des interconnections, le développement de nouveaux émetteurs optiques est critique. L’objectif de cette thèse est de proposer et évaluer différentes architectures d’émetteur en photonique sur silicium afin de répondre à la prochaine norme de débit de 400 Gbit/s sur des transmissions de 2 kilomètres. Le modulateur électro-optique sélectionné est le modulateur silicium en anneau résonant. Il possède des avantages non négligeables: faibles dimensions, faible consommation énergétique, et il permet un multiplexage dense en longueurs d’ondes. Durant cette thèse, l’optimisation de l’émetteur optique a été faite de manière progressive: de la jonction active à l’émetteur complet. Cette première étude a identifié les différents compromis à faire sur les paramètres du modulateur en anneau afin de définir ses performances. Un model compact du modulateur a été créé, permettant d’optimiser le composant avec un temps de simulation très réduit. Puis, tout en utilisant le modèle compact, deux architectures d’émetteur ont été étudiées basées sur une architecture classique de la littérature. Elles sont basées sur la mise en série de 8 modulateurs en anneau, chacun modulant une longueur d’onde différente. La différence entre les deux architectures vient du format de modulation utilisé: la première est modulée avec des signaux sur deux niveaux électriques avec des signaux sur 2 niveaux électriques au format d’impulsions en amplitude (PAM-2) à 50 Gbaud ; alors que la deuxième est modulée avec des signaux sur 4 niveaux électriques au format d’impulsions en amplitude (PAM-4). Les deux solutions répondent aux demandes de performances de la norme 400 Gbit/s avec les mêmes points de compromis de fonctionnement. Finalement, de nouvelles architectures d’émetteur optique ont été proposées permettant de réaliser la modulation PAM-4. Contrairement aux solutions précédemment étudiées, ces architectures utilisent en entrée deux flux de bits en parallèle qui sont optiquement combinés pour générer en sortie une modulation PAM-4. Une première solution est basée sur la mise en série de deux modulateurs en anneaux. Cette architecture a été validée avec des caractérisations de transmission optique à 30 Gbit/s avec seulement 1 Vpp de tension de commande. Une seconde solution a ensuite été proposée, elle est basée sur l’utilisation de deux modulateurs mis en parallèle dans un interféromètre Mach Zehnder. De la même manière, des caractérisations de transmission à 30 Gbit/s avec 1.2 Vpp de tension de commande ont permis de valider le fonctionnement de l’architecture. / Over the past decade, with the diversification of connected devices (PCs, Tablets, TVs and Smartphones), the Internet ecosystem has drastically extended. Today, 80 % world traffic is concentrated in the data centers where the data rate, the size and the cost is still growing. To address such scaling issues as bandwidth density, energy consumption and cost of the interconnects inside the data centers, the development of new optical transmitters is critical. The aim of this thesis is to propose and evaluate transmitter architectures using silicon photonics technology to address next 400 Gbit/s data rate standard over up to 2 kilometer links. The selected electro-optical modulator is the silicon ring resonator modulator which has substantial benefits: low footprint, low energy consumption and enables dense multiplexing. The optical transmitter architectures evaluations were successively optimized: from the active junction to the complete optical transmitter. This study identified the performances trade-offs impacted by the ring resonator modulator parameters. A compact model was generated to physically optimize the component in a reduced simulation time. Then, using the compact model, two transmitter architectures were studied based on classical architecture. Both are based on eight ring resonator modulators arranged in series modulating eight different wavelengths. The difference is the modulation format: the first one is electrically modulated at 50 Gbaud in 2-levels pulse amplitude modulation (PAM-2) and the second one at 25 Gbaud 4-levels pulse amplitude modulation (PAM-4). The two solutions fit the 400 Gbit/s performances demand with the use of the same trade-offs. Finally, new transmitter architectures were proposed to generate PAM-4 modulation. Unlike the previous architecture, they have in input two parallel bit streams which are optically combined to generate the PAM-4 modulation. The first solution is based on two silicon ring resonator modulator arranged in series. This architecture was validated through 30 Gbit/s transmission characterizations with only 1 Vpp. A second solution was then proposed, based on two silicon ring resonator modulators arranged in parallel in a Mach Zehnder interferometer. In the same way, transmission characterizations at 30 Gbit/s with 1.2 Vpp allows this architecture to be validated.

Fusion frames and block sparse recovery are of interest in signal processing and communication applications. In these applications it is required that the fusion frame have some desirable properties. One such requirement is that the fusion frame be tight and its subspaces form an optimal packing in a Grassmannian manifold. Such fusion frames are called Grassmannian fusion frames. Grassmannian frames are known to be optimal dictionaries for sparse recovery as they have minimum coherence. By analogy Grassmannian fusion frames are potential candidates as optimal dictionaries in block sparse processing. The present work intends to study fusion frames in finite dimensional vector spaces assuming a specific structure useful in block sparse signal processing. The main focus of our work is the design of Grassmannian fusion frames and their implication in block sparse recovery. We will consider burst error correction as an application of block sparsity and fusion frame concepts. We propose two new algebraic methods for designing Grassmannian fusion frames. The first method involves use of Fourier matrix and difference sets to obtain a partial Fourier matrix which forms a Grassmannian fusion frame. This fusion frame has a specific structure and the parameters of the fusion frame are determined by the type of difference set used. The second method involves constructing Grassmannian fusion frames from Grassmannian frames which meet the Welch bound. This method uses existing constructions of optimal Grassmannian frames. The method, while fairly general, requires that the dimension of the vector space be divisible by the dimension of the subspaces. A lower bound which is an analog of the Welch bound is derived for the block coherence of dictionaries along with conditions to be satisfied to meet the bound. From these results we conclude that the matrices constructed by us are optimal for block sparse recovery from block coherence viewpoint. There is a strong relation between sparse signal processing and error control coding. It is known that burst errors are block sparse in nature. So, here we attempt to solve the burst error correction problem using block sparse signal recovery methods. The use of Grassmannian fusion frames which we constructed as optimal dictionary allows correction of maximum possible number of errors, when used in conjunction with reconstruction algorithms which exploit block sparsity. We also suggest a modification to improve the applicability of the technique and point out relationship with a method which appeared previously in literature. As an application example, we consider the use of the burst error correction technique for impulse noise cancelation in OFDM system. Impulse noise is bursty in nature and severely degrades OFDM performance. The Grassmannian fusion frames constructed with Fourier matrix and difference sets is ideal for use in this application as it can be easily incorporated into the OFDM system.

Abstract This thesis concentrates on the design and evaluation of spatial user multiplexing methods via linear transmit-receive processing for wireless cellular multi-user multiple-input multiple-output (MIMO) communication systems operating in the time-division duplexing (TDD) mode. The main focus is on the acquisition of effective channel state information (CSI) that facilitates decentralized processing so that the network nodes – base stations (BS) and user terminals (UT), each employing an arbitrary number of antenna elements – are able to locally participate in the network adaptation. The proposed methods rely on the uplink-downlink channel reciprocity and spatially precoded over-the-air pilot signaling. Considering (single-cell) multi-user MIMO systems, coordinated zero-forcing transmit-receive processing schemes for the uplink (UL) are proposed. The BS computes the transmission parameters in a centralized manner and employs downlink (DL) pilot signals to convey the information of the beamformers to be used by the UTs. When coexisting with the DL zero-forcing, the precoded DL demodulation pilots can be reused for UL beam allocation, and the precoded UL demodulation pilots are reused in turn for partial channel sounding (CS). As a result, only the precoded pilot symbols are needed in both UL and DL. Moreover, a concept for reducing the number of the required orthogonal UL CS pilot resources is presented. Based on their DL channel knowledge, the multi-antenna UTs form fewer pilot beams by spatial precoding than conventionally needed when transmitting antenna-specific pilots. In the context of DL zero-forcing, when taking into account the CSI estimation error at the BS, the overhead reduction turns out to improve robustness and increase the average system capacity. Considering multi-cell multi-user MIMO systems, decentralized coordinated DL beamforming strategies based on weighted sum rate (WSR) maximization are proposed. An optimization framework where the WSR maximization is carried out via weighted sum mean-squared-error minimization is utilized, and the approach is generalized by employing antenna-specific transmit power constraints. The iterative processing consists of optimization steps that are run locally by the BSs. In one novel strategy, the coordinating cells update their transmit precoders and receivers one cell at a time, which guarantees monotonic convergence of the network-wide problem. The strategy employs separate uplink CS and busy burst pilot signaling to reveal the effective channels of the UTs to the neighboring BSs. In another novel strategy, the monotonic convergence is sacrificed to devise a faster scheme where the BSs are allowed to optimize their variables in parallel based on just the CS responses and additional low-rate backhaul information exchange. The numerical results demonstrate that WSR maximization has the desirable property that spatial user scheduling is carried out implicitly. Finally, methods for UL CS overhead reduction are presented, and the effect of CSI uncertainty is addressed. / Tiivistelmä Tämä väitöskirja keskittyy lineaarisella lähetys- ja vastaanottoprosessoinnilla toteutettavien tilajakomonikäyttömenetelmien suunnitteluun ja arviointiin langattomissa moniantennisissa solukkoverkoissa, jotka hyödyntävät aikajakodupleksointia (TDD). Erityisesti tarkastellaan efektiivisen kanavatiedon hankintaa, joka mahdollistaa hajautetun prosessoinnin siten että verkkoelementit – tukiasemat ja terminaalit, jotka kukin hyödyntävät useaa antennielementtiä – voivat osallistua paikallisesti verkon adaptaatioon. Esitetyt menetelmät perustuvat ylä- ja alalinkin kanavien resiprookkisuuteen ja tilatasossa esikoodattuun opetus- eli pilottisignalointiin ilmarajapinnan yli. Yksisoluisille monikäyttäjä- ja moniantennijärjestelmille esitetään ylälinkin koordinoituja nollaanpakottavia lähetys- ja vastaanottomenetelmiä. Tukiasema laskee lähetysparametrit keskitetysti ja käyttää pilottisignaaleja kertomaan millaista lähetyskeilanmuodostusta terminaalien tulee käyttää. Alalinkin nollaanpakotuksen yhteydessä esikoodattuja demodulaatiopilotteja voidaan uudelleenkäyttää ylälinkin lähetyskeilojen allokointiin, ja esikoodattuja ylälinkin demodulaatiopilotteja uudelleenkäytetään puolestaan osittaiseen kanavan luotaukseen (sounding). Näin ollen molempiin suuntiin tarvitaan vain esikoodatut pilotit. Lisäksi työssä esitetään menetelmä ylälinkin luotauspilottiresurssitarpeen vähentämiseksi. Kanavatietoon perustuen moniantenniset terminaalit muodostavat tilatasossa esikoodattuja pilottilähetyskeiloja, joita tarvitaan vähemmän kuin perinteisiä antennikohtaisia pilotteja. Kun otetaan huomioon kanavanestimointivirhe tukiasemassa, resurssiensäästömenetelmä parantaa häiriösietoisuutta ja nostaa järjestelmän keskimääräistä kapasiteettia alalinkin nollaanpakotuksen yhteydessä. Monisoluisille monikäyttäjä- ja moniantennijärjestelmille esitetään hajautettuja koordinoituja alalinkin keilanmuodostusstrategioita, jotka perustuvat painotetun summadatanopeuden (WSR) maksimointiin. Valitussa optimointikehyksessä WSR:n maksimointi toteutetaan painotetun summaneliövirheen minimoinnin kautta, ja työssä menettelytapa yleistetään antennikohtaisten lähetystehorajoitusten tapaukseen. Iteratiivinen prosessointi koostuu optimointiaskelista, jotka tukiasemat paikallisesti suorittavat. Yhdessä esitetyssä strategiassa yhteistoiminnalliset solut päivittävät lähettimensä ja vastaanottimensa yksi solu kerrallaan, mikä takaa verkonlaajuisen ongelmanratkaisun monotonisen konvergenssin. Tämä strategia käyttää erillisiä ylälinkin luotaussignaaleja sekä varattu-signaaleja ilmaistakseen terminaalien efektiiviset kanavat naapuritukiasemille. Toisessa strategiassa monotoninen konvergenssi uhrataan ja kehitetään nopeammin adaptoituva menetelmä, jossa tukiasemat saavat optimoida muuttujansa rinnakkain, perustuen vain luotaussignaaleihin ja tukiasemien väliseen informaationvaihtoon. Numeeriset tulokset osoittavat, että WSR:n maksimointi toteuttaa aktiivisten käyttäjien valinnan tilatasossa implisiittisesti. Lopuksi esitetään menetelmiä luotauspilottiresurssitarpeen vähentämiseksi ja käsitellään kanavatiedon epävarmuuden vaikutusta.