Hybrid LMS-LMF algorithm for adaptive echo cancellation

The coefficients of an echo canceller with a near-end section and a far-end section are usually updated with the same updating scheme, such as the LMS algorithm. A novel scheme is proposed for echo cancellation that is based on the minimisation of two different cost functions, i.e. one for the near-end section and a different one for the far-end section. The approach considered leads to a substantial improvement in performance over the LMS algorithm when it is applied to both sections of the echo canceller. The convergence properties of the algorithm are derived. The proposed scheme is also shown to be robust to noise variations. Simulation results confirm the superior performance of the new algorithm.

Cost function adaptation: a stochastic gradient algorithm for data echo cancellation

A family of stochastic gradient algorithms and their behaviour in the data echo cancellation work platform are presented. The cost function adaptation algorithms use an error exponent update strategy based on an absolute error mapping, which is updated at every iteration. The quadratic and nonquadratic cost functions are special cases of the new family. Several possible realisations are introduced using these approaches. The noisy error problem is discussed and the digital recursive filter estimator is proposed. The simulation outcomes confirm the effectiveness of the proposed family of algorithms.

Adaptive data echo cancellation using cost function adaptation

For a digital echo canceller it is desirable to reduce the adaptation time, during which the transmission of useful data is not possible. LMS is a non-optimal algorithm in this case as the signals involved are statistically non-Gaussian. Walach and Widrow (IEEE Trans. Inform. Theory 30 (2) (March 1984) 275-283) investigated the use of a power of 4, while other research established algorithms with arbitrary integer (Pei and Tseng, IEEE J. Selected Areas Commun. 12(9)(December 1994) 1540-1547) or non-quadratic power (Shah and Cowan, IEE.Proc.-Vis. Image Signal Process. 142 (3) (June 1995) 187-191). This paper suggests that continuous and automatic, adaptation of the error exponent gives a more satisfactory result. The family of cost function adaptation (CFA) stochastic gradient algorithm proposed allows an increase in convergence rate and, an improvement of residual error. As special case the staircase CFA algorithm is first presented, then the smooth CFA is developed. Details of implementations are also discussed. Results of simulation are provided to show the properties of the proposed family of algorithms. (C) 2000 Elsevier Science B.V. All rights reserved.

"That a black twisty divil could be hiding under such comeliness": Woman vs woman in Early Twentieth-Century Irish Theatre

This essay investigates representations of womanhood in early twentieth-century Irish theatre, particularly in terms of the disjunction between woman as a physical, social being and the symbolic Woman as an ideological construction promoted by both church and state. It uses Lacanian theory in conjunction with Irish women’s studies scholarship to inform the analyses of plays by dramatists including Maud Gonne, Padraic Colum, Lennox Robinson, and T. C. Murray. The aim is to show how women in Irish society were faced with the impossible task of fulfilling such idealized roles as Woman, Wife, and Mother, and how this situation was variously represented and contested in the theatre during the first quarter of the twentieth century.

Screens, Closets, and Echo-Chambers of the Mind: The Struggle to Represent the Inner Life on Stage

Screens, Closets, and Echo-Chambers of the Mind: The Struggle to Represent the Inner Life on Stage

A Spitzer space telescope study of Sn 2002hh: An infrared echo from a Type IIP supernova

We present late-time ( 590 - 994 days) mid-IR photometry of the normal but highly reddened Type IIP supernova SN 2002hh. Bright, cool, slowly fading emission is detected from the direction of the supernova. Most of this flux appears not to be driven by the supernova event but instead probably originates in a cool, obscured star formation region or molecular cloud along the line of sight. We also show, however, that the declining component of the flux is consistent with an SN-powered IR echo from a dusty progenitor CSM. Mid-IR emission could also be coming from newly condensed dust and/or an ejecta/CSM impact, but their contributions are likely to be small. For the case of a CSM-IR echo, we infer a dust mass of as little as 0.036 M-. with a corresponding CSM mass of 3.6(0.01/ r(dg)) M-., where rdg is the dust-to-gas mass ratio. Such a CSM would have resulted from episodic mass loss whose rate declined significantly about 28,000 years ago. Alternatively, an IR echo from a surrounding, dense, dusty molecular cloud might also have been responsible for the fading component. Either way, this is the first time that an IR echo has been clearly identified in a Type IIP supernova. We find no evidence for or against the proposal that Type IIP supernovae produce large amounts of dust via grain condensation in the ejecta. However, within the CSM-IR echo scenario, the mass of dust derived implies that the progenitors of the most common of core-collapse supernovae may make an important contribution to the universal dust content.

The syntax of concealment:Reliable methods for plain text information hiding

Many plain text information hiding techniques demand deep semantic processing, and so suffer in reliability. In contrast, syntactic processing is a more mature and reliable technology. Assuming a perfect parser, this paper evaluates a set of automated and reversible syntactic transforms that can hide information in plain text without changing the meaning or style of a document. A large representative collection of newspaper text is fed through a prototype system. In contrast to previous work, the output is subjected to human testing to verify that the text has not been significantly compromised by the information hiding procedure, yielding a success rate of 96% and bandwidth of 0.3 bits per sentence. © 2007 SPIE-IS&T.