Novel types of narrow band filters based on the newly introduced gap waveguide technology are presented in this paper. The proposed filters have a central frequency of 35 GHz with approximately 1% fractional bandwidth. The filter resonators are composed of two separate plates and are manufactured by milling metallic blocks. The gap between the two metallic plates eliminates the need for electrical contact between them. This feature allows the resonators to be stacked in different layers. The filtering function is realized by producing a coupling between the stacked resonators. The measurement results of the manufactured filters are in good agreement with full-wave simulations, even without any tuning or adjustments.Index Terms-Direct coupled resonators, filter, gap waveguide, groove gap waveguide (GGW), ridge gap waveguide (RGW), stacked layer.

In lossy source coding with side information at the decoder (i.e., the Wyner-Ziv problem), the estimate of the source obtained at the decoder cannot be generally reproduced at the encoder, due to its dependence on the side information. In some applications this may be undesirable, and a Common Reconstruction (CR) requirement, whereby one imposes that the encoder and decoder be able to agree on the decoder's estimate, may be instead in order. The rate-distortion function under the CR constraint has been recently derived for a point-to-point (Wyner-Ziv) problem. In this paper, this result is extended to three multiterminal settings with three nodes, namely the Heegard-Berger (HB) problem, its variant with cooperating decoders and the cascade source coding problem. The HB problem consists of an encoder broadcasting to two decoders with respective side information. The cascade source coding problem is characterized by a two-hop system with side information available at the intermediate and final nodes.For the HB problem with the CR constraint, the rate-distortion function is derived under the assumption that the side information sequences are (stochastically) degraded. The rate-distortion function is also calculated explicitly for three examples, namely Gaussian source and side information with quadratic distortion metric, and binary source and side information with erasure and Hamming distortion B. Ahmadi and O. Simeone are with the CWCSPR,

No abstract

No abstract

Source coding with a side information "vending machine" is a recently proposed framework in which the statistical relationship between the side information and the source, instead of being given and fixed as in the classical Wyner-Ziv problem, can be controlled by the decoder. This control action is selected by the decoder based on the message encoded by the source node. Unlike conventional settings, the message can thus carry not only information about the source to be reproduced at the decoder, but also control information aimed at improving the quality of the side information. In this paper, the analysis of the tradeoffs between rate, distortion, and cost associated with the control actions is extended from the previously studied point-to-point setup to two basic multiterminal models. First, a distributed source coding model is studied, in which two encoders communicate over rate-limited links to a decoder, whose side information can be controlled. The control actions are selected by the decoder based on the messages encoded by both source nodes. For this setup, inner bounds are derived on the rate-distortion-cost region for both cases in which the side information is available causally and noncausally at the decoder. These bounds are shown to be tight under specific assumptions, including the scenario in which the sequence observed by one of the nodes is a function of the source observed by the other and the side information is available causally at the decoder. Then, a cascade scenario in which three nodes are connected in a cascade and the last node has controllable side information is also investigated. For this model, the rate-distortion-cost region is derived for general distortion requirements and under the assumption of causal availability of side information at the last node.

Action-dependent channels model scenarios in which transmission takes place in two successive phases. In the first phase, the encoder selects an "action" sequence, with the twofold aim of conveying information to the receiver and of affecting in a desired way the state of the channel to be used in the second phase. In the second phase, communication takes place in the presence the mentioned actiondependent state. In this work, two extensions of the original action-dependent channel are studied. In the first, the decoder is interested in estimating not only the message, but also the state sequence within an average per-letter distortion. Under the constraint of common reconstruction (i.e., the decoder's estimate of the state must be recoverable also at the encoder) and assuming non-causal state knowledge at the encoder in the second phase, we obtain a single-letter characterization of the achievable rate-distortioncost trade-off. In the second extension, we study an action-dependent degraded broadcast channel. Under the assumption that the encoder knows the state sequence causally in the second phase, the capacitycost region is identified. Various examples, including Gaussian channels and a model with a "probing" encoder, are also provided to show the advantage of a proper joint design of the two communication phases.

This paper compares the correlation dimension (D2) and Higuchi fractal dimension (HFD) approaches in estimating BIS index based on of electroencephalogram (EEG). The single-channel EEG data was captured in both ICU and operating room and different anesthetic drugs, including propofol and isoflurane were used. For better analysis, application of adaptive segmentation on EEG signal for estimating BIS index is evaluated and compared to fixed segmentation. Prediction probability (PK) is used as a measure of correlation between the predictors and BIS index to evaluate the proposed methods. The results show the ability of these algorithms (specifically HFD algorithm) in predicting BIS index. Also, evolving fixed and adaptive windowing methods for segmentation of EEG reveals no meaningful difference in estimating BIS index

The model of a side information "vending machine" (VM) accounts for scenarios in which the measurement of side information sequences can be controlled via the selection of cost-constrained actions. In this paper, the three-node cascade source coding problem is studied under the assumption that a side information VM is available and the intermediate and/or at the end node of the cascade. A single-letter characterization of the achievable trade-off among the transmission rates, the distortions in the reconstructions at the intermediate and at the end node, and the cost for acquiring the side information is derived for a number of relevant special cases. It is shown that a joint design of the description of the source and of the control signals used to guide the selection of the actions at downstream nodes is generally necessary for an efficient use of the available communication links. In particular, for all the considered models, layered coding strategies prove to be optimal, whereby the base layer fulfills two network objectives: determining the actions of downstream nodes and simultaneously providing a coarse description of the source. Design of the optimal coding strategy is shown via examples to depend on both the network topology and the action costs. Examples also illustrate the involved performance trade-offs across the network.