1. A process for purifying raw phenol produced by the cumyl hydroperoxide cleavage method, which process comprises (i) contacting the raw phenol with an acidic aluminum oxide catalyst at a temperature of 90\u2013200\xb0 C. and a raw material volumetric feed rate of 1\u20136 h\u22121, and (ii) subsequently isolating purified phenol by distillation, wherein the aluminum oxide catalyst comprises a mixture of aluminum and zirconium oxides and sulfates and has a total content of aluminum and zirconium sulfate of from 5 to 15% by mass (calculated on the basis of SO4 ions) and the catalyst has a total content of aluminum and oxide and sulfate of 5\u201330% mass (calculated on the basis of aluminum oxide).
2. The process according to claim 1, wherein the catalyst consists essentially of a mixture of aluminum and zirconium oxides and sulfates.
3. The process according to claim 2, wherein the catalyst is prepared by a process which comprises the steps of treating zirconium hydroxide twice using sulfuric acid in a first sulfation step and a second peptization step, and adding aluminum oxide in the peptizion step wherein aluminum oxide consists of a mixture of boehmite and pseudoboehmite in a mass ration of from 1:3 to 3:1.
The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.
1. A method for recovering symbols from signals received in a shared spectrum, the method comprising:
processing codes of the signals received in the shared spectrum using a block Fourier transform (FT) and producing a code block diagonal matrix;
estimating a channel response of the received signals;
extending and modifying the channel response to produce a block circulant matrix and taking a block FT and producing a channel response block diagonal matrix;
combining the code block diagonal matrix and the channel response block diagonal matrix;
sampling the received signals;
processing the received signal using the combined code block diagonal matrix and the channel response block diagonal matrix with a Cholesky algorithm;
performing a block inverse FT on a result of the Cholesky algorithm to produce spread symbols; and
despreading the spread symbols to recover symbols of the received signals.
2. The method of claim 1 wherein the Cholesky algorithm includes determining a Cholesky factor and performing forward and backward substitution.
3. The method of claim 1 wherein the combining the code block diagonal matrix and the channel response block diagonal matrix includes adding factor of the noise variance multiplied with an identity matrix.
4. The method of claim 1 wherein the code block diagonal matrix is produced by multiplying a code matrix with a complex conjugate transpose of the code matrix and taking a block FT of a result of the multiplying.
5. The method of claim 1 wherein the code block diagonal matrix is produced by inputting a number of codes of interest into a look-up table.
6. The method of claim 1 wherein the code block diagonal matrix is produced by inputting a number of codes of interest into a look-up table and scaling a resulting diagonal block matrix from the look-up table by an average power level.
7. The method of claim 1 wherein the code block diagonal matrix is produced by inputting code identifiers of the received signals into a look-up table.
8. The method of claim 1 wherein the code block diagonal matrix is produced by inputting code identifiers of the received signals into a look-up table and scaling a resulting diagonal block matrix from the look-up table by an average power level.
9. The method of claim 1 wherein the code block diagonal matrix is produced by inputting codes of the received signal into a look-up table.
10. The method of claim 1 wherein the code block diagonal matrix is produced by inputting inputting codes of the received signal into a look-up table and scaling a resulting diagonal block matrix from the look-up table by an average power level.
11. A wireless transmitreceive unit (WTRU) for use in recovering symbols from signals received in a shared spectrum, the WTRU comprising:
means for processing codes of the signals received in the shared spectrum using a block Fourier transform (FT) and producing a code block diagonal matrix;
means for estimating a channel response of the received signals;
means for extending and modifying the channel response to produce a block circulant matrix and taking a block FT and producing a channel response block diagonal matrix;
means for combining the code block diagonal matrix and the channel response block diagonal matrix;
means for sampling the received signals;
means for processing the received signal using the combined code block diagonal matrix and the channel response block diagonal matrix with a Cholesky algorithm;
means for performing a block inverse FT on a result of the Cholesky algorithm to produce spread symbols; and
means for despreading the spread symbols to recover symbols of the received signals.
12. The WTRU of claim 11 wherein the Cholesky algorithm includes determining a Cholesky factor and performing forward and backward substitution.
13. The WTRU of claim 11 wherein the combining the code block diagonal matrix and the channel response block diagonal matrix includes adding factor of the noise variance multiplied with an identity matrix.
14. The WTRU of claim 11 wherein the code block diagonal matrix is produced by multiplying a code matrix with a complex conjugate transpose of the code matrix and taking a block FT of a result of the multiplying.
15. The WTRU of claim 11 wherein the code block diagonal matrix is produced by inputting a number of codes of interest into a look-up table.
16. The WTRU of claim 11 wherein the code block diagonal matrix is produced by inputting a number of codes of interest into a look-up table and scaling a resulting diagonal block matrix from the look-up table by an average power level.
17. The WTRU of claim 11 wherein the code block diagonal matrix is produced by inputting code identifiers of the received signals into a look-up table.
18. The WTRU of claim 11 wherein the code block diagonal matrix is produced by inputting code identifiers of the received signals into a look-up table and scaling a resulting diagonal block matrix from the look-up table by an average power level.
19. The WTRU of claim 11 wherein the code block diagonal matrix is produced by inputting codes of the received signal into a look-up table.
20. The WTRU of claim 11 wherein the code block diagonal matrix is produced by inputting inputting codes of the received signal into a look-up table and scaling a resulting diagonal block matrix from the look-up table by an average power level.
31. A wireless transmitreceive unit (WTRU) for use in recovering symbols from signals received in a shared spectrum, the WTRU comprising:
a block Fourier transform (FT) device for processing codes of the signals received in the shared spectrum using a block FT and producing a code block diagonal matrix;
a channel estimation device for estimating a channel response of the received signals;
an extending and modifying block for extending and modifying the channel response to produce a block circulant matrix and taking a block FT and producing a channel response block diagonal matrix;
a circuit for combining the code block diagonal matrix and the channel response block diagonal matrix;
a sampling device for sampling the received signals;
a Cholesky decomposition device and forward and backward substitution devices for processing the received signal using the combined code block diagonal matrix and the channel response block diagonal matrix with a Cholesky algorithm;
an inverse block FT device for performing a block inverse FT on an output of the backward substitution device to produce spread symbols; and
a despreader for despreading the spread symbols to recover symbols of the received signals.
32. The WTRU of claim 31 wherein the circuit for combining comprises a two multipliers.
33. The WTRU of claim 31 wherein the circuit for combining includes adding factor of the noise variance multiplied with an identity matrix.
34. The WTRU of claim 31 further comprising a Hermetian device and a multiplier for multiplying a code matrix with a complex conjugate transpose of the code matrix.
35. The WTRU of claim 31 further comprising a look-up table wherein the code block diagonal matrix is produced by inputting a number of codes of interest into a look-up table.
36. The WTRU of claim 31 comprising a look-up table and a multiplier wherein the code block diagonal matrix is produced by inputting a number of codes of interest into a look-up table and multiplying a resulting diagonal block matrix from the look-up table by an average power level.
37. The WTRU of claim 31 further comprising a look-up table wherein the code block diagonal matrix is produced by inputting code identifiers of the received signals into a look-up table.
38. The WTRU of claim 31 comprising a look-up table and a multiplier wherein the code block diagonal matrix is produced by inputting code identifiers of the received signals into a look-up table and multiplying a resulting diagonal block matrix from the look-up table by an average power level.
39. The WTRU of claim 31 further comprising a look-up table wherein the code block diagonal matrix is produced by inputting codes of the received signal into a look-up table.
40. The WTRU of claim 31 comprising a look-up table and a multiplier wherein the code block diagonal matrix is produced by inputting inputting codes of the received signal into a look-up table and multiplying a resulting diagonal block matrix from the look-up table by an average power level.
51. A base station for use in recovering symbols from signals received in a shared spectrum, the base station comprising:
means for processing codes of the signals received in the shared spectrum using a block Fourier transform (FT) and producing a code block diagonal matrix;
means for estimating a channel response of the received signals;
means for extending and modifying the channel response to produce a block circulant matrix and taking a block FT and producing a channel response block diagonal matrix;
means for combining the code block diagonal matrix and the channel response block diagonal matrix;
means for sampling the received signals;
means for processing the received signal using the combined code block diagonal matrix and the channel response block diagonal matrix with a Cholesky algorithm;
means for performing a block inverse FT on a result of the Cholesky algorithm to produce spread symbols; and
means for despreading the spread symbols to recover symbols of the received signals.
52. The base station of claim 51 wherein the Cholesky algorithm includes determining a Cholesky factor and performing forward and backward substitution.
53. The base station of claim 51 wherein the combining the code block diagonal matrix and the channel response block diagonal matrix includes adding factor of the noise variance multiplied with an identity matrix.
54. The base station of claim 51 wherein the code block diagonal matrix is produced by multiplying a code matrix with a complex conjugate transpose of the code matrix and taking a block FT of a result of the multiplying.
55. The base station of claim 51 wherein the code block diagonal matrix is produced by inputting a number of codes of interest into a look-up table.
56. The base station of claim 51 wherein the code block diagonal matrix is produced by inputting a number of codes of interest into a look-up table and scaling a resulting diagonal block matrix from the look-up table by an average power level.
57. The base station of claim 51 wherein the code block diagonal matrix is produced by inputting code identifiers of the received signals into a look-up table.
58. The base station of claim 51 wherein the code block diagonal matrix is produced by inputting code identifiers of the received signals into a look-up table and scaling a resulting diagonal block matrix from the look-up table by an average power level.
59. The base station of claim 51 wherein the code block diagonal matrix is produced by inputting codes of the received signal into a look-up table.
60. The base station of claim 51 wherein the code block diagonal matrix is produced by inputting inputting codes of the received signal into a look-up table and scaling a resulting diagonal block matrix from the look-up table by an average power level.
61. A base station for use in recovering symbols from signals received in a shared spectrum, the base station comprising:
a block Fourier transform (FT) device for processing codes of the signals received in the shared spectrum using a block FT and producing a code block diagonal matrix;
a channel estimation device for estimating a channel response of the received signals;
an extending and modifying block for extending and modifying the channel response to produce a block circulant matrix and taking a block FT and producing a channel response block diagonal matrix;
a circuit for combining the code block diagonal matrix and the channel response block diagonal matrix;
a sampling device for sampling the received signals;
a Cholesky decomposition device and forward and backward substitution devices for processing the received signal using the combined code block diagonal matrix and the channel response block diagonal matrix with a Cholesky algorithm;
an inverse block FT device for performing a block inverse FT on an output of the backward substitution device to produce spread symbols; and
a despreader for despreading the spread symbols to recover symbols of the received signals.
62. The base station of claim 61 wherein the circuit for combining comprises a two multipliers.
63. The base station of claim 61 wherein the circuit for combining includes adding factor of the noise variance multiplied with an identity matrix.
64. The base station of claim 61 further comprising a Hermetian device and a multiplier for multiplying a code matrix with a complex conjugate transpose of the code matrix.
65. The base station of claim 61 further comprising a look-up table wherein the code block diagonal matrix is produced by inputting a number of codes of interest into a look-up table.
66. The base station of claim 61 comprising a look-up table and a multiplier wherein the code block diagonal matrix is produced by inputting a number of codes of interest into a look-up table and multiplying a resulting diagonal block matrix from the look-up table by an average power level.
67. The base station of claim 61 further comprising a look-up table wherein the code block diagonal matrix is produced by inputting code identifiers of the received signals into a look-up table.
68. The base station of claim 61 comprising a look-up table and a multiplier wherein the code block diagonal matrix is produced by inputting code identifiers of the received signals into a look-up table and multiplying a resulting diagonal block matrix from the look-up table by an average power level.
69. The base station of claim 61 further comprising a look-up table wherein the code block diagonal matrix is produced by inputting codes of the received signal into a look-up table.
70. The base station of claim 61 comprising a look-up table and a multiplier wherein the code block diagonal matrix is produced by inputting inputting codes of the received signal into a look-up table and multiplying a resulting diagonal block matrix from the look-up table by an average power level.