362 resultados para Jamming Cancellation
Resumo:
Two jamming cancellation algorithms are developed based on a stable solution of least squares problem (LSP) provided by regularization. They are based on filtered singular value decomposition (SVD) and modifications of the Greville formula. Both algorithms allow an efficient hardware implementation. Testing results on artificial data modeling difficult real-world situations are also provided.
Resumo:
Generative music systems can be performed by manipulating the values of their algorithmic parameters, and their semi-autonomous nature provides an opportunity for coordinated interaction amongst a network of systems, a practice we call Network Jamming. This paper outlines the characteristics of this networked performance practice and discusses the types of mediated musical relationships and ensemble configurations that can arise. We have developed and tested the jam2jam network jamming software over recent years. We describe this system, draw from our experiences with it, and use it to illustrate some characteristics of Network Jamming.
Resumo:
As the need for concepts such as cancellation and OR-joins occurs naturally in business scenarios, comprehensive support in a workflow language is desirable. However, there is a clear trade-off between the expressive power of a language (i.e., introducing complex constructs such as cancellation and OR-joins) and ease of verification. When a workflow contains a large number of tasks and involves complex control flow dependencies, verification can take too much time or it may even be impossible. There are a number of different approaches to deal with this complexity. Reducing the size of the workflow, while preserving its essential properties with respect to a particular analysis problem, is one such approach. In this paper, we present a set of reduction rules for workflows with cancellation regions and OR-joins and demonstrate how they can be used to improve the efficiency of verification. Our results are presented in the context of the YAWL workflow language.
Resumo:
In a traditional anti-jamming system a transmitter who wants to send a signal to a single receiver spreads the signal power over a wide frequency spectrum with the aim of stopping a jammer from blocking the transmission. In this paper, we consider the case that there are multiple receivers and the transmitter wants to broadcast a message to all receivers such that colluding groups of receivers cannot jam the reception of any other receiver. We propose efficient coding methods that achieve this goal and link this problem to well-known problems in combinatorics. We also link a generalisation of this problem to the Key Distribution Pattern problem studied in combinatorial cryptography.
Resumo:
In recent years, electric propulsion systems have increasingly been used in land, sea and air vehicles. The vehicular power systems are usually loaded with tightly regulated power electronic converters which tend to draw constant power. Since the constant power loads (CPLs) impose negative incremental resistance characteristics on the feeder system, they pose a potential threat to the stability of vehicular power systems. This effect becomes more significant in the presence of distribution lines between source and load in large vehicular power systems such as electric ships and more electric aircrafts. System transients such as sudden drop of converter side loads or increase of constant power requirement can cause complete system instability. Most of the existing research work focuses on the modeling and stabilization of DC vehicular power systems with CPLs. Only a few solutions are proposed to stabilize AC vehicular power systems with non-negligible distribution lines and CPLs. Therefore, this paper proposes a novel loop cancellation technique to eliminate constant power instability in AC vehicular power systems with a theoretically unbounded system stability region. Analysis is carried out on system stability with the proposed method and simulation results are presented to validate its effectiveness.
Resumo:
This article considers the ongoing debate over the appropriation of well-known and famous trade marks by the No Logo Movement for the purposes of political and social critique. It focuses upon one sensational piece of litigation in South Africa, Laugh It Off Promotions v. South African Breweries International (Finance) B.V. t/a Sabmark International. In this case, a group called Laugh It Off Promotions subjected the trade marks of the manufacturers of Carling Beer were subjected to parody, social satire, and culture jamming. The beer slogan “Black Label” was turned into a T-Shirt entitled “Black Labour/ White Guilt”. In the ensuing litigation, the High Court of South Africa and the Supreme Court of Appeal were of the opinion that the appropriation of the mark was a case of hate speech. However, the Constitutional Court of South Africa disagreed, finding that the parodies of a well-known, famous trade mark did not constitute trade mark dilution. Moseneke J observed that there was a lack of evidence of economic or material harm; and Sachs J held that there is a need to provide latitude for parody, laughter, and freedom of expression. The decision of the Constitutional Court of South Africa provides some important insights into the nature of trade mark dilution, the role of parody and satire, and the relevance of constitutional protections of freedom of speech and freedom of expression. Arguably, the ruling will be of help in the reformation of trade mark dilution law in other jurisdictions – such as the United States. The decision in Laugh It Off Promotions v. South African Breweries International demonstrates that trade mark law should not be immune from careful constitutional scrutiny.
Resumo:
In uplink orthogonal frequency division multiple access (OFDMA), large timing offsets (TO) and/or carrier frequency offsets (CFO) of other users with respect to a desired user can cause significant multiuser interference (MUI). In this letter, we analytically characterize the degradation in the average output signal-to-interference ratio (SIR) due to the combined effect of both TOs as well as CFOs in uplink OFDMA. Specifically, we derive closed-form expressions for the average SIR at the DFT output in the presence of large CFOs and TOs. The analyticalexpressions derived for the signal and various interference terms at the DFT output are used to devise an interference cancelling receiver to mitigate the effect of CFO/TO-induced interferences.
Resumo:
The one-loop quadratically divergent mass corrections in globally supersymmetric gauge theories with spontaneously broken abelian and non-abelian gauge symmetry are studied. Quadratically divergent mass corrections are found to persist in an abelian model with an ABJ anomaly. However, additional supermultiplets necessary to cancel the ABJ anomaly, turn out to be sufficient to eliminate the quadratic divergences as well, rendering the theory natural. Quadratic divergences are shown to vanish also in the case of an anomaly free model with spontaneously broken non-abelian gauge symmetry.
Resumo:
In uplink OFDMA, carrier frequency offsets (CFO) and/or timing offsets (TO) of other users with respect to a desired user can cause multiuser interference (MUI). In practical uplink OFDMA systems (e.g., IEEE 802.16e standard), effect of this MUI is made acceptably small by requiring that frequency/timing alignment be achieved at the receiver with high precision (e.g., CFO must be within 1 % of the subcarrier spacing and TO must be within 1/8th of the cyclic prefix duration in IEEE 802.16e), which is realized using complex closed-loop frequency/timing correction between the transmitter and the receiver. An alternate open-loop approach to handle the MUI induced by large CFOs and TOs is to employ interference cancellation techniques at the receiver. In this paper, we first analytically characterize the degradation in the average output signal-to-interference ratio (SIR) due to the combined effect of large CFOs and TOs in uplink OFDMA. We then propose a parallel interference canceller (PIC) for the mitigation of interference due to CFOs and TOs in this system. We show that the proposed PIC effectively mitigates the performance loss due to CFO/TO induced interference in uplink OFDMA.
Resumo:
In uplink orthogonal frequency division multiple access (OFDMA) systems, multiuser interference (MUI) occurs due to different carrier frequency offsets (CFO) of different users at the receiver. In this paper, we present a minimum mean square error (MMSE) based approach to MUI cancellation in uplink OFDMA. We derive a recursion to approach the MMSE solution. We present a structure-wise and performance-wise comparison of this recursive MMSE solution with a linear PIC receiver as well as other detectors recently proposed in the literature. We show that the proposed recursive MMSE solution encompasses several known detectors in the literature as special cases.
Resumo:
In uplink orthogonal frequency division multiple access (OFDMA) systems, multiuser interference (MUI) occurs due to different carrier frequency offsets (CFO) of different users at the receiver. In this paper, we present a multistage linear parallel interference cancellation (LPIC) approach to mitigate the effect of this MUI in uplink OFDMA. The proposed scheme first performs CFO compensation (in time domain), followed by K DFT operations (where K is the number of users) and multistage LPIC on these DFT outputs. We scale the MUI estimates by weights before cancellation and optimize these weights by maximizing the signal-to-interference ratio (SIR) at the output of the different stages of the LPIC. We derive closed-form expressions for these optimum weights. The proposed LPIC scheme is shown to effectively cancel the MUI caused by the other user CFOs in uplink OFDMA.
Resumo:
In this paper, we present the design and bit error performance analysis of weighted linear parallel interference cancellers (LPIC) for multicarrier (MC) DS-CDMA systems. We propose an LPIC scheme where we estimate (and cancel) the multiple access interference (MAI) based on the soft outputs on individual subcarriers, and the interference cancelled outputs on different subcarriers are combined to form the final decision statistic. We scale the MAI estimate on individual subcarriers by a weight before cancellation; these weights are so chosen to maximize the signal-to-interference ratios at the individual subcarrier outputs. For this weighted LPIC scheme, using an approach involving the characteristic function of the decision variable, we derive exact bit error rate (BER) expressions for different cancellation stages. Using the same approach, we also derive exact BER expressions for the matched filter (MF) and decorrelating detectors for the considered MC DS-CDMA system. We show that the proposed weighted LPIC scheme performs better than the MF detector and the conventional LPIC (where the weights are taken to be unity), and close to the decorrelating detector.
Resumo:
Recently, Guo and Xia gave sufficient conditions for an STBC to achieve full diversity when a PIC (Partial Interference Cancellation) or a PIC-SIC (PIC with Successive Interference Cancellation) decoder is used at the receiver. In this paper, we give alternative conditions for an STBC to achieve full diversity with PIC and PIC-SIC decoders, which are equivalent to Guo and Xia's conditions, but are much easier to check. Using these conditions, we construct a new class of full diversity PIC-SIC decodable codes, which contain the Toeplitz codes and a family of codes recently proposed by Zhang, Xu et. al. as proper subclasses. With the help of the new criteria, we also show that a class of PIC-SIC decodable codes recently proposed by Zhang, Shi et. al. can be decoded with much lower complexity than what is reported, without compromising on full diversity.