425 research outputs found

    Error rate analysis for indoor wireless networks

    Get PDF

    A novel interference rejection scheme for DS-CDMA using adaptive noise cancellation

    Get PDF

    Determining when the absolute state complexity of a Hermitian code achieves its DLP bound

    Get PDF
    Let g be the genus of the Hermitian function field H/F(q)2 and let C-L(D,mQ(infinity)) be a typical Hermitian code of length n. In [Des. Codes Cryptogr., to appear], we determined the dimension/length profile (DLP) lower bound on the state complexity of C-L(D,mQ(infinity)). Here we determine when this lower bound is tight and when it is not. For m less than or equal to n-2/2 or m greater than or equal to n-2/2 + 2g, the DLP lower bounds reach Wolf's upper bound on state complexity and thus are trivially tight. We begin by showing that for about half of the remaining values of m the DLP bounds cannot be tight. In these cases, we give a lower bound on the absolute state complexity of C-L(D,mQ(infinity)), which improves the DLP lower bound. Next we give a good coordinate order for C-L(D,mQ(infinity)). With this good order, the state complexity of C-L(D,mQ(infinity)) achieves its DLP bound (whenever this is possible). This coordinate order also provides an upper bound on the absolute state complexity of C-L(D,mQ(infinity)) (for those values of m for which the DLP bounds cannot be tight). Our bounds on absolute state complexity do not meet for some of these values of m, and this leaves open the question whether our coordinate order is best possible in these cases. A straightforward application of these results is that if C-L(D,mQ(infinity)) is self-dual, then its state complexity (with respect to the lexicographic coordinate order) achieves its DLP bound of n /2 - q(2)/4, and, in particular, so does its absolute state complexity

    RAKE decorrelation as an alternative to rapid power control in DS-CDMA mobile radio

    Get PDF

    A near-far resistant sliding window decorrelating algorithm for multi-user detectors in DS-CDMA systems

    Get PDF

    A sliding window decorrelating receiver for multiuser DS-CDMA mobile radio networks

    Get PDF
    This document is made available in accordance with publisher policies. Please cite only the published version using the reference above. Full terms of use are available

    A near-far resistant algorithm to combat effects of fast fading in multi-user DS-CDMA systems

    Get PDF

    Evaluating the impact of Relative Total Dose Intensity (RTDI) on patients' short and long-term outcome in taxane- and anthracycline-based chemotherapy of metastatic breast cancer- a pooled analysis

    Get PDF
    Background: Chemotherapy dose delay and/or reduction lower relative total dose intensity (RTDI) and may affect short- and long-term outcome of metastatic breast cancer (MBC) patients. Methods: Based on 933 individual patients' data of from 3 randomized MBC trials using an anthracycline and taxane we examined the impact of RTDI on efficacy and determined the lowest optimal RTDI for MBC patients. Results: Median time to disease progression (TTDP) and overall survival (OS) of all patients were 39 and 98 weeks. Overall higher RTDI was correlated with a shorter TTDP (log-rank p = 0.0525 for 85% RTDI cut-off). Proportional hazards assumption was violated, there was an early drop in the TTDP-curve for the high RTDI group. It was explained by the fact that patients with primary disease progression (PDP) do have a high RTDI per definition. Excluding those 114 patients with PDP the negative correlation between RTDI and TTDP vanished. However, non-PDP patients with RTDI-cut-off levels <85% showed a shorter OS than patients with higher RTDI levels (p = 0.0086). Conclusions: Optimizing RTDI above 85% appears to improve long-term outcome of MBC patients receiving first-line chemotherapy. Lowering RTDI had no negative influence on short term outcome like OR and TTDP
    corecore