On the cut‐on frequencies of a large round duct with azimuthal as well as radial partitions

This letter deals with a three‐dimensional analysis of circular sectors and annular segments resulting from the partitioning of a round (cylindrical) duct for use in an active noise control system. The relevant frequency equations are derived for stationary medium and solved numerically to arrive at the cut‐on frequencies of the first few modes. The resultant table indicates among other things that azimuthal partitioning does not raise the cutoff frequency (the smallest cut‐on frequency) beyond a particular value, and that radial partitioning is counterproductive in that respect.

The fluorescence of Nd3+ in lead borate and bismuth borate glasses with large stimulated emission cross section

The stimulated emission cross section σp for the 1060 nm transition of Nd3+ in lead borate and bismuth borate glasses has been determined from fluorescence measurements. The compositional dependence of σp, which has been evaluated using radiative transition probability, refractive index of the host glass, effective fluorescence linewidth, and position of the band, with PbO/Bi2O3 content is investigated. The σp values of the 1060 nm band of Nd3+ for lead borate and bismuth borate glasses are found to be in the range 2.6–5.7×10−20 cm2 at 298 K and 3.0–6.3×10−20 cm2 at 4.2 K. The σp values are comparatively large suggesting the possible utilization of these materials in laser applications.

Low-Complexity Detection in Large-Dimension MIMO-ISI Channels Using Graphical Models

In this paper, we deal with low-complexity near-optimal detection/equalization in large-dimension multiple-input multiple-output inter-symbol interference (MIMO-ISI) channels using message passing on graphical models. A key contribution in the paper is the demonstration that near-optimal performance in MIMO-ISI channels with large dimensions can be achieved at low complexities through simple yet effective simplifications/approximations, although the graphical models that represent MIMO-ISI channels are fully/densely connected (loopy graphs). These include 1) use of Markov random field (MRF)-based graphical model with pairwise interaction, in conjunction with message damping, and 2) use of factor graph (FG)-based graphical model with Gaussian approximation of interference (GAI). The per-symbol complexities are O(K(2)n(t)(2)) and O(Kn(t)) for the MRF and the FG with GAI approaches, respectively, where K and n(t) denote the number of channel uses per frame, and number of transmit antennas, respectively. These low-complexities are quite attractive for large dimensions, i.e., for large Kn(t). From a performance perspective, these algorithms are even more interesting in large-dimensions since they achieve increasingly closer to optimum detection performance for increasing Kn(t). Also, we show that these message passing algorithms can be used in an iterative manner with local neighborhood search algorithms to improve the reliability/performance of M-QAM symbol detection.