• East Asian mathematical journal
• /
• v.17 no.2
• /
• pp.191-195
• /
• 2001

The purpose of this note is to introduce various metrics and to prove the properties of given metric spaces.

• Journal of the Chungcheong Mathematical Society
• /
• v.22 no.2
• /
• pp.245-250
• /
• 2009

We consider a code function from the unit interval which has a generalized dyadic expansion into a coding space which has an associated ultra metric. The code function is not a bi-Lipschitz map but a dimension-preserving map in the sense that the Hausdorff and packing dimensions of any subset in the unit interval and its image under the code function coincide respectively.

• Journal of the Chungcheong Mathematical Society
• /
• v.19 no.4
• /
• pp.357-364
• /
• 2006

We study Hausdorff and packing dimensions of subsets of a general coding space with a generalized ultra metric from a multifractal spectrum induced by a self-similar measure on a self-similar Cantor set using a function satisfying a H${\ddot{o}}$older condition.

• Korean Journal of Mathematics
• /
• v.12 no.1
• /
• pp.1-5
• /
• 2004

We study Hausdorff and packing dimensions of subsets of a coding space with an ultra metric from a multifractal spectrum induced by a self-similar measure on a Cantor set using a function satisfying a H$\ddot{o}$lder condition.

• Journal of the Chungcheong Mathematical Society
• /
• v.21 no.4
• /
• pp.527-532
• /
• 2008

We compare a coding space which has an ultra metric with the unit interval which has an associated generalized dyadic expansion. The two spaces are not homeomorphic but dimensionally equivalent in the sense that the Hausdorff and packing dimensions of the corresponding distribution sets in the two spaces coincide.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.7
• /
• pp.2614-2632
• /
• 2015

A multiple symbol detection (MSD) algorithm is proposed relying on soft information for ultra-wideband systems, where differential space-time block code is employed. The proposed algorithm aims to calculate a posteriori probabilities (APP) of information symbols, where a forward and backward message passing mechanism is implemented based on the BCJR algorithm. Specifically, an MSD metric is analyzed and performed for serving the APP model. Furthermore, an autocorrelation sampling is employed to exploit signals dependencies among different symbols, where the observation window slides one symbol each time. With the aid of the bidirectional message passing mechanism and the proposed sampling approach, the proposed MSD algorithm achieves a better detection performance as compared with the existing MSD. In addition, when the proposed MSD is exploited in conjunction with channel decoding, an iterative soft-input soft-output MSD approach is obtained. Finally, simulations demonstrate that the proposed approaches improve detection performance significantly.