In the fast growing field of Telecommunications, the back up DC power supply plays a vital role in powering the telecom equipment. This DC power supply is a combination of AC-DC Rectifier coupled with a battery bank to support the load when AC input is not available. Figures 0.1 and 0.2 show the line diagram of the DC power supply. The power supply is the most critical element in a telecom installation and it should be highly reliable in order to have un-interrupted service. (Fig) Besides reliability, power density and cost are the driving forces behind the success of a power supply in the market. Off late, the reach of telecom in the society is very wide covering remote villages and major metros. Given this environment, the power supply is exposed to extreme input conditions. It is desirable to design the power supply capable of withstanding wide AC input conditions. Another advantage is that the rectifier unit will keep the battery charged so that the battery will have long life. This thesis is aimed at designing a 1400W (56V/25A) telecom power supply, keeping in view of the issues expressed above. The aim is to design a Switched Mode Rectifier (SMR) that tolerate wide input voltage variations (90Vac to 300Vac). In addition, the design covers unity input power factor, high efficiency (> 90%), high power density ( ), parallel operation and low cost ( ). Chapter 1 of this thesis covers the context and motivation of the work. Chapter 2 presents the design issues pertaining to power supplies. The normalized description of the power converters is presented. Such a description enables one to compare several circuit topologies in order to make effective design decisions. In a similar way the effectiveness of the switches and mgnetics are presented to enable design decisions in the output stage of the rectifier. Chapter 3 presents the design of the 1400W telecom power supply, keeping in view of the stated specifications. The performance results of the converter are presented in Chapter 4. All the design goals have been met. The design exercise has also given insights into possible further improvements. Contributions from this work and course of future development work are indicated in the concluding chapter.

Network coding has emerged as an attractive alternative to routing because of the through put improvement it provides by reducing the number of channel uses. In a wireless scenario, in addition, further improvement can be obtained through Physical layer Network Coding (PNC), a technique in which nodes are allowed to transmit simultaneously, instead of transmitting in orthogonal slots. In this thesis, the design and analysis of network coding schemes are considered, for wireless two-way relaying, multi-user Multiple Access Relay Channel (MARC) and wireline networks. In a wireless two-way relay channel with PNC, the simultaneous transmissions of user nodes result in Multiple Access Interference (MAI) at there lay node. The harmful effect of MAI is the presence of signal set dependent deep channel fade conditions, called singular fade states, under which the minimum distance of the effective constellation at the relay become zero. Adaptively changing the network coding map used at the relay according to channel conditions greatly reduces the impact of this MAI. In this work, we obtain these adaptive PNC maps, which are finite in number ,by completing partially filled Latin Squares and using graph vertex coloring. Having obtained the network coding maps, the set of all possible channel realizations is quantized into a finite number of regions, with a specific network coding map chosen in a particular region and such a quantization is obtained analytically for 2λ-PSK signal set. The performance of the adaptive PNC scheme for two-way relaying is analyzed and tight high SNR upper bounds are obtained for the average end-to-end symbol error probability, in terms of the average error probability of a point-to-point fading channel. The adaptive PNC scheme is generalized for two-way relaying with multiple antennas at the nodes. As an alternative to the adaptive PNC scheme for two-way relaying, a Distributed Space Time Coding (DSTC) scheme is proposed, which effectively re-moves the effect of singular fade states at the transmitting nodes itself without any Channel State Information at the Transmitter (CSIT), and without any need to change the PNC map as a function of channel fade conditions. It is shown that the singular fade states can be viewed equivalently as vector subspaces of C2, which are referred to as the singular fade subspaces. DSTC design criterion to minimize the number of singular fade subspaces and maximize the coding gain is formulated and explicit low decoding complexity DSTC designs are provided. For the K-user MARC, in which K source nodes want to transmit messages to a destination node D with the help of are lay node R, a new PNC scheme is proposed. Use of a many-to-one PNC map with conventional minimum squared Euclidean distance decoding at D, results in a loss of diversity order due to error propagation from the relay node. To counter this, we propose a novel low complexity decoder which offers the maximum diversity order of two. Next, we consider wire line networks and explore the connections between linear network coding, linear index coding and discrete polymatroids, which are the multi-set analogue of matroids. We define a discrete polymatroidal network and show that a fractional vector linear solution over a field Fq exists for a network if and only if the network is discrete polymatroidal with respect to a discrete polymatroid representable over Fq.An algorithm to construct networks starting from certain class of discrete polymatroids is provided. Every representation over Fq for the discrete polymatroid, results in a fractional vector linear solution over Fq for the constructed network. It is shown that a linear solution to an index coding problem exists if and only if there exists a representable discrete polymatroid satisfying certain conditions which are determined by the index coding problem considered. El Rouayheb et. al. showed that the problem of finding a multi-linear representation for a matroid can be reduced to finding a perfect linear index coding solution for an index coding problem obtained from that matroid. Multi-linear representation of a matroid can be viewed as a special case of representation of an appropriate discrete polymatroid. We generalize the result of El Rouayheb et. al. by showing that the problem of finding a representation for a discrete polymatroid can be reduced to finding a perfect linear index coding solution for an index coding problem obtained from that discrete polymatroid.