Analysis and design of three-stage concatenated color-shift keying

Visible Light Communication (VLC) relies on abundant unlicensed bandwidth resources. As an attractive high-data-rate modulation scheme designed for VLC, Color Shift Keying (CSK) assisted modulation is analysed. We commence our study from an uncoded M-CSK scheme relying on the joint Maximum Likelihood (ML) Hard-Detection (HD) of three colors, when communicating over an AWGN channel, where both empirical and analytical results are provided. We invoke EXtrinsic Information Transfer (EXIT) charts for designing a Maximum A-posteriori Probability (MAP) based Soft-Detection (SD) aided iterative receiver jointly detecting the three colors. Based on the EXIT characteristics of M-CSK, we design different signal labeling strategies for diverse color constellations and detection schemes, which are capable of achieving a substantially improved Bit Error Ratio (BER) performance. Thus, given a fixed transmission power, a CSK system using our proposed signal labeling is capable of increasing the reliable data transmission distance by about 30%

Surjective endomorphisms of projective surfaces -- the existence of infinitely many dense orbits

Let $f \colon X \to X$ be a surjective endomorphism of a normal projective surface. When $\operatorname{deg} f \geq 2$, applying an (iteration of) $f$-equivariant minimal model program (EMMP), we determine the geometric structure of $X$. Using this, we extend the second author's result to singular surfaces to the extent that either $X$ has an $f$-invariant non-constant rational function, or $f$ has infinitely many Zariski-dense forward orbits; this result is also extended to Adelic topology (which is finer than Zariski topology)

Estimation and Testing Methods for Monotone Transformation Models

This thesis deals with a general class of transformation models that contains many important semiparametric regression models as special cases. It develops a self-induced smoothing method for estimating the regression coefficients of these models, resulting in simultaneous point and variance estimations. The self-induced smoothing does not require bandwidth selection, yet provides the right amount of smoothness so that the estimator is asymptotically normal with mean zero (unbiased) and variance-covariance matrix consistently estimated by the usual sandwich-type estimator. An iterative algorithm is given for the variance estimation and shown to numerically converge to a consistent limiting variance estimator. The self-induced smoothing method is also applied to selecting the non-zero regression coefficients for the monotone transformation models. The resulting regularized estimator is shown to be root-n-consistent and achieve desirable sparsity and asymptotic normality under certain regularity conditions. The smoothing technique is used to estimate the monotone transformation function as well. The smoothed rank-based estimate of the transformation function is uniformly consistent and converges weakly to a Gaussian process which is the same as the limiting process for that without smoothing. An explicit covariance function estimate is obtained by using the smoothing technique, and shown to be consistent. The estimation of the transformation function reduces the multiple hypotheses testing problems for the monotone transformation models to those for linear models. A new hypotheses testing procedure is proposed in this thesis for linear models and shown to be more powerful than some widely-used testing methods when there is a strong collinearity in data. It is proved that the new testing procedure controls the family-wise error rate