The use of power converters is very important in maximizing the power transfer from renewable energy sources such as wind, solar, or even a hydrogen-based fuel cell to the utility grid. A LCL filter is often used to interconnect an inverter to the utility grid in order to filter the harmonics produced by the inverter. Even though there is an extensive amount of literature available describing LCL filters, there has been a gap in providing a systematic design methodology. Furthermore, there has been a lack of a state-space mathematical modeling approach that considers practical cases of delta and wye connected capacitors showing their effects on possible grounding alternatives. This paper describes a design methodology of a LCL filter for grid-interconnected inverters along with a comprehensive study of how to mitigate harmonics. The procedures and techniques described in this paper may be used in small-scale renewable energy conversion systems and may also be retrofitted for medium and large-scale grid connected systems.
We present a method for secrecy extraction from jointly Gaussian random sources. The approach is motivated by and has applications in enhancing security for wireless communications. The problem is also found to be closely related to some well known lossy source coding problems.
Abstract-We consider secret key generation for a "pairwise independent network" model in which every pair of terminals observes correlated sources that are independent of sources observed by all other pairs of terminals. The terminals are then allowed to communicate publicly with all such communication being observed by all the terminals. The objective is to generate a secret key shared by a given subset of terminals at the largest rate possible, with the cooperation of any remaining terminals. Secrecy is required from an eavesdropper that has access to the public interterminal communication. A (single-letter) formula for secret key capacity brings out a natural connection between the problem of secret key generation and a combinatorial problem of maximal packing of Steiner trees in an associated multigraph. An explicit algorithm is proposed for secret key generation based on a maximal packing of Steiner trees in a multigraph; the corresponding maximum rate of Steiner tree packing is thus a lower bound for the secret key capacity. When only two of the terminals or when all the terminals seek to share a secret key, the mentioned algorithm achieves secret key capacity in which case the bound is tight.Index Terms-PIN model, private key, public communication, secret key capacity, security index, spanning tree packing, Steiner tree packing, wiretap secret key.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.